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

TOTAL DOCUMENTS

35

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540727323, 9783540727347

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A Note on Rewriting Proofs and Fibonacci Numbers

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

10.1007/978-3-540-72734-7_20 ◽

2007 ◽

pp. 284-292

Author(s):

Max Kanovich

Keyword(s):

Fibonacci Numbers

Download Full-text

Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

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

10.1007/978-3-540-72734-7_16 ◽

2007 ◽

pp. 224-240 ◽

Author(s):

R. Gentilini ◽

K. Schneider ◽

B. Mishra

Keyword(s):

Model Checking ◽

Hybrid Automata

Download Full-text

Including the Past in ‘Topologic’

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

10.1007/978-3-540-72734-7_19 ◽

2007 ◽

pp. 269-283

Author(s):

Bernhard Heinemann

Keyword(s):

Download Full-text

Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms

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

10.1007/978-3-540-72734-7_34 ◽

2007 ◽

pp. 486-497 ◽

Author(s):

V. Rybakov

Keyword(s):

Temporal Logic ◽

Download Full-text

Proof Identity for Classical Logic: Generalizing to Normality

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

10.1007/978-3-540-72734-7_24 ◽

2007 ◽

pp. 332-348

Author(s):

Roman Kuznets

Keyword(s):

Classical Logic

Download Full-text

Hypersequent Calculus for Intuitionistic Logic with Classical Atoms

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

10.1007/978-3-540-72734-7_23 ◽

2007 ◽

pp. 318-331 ◽

Author(s):

Hidenori Kurokawa

Keyword(s):

Intuitionistic Logic

Download Full-text

Explicit Proofs in Formal Provability Logic

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

10.1007/978-3-540-72734-7_17 ◽

2007 ◽

pp. 241-253

Author(s):

Evan Goris

Keyword(s):

Provability Logic

Download Full-text

Finite Automata Presentable Abelian Groups

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

10.1007/978-3-540-72734-7_29 ◽

2007 ◽

pp. 422-436 ◽

Author(s):

André Nies ◽

Pavel Semukhin

Keyword(s):

Abelian Groups ◽

Finite Automata

Download Full-text

Total Public Announcements

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

10.1007/978-3-540-72734-7_35 ◽

2007 ◽

pp. 498-511 ◽

Author(s):

David Steiner ◽

Thomas Studer

Keyword(s):

Public Announcements

Download Full-text

Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus

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

10.1007/978-3-540-72734-7_11 ◽

2007 ◽

pp. 147-161 ◽

Author(s):

Robert Constable ◽

Wojciech Moczydłowski

Keyword(s):

Propositional Calculus ◽

Completeness Proof ◽

Resolution Algorithm

Download Full-text