Computer Science Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540678953, 9783540446224

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Theory of Explicit Mathematics Equivalent to ID 1

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_24 ◽

2000 ◽

pp. 356-370 ◽

Cited By ~ 2

Author(s):

Reinhard Kahle ◽

Thomas Studer

Download Full-text

Disjunctive Tautologies as Synchronisation Schemes

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_19 ◽

2000 ◽

pp. 292-301 ◽

Cited By ~ 16

Author(s):

Vincent Danos ◽

Jean-Louis Krivine

Download Full-text

On the Logic of the Standard Proof Predicate

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_36 ◽

2000 ◽

pp. 527-541 ◽

Cited By ~ 1

Author(s):

Rostislav E. Yavorsky

Download Full-text

Completeness of Higher-Order Duration Calculus

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_30 ◽

2000 ◽

pp. 442-456 ◽

Cited By ~ 2

Author(s):

Zhan Naijun

Keyword(s):

Higher Order ◽

Duration Calculus

Download Full-text

On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_27 ◽

2000 ◽

pp. 399-410 ◽

Cited By ~ 4

Author(s):

J. A. Makowsky ◽

K. Meer

Keyword(s):

Computational Model ◽

Generating Functions ◽

Graph Properties

Download Full-text

Logic Programming and Co-inductive Definitions

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_23 ◽

2000 ◽

pp. 343-355 ◽

Cited By ~ 1

Author(s):

Mathieu Jaume

Keyword(s):

Logic Programming ◽

Inductive Definitions

Download Full-text

Flatness Is Not a Weakness

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_17 ◽

2000 ◽

pp. 262-276 ◽

Cited By ~ 29

Author(s):

Hubert Comon ◽

Vèronique Cortier

Download Full-text

Definability over Linear Constraints

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_14 ◽

2000 ◽

pp. 217-231 ◽

Cited By ~ 3

Author(s):

Michael Benedikt ◽

H. Jerome Keisler

Keyword(s):

Linear Constraints

Download Full-text

Background, Reserve, and Gandy Machines

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_1 ◽

2000 ◽

pp. 1-17 ◽

Cited By ~ 16

Author(s):

Andreas Blass ◽

Yuri Gurevich

Download Full-text

From Programs to Games: Invariance and Safety for Bisimulation

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/3-540-44622-2_33 ◽

2000 ◽

pp. 485-496 ◽

Cited By ~ 4

Author(s):

Marc Pauly

Download Full-text

Computer Science Logic - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A Theory of Explicit Mathematics Equivalent to ID 1

Disjunctive Tautologies as Synchronisation Schemes

On the Logic of the Standard Proof Predicate

Completeness of Higher-Order Duration Calculus

On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale

Logic Programming and Co-inductive Definitions

Flatness Is Not a Weakness

Definability over Linear Constraints

Background, Reserve, and Gandy Machines

From Programs to Games: Invariance and Safety for Bisimulation

Computer Science Logic - Lecture Notes in Computer Science
Latest Publications