Borrow it
Coverart for item
The Resource Computational Logic and Proof Theory : 5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings

Computational Logic and Proof Theory : 5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings

Creator
Contributor
Summary
This book constitutes the refereed proceedings of the 5th Kurt Gdel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997. The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity
Language
eng
Work
Publication
Extent
1 online resource.
Contents
  • Paramodulation, superposition, and simplification
  • Explaining Gentzen's consistency proof within infinitary proof theory
  • Alogtime algorithms for tree isomorphism, comparison, and canonization
  • Ultrafilter logic and generic reasoning
  • Informal rigor and mathematical understanding
  • Resolution, inverse method and the sequent calculus
  • Subtyping over a lattice (abstract)
  • A new method for bounding the complexity of modal logics
  • Parameter free induction and reflection
  • Looking for an analogue of Rice's Theorem in circuit complexity theory
  • Two connections between Linear Logic and?ukasiewicz Logics
  • Structuring of computer-generated proofs by cut introduction
  • NaDSyL and some applications
  • Markov's rule is admissible in the set theory with intuitionistic logic
  • Bounded hyperset theory and web-like data bases
  • Invariant definability
  • Comparing computational representations of Herbrand models
  • Restart tableaux with selection function
  • Two semantics and logics based on the Gödel interpretation
  • On the completeness and decidability of a restricted first order linear temporal logic
  • Propositional quantification in intuitionistic logic
  • Sketch-as-proof
  • Translating set theoretical proofs into type theoretical programs
  • Denotational semantics for polarized (but-non-constrained) LK by means of the additives
  • The undecidability of simultaneous rigid E-unification with two variables
  • The tangibility reflection principle for self-verifying axiom systems
  • Upper bounds for standardizations and an application
Isbn
9783540698067
Instance
Label
Computational Logic and Proof Theory : 5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings
Title
Computational Logic and Proof Theory
Title remainder
5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings
Creator
Contributor
Subject
Language
eng
Summary
This book constitutes the refereed proceedings of the 5th Kurt Gdel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997. The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity
Member of
Cataloging source
DKDLA
http://library.link/vocab/creatorName
Gottlob, G.
Dewey number
511.3
Index
no index present
LC call number
QA76.9.A96
Literary form
non fiction
Nature of contents
  • dictionaries
  • standards specifications
http://library.link/vocab/relatedWorkOrContributorDate
  • 1952-
  • 1946-
http://library.link/vocab/relatedWorkOrContributorName
  • Leitsch, Alexander
  • Mundici, Daniele
Series statement
Lecture Notes in Computer Science
Series volume
1289,
http://library.link/vocab/subjectName
  • Computer science
  • Computer software
  • Artificial intelligence
  • Logic, Symbolic and mathematical
  • Mathematical Logic and Formal Languages
  • Artificial Intelligence (incl. Robotics)
  • Mathematical Logic and Foundations
  • Algorithm Analysis and Problem Complexity
  • Artificial intelligence
  • Computer science
  • Computer software
  • Logic, Symbolic and mathematical
  • Computer Science
  • Engineering & Applied Sciences
Label
Computational Logic and Proof Theory : 5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings
Instantiates
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Paramodulation, superposition, and simplification -- Explaining Gentzen's consistency proof within infinitary proof theory -- Alogtime algorithms for tree isomorphism, comparison, and canonization -- Ultrafilter logic and generic reasoning -- Informal rigor and mathematical understanding -- Resolution, inverse method and the sequent calculus -- Subtyping over a lattice (abstract) -- A new method for bounding the complexity of modal logics -- Parameter free induction and reflection -- Looking for an analogue of Rice's Theorem in circuit complexity theory -- Two connections between Linear Logic and?ukasiewicz Logics -- Structuring of computer-generated proofs by cut introduction -- NaDSyL and some applications -- Markov's rule is admissible in the set theory with intuitionistic logic -- Bounded hyperset theory and web-like data bases -- Invariant definability -- Comparing computational representations of Herbrand models -- Restart tableaux with selection function -- Two semantics and logics based on the Gödel interpretation -- On the completeness and decidability of a restricted first order linear temporal logic -- Propositional quantification in intuitionistic logic -- Sketch-as-proof -- Translating set theoretical proofs into type theoretical programs -- Denotational semantics for polarized (but-non-constrained) LK by means of the additives -- The undecidability of simultaneous rigid E-unification with two variables -- The tangibility reflection principle for self-verifying axiom systems -- Upper bounds for standardizations and an application
Control code
769774199
Extent
1 online resource.
Form of item
online
Isbn
9783540698067
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-63385-5
Specific material designation
remote
System control number
(OCoLC)769774199
Label
Computational Logic and Proof Theory : 5th Kurt Gödel Colloquium, KGC '97 Vienna, Austria, August 25 29, 1997 Proceedings
Publication
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
Paramodulation, superposition, and simplification -- Explaining Gentzen's consistency proof within infinitary proof theory -- Alogtime algorithms for tree isomorphism, comparison, and canonization -- Ultrafilter logic and generic reasoning -- Informal rigor and mathematical understanding -- Resolution, inverse method and the sequent calculus -- Subtyping over a lattice (abstract) -- A new method for bounding the complexity of modal logics -- Parameter free induction and reflection -- Looking for an analogue of Rice's Theorem in circuit complexity theory -- Two connections between Linear Logic and?ukasiewicz Logics -- Structuring of computer-generated proofs by cut introduction -- NaDSyL and some applications -- Markov's rule is admissible in the set theory with intuitionistic logic -- Bounded hyperset theory and web-like data bases -- Invariant definability -- Comparing computational representations of Herbrand models -- Restart tableaux with selection function -- Two semantics and logics based on the Gödel interpretation -- On the completeness and decidability of a restricted first order linear temporal logic -- Propositional quantification in intuitionistic logic -- Sketch-as-proof -- Translating set theoretical proofs into type theoretical programs -- Denotational semantics for polarized (but-non-constrained) LK by means of the additives -- The undecidability of simultaneous rigid E-unification with two variables -- The tangibility reflection principle for self-verifying axiom systems -- Upper bounds for standardizations and an application
Control code
769774199
Extent
1 online resource.
Form of item
online
Isbn
9783540698067
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/3-540-63385-5
Specific material designation
remote
System control number
(OCoLC)769774199

Subject

Member of

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Missouri Libraries. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...