Gottlob5th 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
Mitarbeit:Gottlob, Georg; Leitsch, Alexander; Mundici, Danile
Gottlob5th 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
Mitarbeit:Gottlob, Georg; Leitsch, Alexander; Mundici, Danile
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
This book constitutes the refereed proceedings of the 5th Kurt Gödel 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.
Andere Kunden interessierten sich auch für
- Ricardo Caferra / Gernot Salzer (eds.)Automated Deduction in Classical and Non-Classical Logics39,99 €
- Computational Logic and Proof Theory39,99 €
- BerardiTypes for Proofs and Programs39,99 €
- BaumgartnerTheorem Proving with Analytic Tableaux and Related Methods39,99 €
- Joe Hurd / Tom Melham (eds.)Theorem Proving in Higher Order Logics39,99 €
- Hubert Comon-Lundh (Volume ed.) / Claude Kirchner / Hélène KirchnerRewriting, Computation and Proof38,99 €
- Gerd WagnerVivid Logic39,99 €
-
-
-
This book constitutes the refereed proceedings of the 5th Kurt Gödel 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.
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.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 1289
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-63385-3
- 1997.
- Seitenzahl: 364
- Erscheinungstermin: 13. August 1997
- Englisch
- Abmessung: 235mm x 155mm x 20mm
- Gewicht: 473g
- ISBN-13: 9783540633853
- ISBN-10: 3540633855
- Artikelnr.: 09230953
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
- Lecture Notes in Computer Science 1289
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-63385-3
- 1997.
- Seitenzahl: 364
- Erscheinungstermin: 13. August 1997
- Englisch
- Abmessung: 235mm x 155mm x 20mm
- Gewicht: 473g
- ISBN-13: 9783540633853
- ISBN-10: 3540633855
- Artikelnr.: 09230953
- Herstellerkennzeichnung
- Springer-Verlag GmbH
- Tiergartenstr. 17
- 69121 Heidelberg
- ProductSafety@springernature.com
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 theGö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.
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 theGö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.