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

9783540645702, 9783540693536

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Mona & Fido: The logic-automaton connection in practice

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028022 ◽

1998 ◽

pp. 311-326 ◽

Cited By ~ 23

Author(s):

Nils Klarlund

Download Full-text

Categories with algebraic structure

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028027 ◽

1998 ◽

pp. 389-405 ◽

Cited By ~ 1

Author(s):

John Power

Keyword(s):

Algebraic Structure

Download Full-text

Canonization for Lk-equivalence is Hard

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028017 ◽

1998 ◽

pp. 220-238

Author(s):

Martin Grohe

Download Full-text

Padding and the expressive power of existential second-order logics

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028031 ◽

1998 ◽

pp. 461-477 ◽

Cited By ~ 5

Author(s):

Thomas Schwentick

Keyword(s):

Expressive Power ◽

Second Order

Download Full-text

Rich ω-words and monadic second-order arithmetic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028032 ◽

1998 ◽

pp. 478-490 ◽

Cited By ~ 9

Author(s):

Ludwig Staiger

Keyword(s):

Second Order ◽

Second Order Arithmetic ◽

Order Arithmetic

Download Full-text

Concurrent constraint programming and non-commutative logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028028 ◽

1998 ◽

pp. 406-423 ◽

Cited By ~ 5

Author(s):

Paul Ruet ◽

François Fages

Keyword(s):

Constraint Programming ◽

Concurrent Constraint Programming

Download Full-text

Resolution and the weak pigeonhole principle

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028012 ◽

1998 ◽

pp. 149-156 ◽

Cited By ~ 12

Author(s):

Sam Buss ◽

Toniann Pitassi

Keyword(s):

Pigeonhole Principle

Download Full-text

Call-by-value games

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028004 ◽

1998 ◽

pp. 1-17 ◽

Cited By ~ 36

Author(s):

Samson Abramsky ◽

Guy McCusker

Download Full-text

Classical proofs via basic logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028016 ◽

1998 ◽

pp. 203-219 ◽

Cited By ~ 1

Author(s):

Claudia Faggian

Keyword(s):

Basic Logic

Download Full-text

Linear lower bounds and simulations in frege systems with substitutions

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0028010 ◽

1998 ◽

pp. 115-128 ◽

Cited By ~ 1

Author(s):

Maria Luisa Bonet ◽

Nicola Galesi

Keyword(s):

Lower Bounds ◽

Frege Systems

Download Full-text

Computer Science Logic - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Mona & Fido: The logic-automaton connection in practice

Categories with algebraic structure

Canonization for Lk-equivalence is Hard

Padding and the expressive power of existential second-order logics

Rich ω-words and monadic second-order arithmetic

Concurrent constraint programming and non-commutative logic

Resolution and the weak pigeonhole principle

Call-by-value games

Classical proofs via basic logic

Linear lower bounds and simulations in frege systems with substitutions

Computer Science Logic - Lecture Notes in Computer Science
Latest Publications