LEADER 05892nam 22006855 450 001 996465881103316 005 20200706043815.0 010 $a3-540-47943-0 024 7 $a10.1007/BFb0022546 035 $a(CKB)1000000000234007 035 $a(SSID)ssj0000322032 035 $a(PQKBManifestationID)11231380 035 $a(PQKBTitleCode)TC0000322032 035 $a(PQKBWorkID)10280366 035 $a(PQKB)10987672 035 $a(DE-He213)978-3-540-47943-7 035 $a(PPN)155211560 035 $a(EXLCZ)991000000000234007 100 $a20130109d1993 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputational Logic and Proof Theory$b[electronic resource] $eThird Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings /$fedited by Georg Gottlob, Alexander Leitsch, Daniele Mundici 205 $a1st ed. 1993. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1993. 215 $a1 online resource (XI, 354 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v713 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-57184-1 327 $aThe mathematics of set predicates in Prolog -- Some connections between set theory and computer science -- Gödel's Dialectica interpretation and its two-way stretch -- Epistemic entrenchment and arithmetical hierarchy (abstract) -- A critical reexamination of default logic, autoepistemic logic, and only knowing -- Complexity issues in nonmonotonic logic and logic programming (abstract) -- Strategies for resolution method in non-classical logics (Abstract) -- Undecidability of implication problems in logic programming, database theory and classical logic -- Building up a tool-box for Martin-Löf's type theory (abstract) -- The logic of the Gödel proof predicate -- Superposition with simplification as a decision procedure for the monadic class with equality -- Computation with access to the reals, but using only classical machines -- The even more liberalized ?-rule in free variable Semantic Tableaux -- Differentiating assumptions from extra-logical axioms in natural deduction -- The inverse of fitting's functional -- On loop detection in connection calculi -- On Arnol'd's Hilbert symposium problems -- The structure of exponentials: Uncovering the dynamics of linear logic proofs -- On different concepts of function introduction -- Double exponential inseparability of Robinson subsystem Q+ from the unsatisfiable sentences in the language of addition -- On the meaning of essentially unprovable theorems in the presburger theory of addition -- A syntactic consistency proof for NaDSet -- A rule-based algorithm for rigid E-unification -- A scheme for weakened negative introspection in autoepistemic reasoning -- On the weakness of sharply bounded polynomial induction -- On the logic of hypergraphs -- Recursion theoretic properties of frequency computation and bounded queries (extended abstract) -- Interpreting true arithmetic in degree structures -- Classical proofs as programs -- Completeness of the pool calculus with an open built-in theory -- On the saturation principle for a linear temporal logic -- A construction of typed lambda models related to feasible computability -- Nonmonotonic reasoning is sometimes simpler -- Self-verifying axiom systems -- Committed-choice concurrent logic programming in linear logic. 330 $aThe Third Kurt G|del Symposium, KGC'93, held in Brno, Czech Republic, August1993, is the third in a series of biennial symposia on logic, theoretical computer science, and philosophy of mathematics. The aim of this meeting wasto bring together researchers working in the fields of computational logic and proof theory. While proof theory traditionally is a discipline of mathematical logic, the central activity in computational logic can be foundin computer science. In both disciplines methods were invented which arecrucial to one another. This volume contains the proceedings of the symposium. It contains contributions by 36 authors from 10 different countries. In addition to 10 invited papers there are 26 contributed papers selected from over 50 submissions. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v713 606 $aMathematical logic 606 $aComputer logic 606 $aPhilosophy and science 606 $aArtificial intelligence 606 $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aPhilosophy of Science$3https://scigraph.springernature.com/ontologies/product-market-codes/E34000 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 606 $aArtificial Intelligence$3https://scigraph.springernature.com/ontologies/product-market-codes/I21000 615 0$aMathematical logic. 615 0$aComputer logic. 615 0$aPhilosophy and science. 615 0$aArtificial intelligence. 615 14$aMathematical Logic and Foundations. 615 24$aLogics and Meanings of Programs. 615 24$aPhilosophy of Science. 615 24$aMathematical Logic and Formal Languages. 615 24$aArtificial Intelligence. 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 906 $aBOOK 912 $a996465881103316 996 $aComputational Logic and Proof Theory$92262776 997 $aUNISA