Computer Science Logic - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

31

(FIVE YEARS 0)

H-INDEX

6

(FIVE YEARS 0)

Published By Springer-Verlag

354055789x

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Equational specification of abstract types and combinators

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023772 ◽

2005 ◽

pp. 257-271 ◽

Author(s):

Karl Meinke

Keyword(s):

Download Full-text

Provability in TBLL: A decision procedure

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023757 ◽

2005 ◽

pp. 53-67 ◽

Author(s):

Jawahar Chirimar ◽

James Lipton

Keyword(s):

Decision Procedure

Download Full-text

A new approach to abstract data types II computation on ADTs as ordinary computation

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023759 ◽

2005 ◽

pp. 79-95 ◽

Author(s):

Solomon Feferman

Keyword(s):

Abstract Data Types ◽

New Approach ◽

Download Full-text

Towards Kleene Algebra with recursion

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023771 ◽

2005 ◽

pp. 242-256 ◽

Author(s):

Haas Leiß

Keyword(s):

Download Full-text

A fragment of first order logic adequate for observation equivalence

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023774 ◽

2005 ◽

pp. 278-292

Author(s):

Halit O¯guztüzün

Keyword(s):

Order Logic ◽

First Order Logic ◽

Download Full-text

The cutting plane proof system with bounded degree of falsity

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023762 ◽

2005 ◽

pp. 119-133 ◽

Author(s):

Andreas Goerdt

Keyword(s):

Cutting Plane ◽

Proof System ◽

Download Full-text

The expressive power of transitive closure and 2-way multihead automata

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023754 ◽

2005 ◽

pp. 1-14 ◽

Author(s):

Yaniv Bargury ◽

Johann Makowsky

Keyword(s):

Transitive Closure ◽

Expressive Power

Download Full-text

Complexity results for the default- and the autoepistemic logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023780 ◽

2005 ◽

pp. 339-352

Author(s):

Eckhard Steffen

Keyword(s):

Autoepistemic Logic ◽

Complexity Results

Download Full-text

Proving termination for term rewriting systems

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023786 ◽

2005 ◽

pp. 419-428 ◽

Author(s):

Andreas Weiermann

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Download Full-text

Plausibility logic

Computer Science Logic - Lecture Notes in Computer Science ◽

10.1007/bfb0023770 ◽

2005 ◽

pp. 227-241 ◽

Author(s):

Daniel Lehmann

Download Full-text