Cantitate/Preț
Produs

Computational Logic and Proof Theory: 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings: Lecture Notes in Computer Science, cartea 1289

Editat de Georg Gottlob, Alexander Leitsch, Daniele Mundici
en Limba Engleză Paperback – 13 aug 1997
This 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.   
Citește tot Restrânge

Toate formatele și edițiile

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

Din seria Lecture Notes in Computer Science

Preț: 38411 lei

Nou

Puncte Express: 576

Preț estimativ în valută:
7353 7644$ 6097£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540633853
ISBN-10: 3540633855
Pagini: 364
Ilustrații: IX, 355 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.51 kg
Ediția:1997
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Paramodulation, 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 theGö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.