Vor Ort
Merkzettel Warenkorb
  • Produktbild: Computational Logic and Proof Theory
  • Produktbild: Computational Logic and Proof Theory
Band 713

Computational Logic and Proof Theory Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings

Aus der Reihe Lecture Notes in Computer Science

49,99 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.08.1993

Abbildungen

XI, 354 p.

Herausgeber

Georg Gottlob + weitere

Verlag

Springer Berlin

Seitenzahl

354

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

563 g

Auflage

1993

Sprache

Englisch

ISBN

978-3-540-57184-1

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

13.08.1993

Abbildungen

XI, 354 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

354

Maße (L/B/H)

23,5/15,5/2,1 cm

Gewicht

563 g

Auflage

1993

Sprache

Englisch

ISBN

978-3-540-57184-1

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Computational Logic and Proof Theory
  • Produktbild: Computational Logic and Proof Theory
  • The 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.