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

9783540630456, 9783540690658

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A safe recursion scheme for exponential time

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

10.1007/3-540-63045-7_5 ◽

1997 ◽

pp. 44-52 ◽

Cited By ~ 2

Author(s):

Peter Clote

Keyword(s):

Exponential Time ◽

Recursion Scheme

Quasi-characteristic inference rules for modal logics

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

10.1007/3-540-63045-7_34 ◽

1997 ◽

pp. 333-341 ◽

Cited By ~ 2

Author(s):

Vladimir V. Rybakov

Keyword(s):

Modal Logics ◽

Inference Rules

Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic

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

10.1007/3-540-63045-7_31 ◽

1997 ◽

pp. 306-311 ◽

Cited By ~ 1

Author(s):

Mati Pentus

Keyword(s):

Linear Logic

Some decision problems for traces

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

10.1007/3-540-63045-7_25 ◽

1997 ◽

pp. 248-257 ◽

Cited By ~ 10

Author(s):

Yuri Matiyasevich

Keyword(s):

Decision Problems

Learning small programs with additional information

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

10.1007/3-540-63045-7_11 ◽

1997 ◽

pp. 102-112

Author(s):

Rüsiņš Freivalds ◽

Gints Tervits ◽

Rolf Wiehagen ◽

Carl Smith

Keyword(s):

Additional Information

Finite bases of admissible rules for the logic S52 C

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

10.1007/3-540-63045-7_13 ◽

1997 ◽

pp. 119-129

Author(s):

Mikhail Golovanov

Keyword(s):

Admissible Rules

Back-forth equivalences for design of concurrent systems

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

10.1007/3-540-63045-7_38 ◽

1997 ◽

pp. 374-384 ◽

Cited By ~ 1

Author(s):

Igor V. Tarasyuk

Keyword(s):

Concurrent Systems

Unification of terms with term-indexed variables

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

10.1007/3-540-63045-7_37 ◽

1997 ◽

pp. 369-373

Author(s):

Igor L. Tandetnik

A decidable fragment of second order linear logic

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

10.1007/3-540-63045-7_32 ◽

1997 ◽

pp. 312-322 ◽

Cited By ~ 1

Author(s):

G. Perrier

Keyword(s):

Linear Logic ◽

Second Order ◽

Order Linear ◽

Decidable Fragment

Interpretation of the full computation tree logic CTL* on sets of infinite sequences

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

10.1007/3-540-63045-7_28 ◽

1997 ◽

pp. 276-282

Author(s):

Ulrich Nitsche

Keyword(s):

Computation Tree Logic ◽

Computation Tree ◽

Infinite Sequences

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A safe recursion scheme for exponential time

Quasi-characteristic inference rules for modal logics

Equivalence of multiplicative fragments of cyclic linear logic and noncommutative linear logic

Some decision problems for traces

Learning small programs with additional information

Finite bases of admissible rules for the logic S52 C

Back-forth equivalences for design of concurrent systems

Unification of terms with term-indexed variables

A decidable fragment of second order linear logic

Interpretation of the full computation tree logic CTL* on sets of infinite sequences

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