Computer Science Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

27

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540613770, 9783540685074

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Some extensions to propositional mean-value calculus: Expressiveness and decidability

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_52 ◽

1996 ◽

pp. 434-451 ◽

Author(s):

Paritosh K. Pandya

Keyword(s):

Download Full-text

On sharply bounded length induction

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_48 ◽

1996 ◽

pp. 362-367 ◽

Author(s):

Jan Johannsen

Download Full-text

A note on the relation between polynomial time functionals and Constable's class K

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_36 ◽

1996 ◽

pp. 145-160 ◽

Author(s):

P. Clote

Keyword(s):

Polynomial Time

Download Full-text

A proof system for finite trees

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_33 ◽

1996 ◽

pp. 86-105 ◽

Author(s):

Patrick Blackburn ◽

Wilfried Meyer-Viol ◽

Maarten Rijke

Keyword(s):

Download Full-text

Incompleteness of a first-order gödel logic and some temporal logics of programs

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_28 ◽

1996 ◽

pp. 1-15 ◽

Author(s):

Matthias Baaz ◽

Alexander Leitsch ◽

Richard Zach

Keyword(s):

Temporal Logics ◽

First Order ◽

Gödel Logic ◽

Logics Of Programs

Download Full-text

Effective strategies for enumeration games

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_49 ◽

1996 ◽

pp. 368-387

Author(s):

Martin Kummer ◽

Matthias Ott

Keyword(s):

Effective Strategies

Download Full-text

Generalized implicit definitions on finite structures

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_42 ◽

1996 ◽

pp. 252-265 ◽

Author(s):

Stéphane Grumbach ◽

Zoé Lacroix ◽

Steven Lindell

Keyword(s):

Finite Structures ◽

Implicit Definitions

Download Full-text

Semantics of non-terminating rewrite systems using minimal coverings

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_29 ◽

1996 ◽

pp. 16-35

Author(s):

José Barros ◽

Joseph Goguen

Keyword(s):

Rewrite Systems

Download Full-text

Rewriting with extensional polymorphic λ-calculus

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_40 ◽

1996 ◽

pp. 215-232 ◽

Author(s):

Roberto Cosmo ◽

Delia Kesner

Download Full-text

On the modal logic K plus theories

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-61377-3_45 ◽

1996 ◽

pp. 308-319 ◽

Author(s):

Alain Heuerding ◽

Stefan Schwendimann

Keyword(s):

Download Full-text