Computational logic and proof theory : 5th Kurt Gödel Colloquium, KGC '97, Vienna, Austria, August 25 29, 1997 : proceedings
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...
Salvato in:
| Ente Autore: | |
|---|---|
| Altri autori: | , , |
| Natura: | Livre numérique |
| Lingua: | Anglais |
| Pubblicazione: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serie: | Lecture notes in computer science
1289 |
| Soggetti: | |
| Accesso online: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Computational logic and proof theory, 5th Kurt Gödel Colloquium, KGC '97, Vienna, Austria, August 25-29, 1997, proceedings, Georg Gottlob, Alexander Leitsch, Daniele Mundici, eds, 1997, Berlin, Springer, 1 vol. (VIII-348 p.), Lecture notes in computer science, 3-540-63385-5 • Computational Logic and Proof Theory, Texte imprimé, 9783662185575 |
Sommario:
- 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.