Lecture Notes in Computer Science - Computational Logic and Proof Theory
Latest Publications

TOTAL DOCUMENTS

27

(FIVE YEARS 0)

H-INDEX

5

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540633853, 9783540698067

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

On the completeness and decidability of a restricted first order linear temporal logic

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_47 ◽

1997 ◽

pp. 241-254 ◽

Author(s):

Regimantas Pliuškevičius

Keyword(s):

Temporal Logic ◽

Linear Temporal Logic ◽

Order Linear ◽

Download Full-text

Two semantics and logics based on the Gödel interpretation

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_46 ◽

1997 ◽

pp. 233-240 ◽

Author(s):

V. Plisko

Download Full-text

Invariant definability

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_43 ◽

1997 ◽

pp. 186-202 ◽

Author(s):

J. A. Makowsky

Download Full-text

The tangibility reflection principle for self-verifying axiom systems

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_53 ◽

1997 ◽

pp. 319-334 ◽

Author(s):

Dan E. Willard

Keyword(s):

Reflection Principle ◽

Download Full-text

Explaining Gentzen's consistency proof within infinitary proof theory

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_29 ◽

1997 ◽

pp. 4-17 ◽

Author(s):

Wilfried Buchholz

Keyword(s):

Proof Theory ◽

Consistency Proof ◽

Infinitary Proof Theory

Download Full-text

Informal rigor and mathematical understanding

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_32 ◽

1997 ◽

pp. 54-64 ◽

Author(s):

J. A. Robinson

Keyword(s):

Mathematical Understanding

Download Full-text

Alogtime algorithms for tree isomorphism, comparison, and canonization

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_30 ◽

1997 ◽

pp. 18-33 ◽

Author(s):

Samuel R. Buss

Download Full-text

The undecidability of simultaneous rigid E-unification with two variables

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_52 ◽

1997 ◽

pp. 305-318 ◽

Author(s):

Margus Veanes

Download Full-text

Denotational semantics for polarized (but-non-constrained) LK by means of the additives

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_51 ◽

1997 ◽

pp. 290-304

Author(s):

Lorenzo Tortora de Falco

Keyword(s):

Denotational Semantics

Download Full-text

Upper bounds for standardizations and an application

Lecture Notes in Computer Science - Computational Logic and Proof Theory ◽

10.1007/3-540-63385-5_54 ◽

1997 ◽

pp. 335-348

Author(s):

Hongwei Xi

Keyword(s):

Download Full-text