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

9783540749141, 9783540749158

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_31 ◽

2007 ◽

pp. 405-419 ◽

Cited By ~ 21

Author(s):

Dale Miller ◽

Alexis Saurin

Keyword(s):

Linear Logic

Download Full-text

Continuous Previsions

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_40 ◽

2007 ◽

pp. 542-557 ◽

Cited By ~ 7

Author(s):

Jean Goubault-Larrecq

Download Full-text

The Theory of Calculi with Explicit Substitutions Revisited

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_20 ◽

2007 ◽

pp. 238-252 ◽

Cited By ~ 15

Author(s):

Delia Kesner

Keyword(s):

Explicit Substitutions

Download Full-text

Linear Realizability

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_32 ◽

2007 ◽

pp. 420-434 ◽

Cited By ~ 1

Author(s):

Naohiko Hoshino

Download Full-text

The Power of Counting Logics on Restricted Classes of Finite Structures

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_10 ◽

2007 ◽

pp. 84-98 ◽

Cited By ~ 4

Author(s):

Anuj Dawar ◽

David Richerby

Keyword(s):

Finite Structures

Download Full-text

The Ackermann Award 2007

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_43 ◽

2007 ◽

pp. 589-597

Author(s):

Martin Grohe ◽

Martin Hyland ◽

Johann A. Makowsky ◽

Damian Niwinski

Download Full-text

Game Characterizations and the PSPACE-Completeness of Tree Resolution Space

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_39 ◽

2007 ◽

pp. 527-541 ◽

Cited By ~ 3

Author(s):

Alexander Hertel ◽

Alasdair Urquhart

Keyword(s):

Tree Resolution

Download Full-text

Proofs, Programs and Abstract Complexity

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_3 ◽

2007 ◽

pp. 4-5

Author(s):

Arnold Beckmann

Download Full-text

Forest Expressions

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_14 ◽

2007 ◽

pp. 146-160 ◽

Cited By ~ 4

Author(s):

Mikołaj Bojańczyk

Download Full-text

There Exist Some ω-Powers of Any Borel Rank

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/978-3-540-74915-8_12 ◽

2007 ◽

pp. 115-129 ◽

Cited By ~ 2

Author(s):

Olivier Finkel ◽

Dominique Lecomte

Download Full-text

Computer Science Logic - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic

Continuous Previsions

The Theory of Calculi with Explicit Substitutions Revisited

Linear Realizability

The Power of Counting Logics on Restricted Classes of Finite Structures

The Ackermann Award 2007

Game Characterizations and the PSPACE-Completeness of Tree Resolution Space

Proofs, Programs and Abstract Complexity

Forest Expressions

There Exist Some ω-Powers of Any Borel Rank

Computer Science Logic - Lecture Notes in Computer Science
Latest Publications