Cantitate/Preț
Produs
Total produse
Vezi coșul
Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings de Georg Gottlob

Computational Logic and Proof Theory: Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings: Lecture Notes in Computer Science, cartea 713

Editat de Georg Gottlob, Alexander Leitsch, Daniele Mundici
en Limba Engleză Paperback – 13 aug 1993
The Third Kurt G|del Symposium, KGC'93, held in Brno, CzechRepublic, August1993, is the third in a series of biennialsymposia on logic, theoretical computer science, andphilosophy of mathematics. The aim of this meeting wastobring together researchers working in the fields ofcomputational logic and proof theory. While proof theorytraditionally is a discipline of mathematical logic, thecentral activity in computational logic can be foundincomputer science. In both disciplines methods were inventedwhich arecrucial to one another. This volume contains theproceedings of the symposium. It contains contributions by36 authors from 10 different countries. In addition to 10invited papers there are 26 contributed papers selected fromover 50 submissions.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (2) 39199 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 13 aug 1997 39199 lei  6-8 săpt.
  Springer Berlin, Heidelberg – 13 aug 1993 39275 lei  6-8 săpt.

Din seria Lecture Notes in Computer Science

Preț: 39275 lei

Nou

Puncte Express: 589
Preț estimativ în valută:
7517€ • 7818$ • 6299£

Carte tipărită la comandă

Livrare economică 13-27 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540571841
ISBN-10: 3540571841
Pagini: 372
Ilustrații: XI, 354 p.
Dimensiuni: 216 x 279 x 20 mm
Greutate: 0.53 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.