LEADER 05150nam 22007095 450 001 9910144919503321 005 20200702033501.0 010 $a3-540-69806-X 024 7 $a10.1007/3-540-63385-5 035 $a(CKB)1000000000234696 035 $a(SSID)ssj0000322031 035 $a(PQKBManifestationID)11257608 035 $a(PQKBTitleCode)TC0000322031 035 $a(PQKBWorkID)10282130 035 $a(PQKB)11070583 035 $a(DE-He213)978-3-540-69806-7 035 $a(PPN)155225421 035 $a(EXLCZ)991000000000234696 100 $a20121227d1997 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputational Logic and Proof Theory$b[electronic resource] $e5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings /$fedited by Georg Gottlob, Alexander Leitsch, Daniele Mundici 205 $a1st ed. 1997. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1997. 215 $a1 online resource (IX, 355 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1289 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-63385-5 327 $aParamodulation, 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. 330 $aThis 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1289 606 $aMathematical logic 606 $aProgramming languages (Electronic computers) 606 $aArtificial intelligence 606 $aAlgorithms 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aProgramming Languages, Compilers, Interpreters$3https://scigraph.springernature.com/ontologies/product-market-codes/I14037 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 615 0$aMathematical logic. 615 0$aProgramming languages (Electronic computers). 615 0$aArtificial intelligence. 615 0$aAlgorithms. 615 14$aMathematical Logic and Foundations. 615 24$aProgramming Languages, Compilers, Interpreters. 615 24$aArtificial Intelligence. 615 24$aMathematical Logic and Formal Languages. 615 24$aAlgorithm Analysis and Problem Complexity. 676 $a511.3 702 $aGottlob$b Georg$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLeitsch$b Alexander$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMundici$b Daniele$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 02$aKurt Go?del Society. 712 12$aKurt Gčodel Colloquium 906 $aBOOK 912 $a9910144919503321 996 $aComputational Logic and Proof Theory$92262776 997 $aUNINA