000 | 04969nam a22005295i 4500 | ||
---|---|---|---|
001 | 978-3-540-47943-7 | ||
003 | DE-He213 | ||
005 | 20160624102028.0 | ||
007 | cr nn 008mamaa | ||
008 | 130109s1993 gw | s |||| 0|eng d | ||
020 |
_a9783540479437 _9978-3-540-47943-7 |
||
024 | 7 |
_a10.1007/BFb0022546 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aComputational Logic and Proof Theory _h[electronic resource] : _bThird Kurt Gödel Colloquium, KGC'93 Brno, Czech Republic, August 24–27, 1993 Proceedings / _cedited by Georg Gottlob, Alexander Leitsch, Daniele Mundici. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1993. |
|
300 |
_aXI, 354 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v713 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aArtificial intelligence. | |
650 | 0 | _aLogic, Symbolic and mathematical. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aMathematical Logic and Foundations. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aGottlob, Georg. _eeditor. |
|
700 | 1 |
_aLeitsch, Alexander. _eeditor. |
|
700 | 1 |
_aMundici, Daniele. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540571841 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v713 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0022546 |
942 |
_2EBK6243 _cEBK |
||
999 |
_c35537 _d35537 |