Logical Foundations of Computer Science - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540581406, 9783540484424

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A logic of capabilities

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_34 ◽

1994 ◽

pp. 366-378 ◽

Cited By ~ 12

Author(s):

W. van der Hoek ◽

B. van Linder ◽

J. -J. Ch. Meyer

Download Full-text

Classes with pairwise equivalent enumerations

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_14 ◽

1994 ◽

pp. 140-141 ◽

Cited By ~ 1

Author(s):

S. S. Goncharov ◽

S. A. Badaev

Download Full-text

Lower bounds for probabilistic space complexity: Communication-automata approach

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_1 ◽

1994 ◽

pp. 1-7 ◽

Cited By ~ 1

Author(s):

Farid Ablayev

Keyword(s):

Lower Bounds ◽

Space Complexity ◽

Probabilistic Space

Download Full-text

The complexity of propositional modal theories and the complexity of consistency of propositional modal theories

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_8 ◽

1994 ◽

pp. 69-80 ◽

Cited By ~ 4

Author(s):

Cheng-Chia Chen ◽

I-Peng Lin

Download Full-text

Referential data structures and labeled modal logic

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_4 ◽

1994 ◽

pp. 23-33 ◽

Cited By ~ 4

Author(s):

Sergei Artëmov ◽

Vladimir Krupski

Keyword(s):

Modal Logic ◽

Data Structures

Download Full-text

Propositional linear temporal logic and language homomorphisms

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_26 ◽

1994 ◽

pp. 265-277 ◽

Cited By ~ 11

Author(s):

Ulrich Nitsche

Keyword(s):

Temporal Logic ◽

Linear Temporal Logic

Download Full-text

Comparing models of the non-extensional typed λ-calculus extended abstract

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_17 ◽

1994 ◽

pp. 164-172 ◽

Cited By ~ 1

Author(s):

R. Hoofman

Download Full-text

Foundations of proof search strategies design in linear logic

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_11 ◽

1994 ◽

pp. 101-113 ◽

Cited By ~ 8

Author(s):

D. Galmiche ◽

G. Perrier

Keyword(s):

Linear Logic ◽

Search Strategies ◽

Proof Search

Download Full-text

Hereditarily sequential functionals

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_25 ◽

1994 ◽

pp. 253-264 ◽

Cited By ~ 39

Author(s):

Hanno Nickau

Download Full-text

Predicative recurrence in finite types

Logical Foundations of Computer Science - Lecture Notes in Computer Science ◽

10.1007/3-540-58140-5_23 ◽

1994 ◽

pp. 227-239 ◽

Cited By ~ 9

Author(s):

Daniel Leivant

Download Full-text

Logical Foundations of Computer Science - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A logic of capabilities

Classes with pairwise equivalent enumerations

Lower bounds for probabilistic space complexity: Communication-automata approach

The complexity of propositional modal theories and the complexity of consistency of propositional modal theories

Referential data structures and labeled modal logic

Propositional linear temporal logic and language homomorphisms

Comparing models of the non-extensional typed λ-calculus extended abstract

Foundations of proof search strategies design in linear logic

Hereditarily sequential functionals

Predicative recurrence in finite types

Logical Foundations of Computer Science - Lecture Notes in Computer Science
Latest Publications