Ebook: Computer Science Logic: 9th International Workshop, CSL '95 Annual Conference of the EACSL Paderborn, Germany, September 22–29, 1995 Selected Papers

This book contains a carefully refereed selection of papers presented at the 1995 Annual Conference of the European Association for Computer Science Logic, CSL '95, held in Paderborn, Germany, in September 1995.
The 27 revised full papers included were selected after two rounds of reviewing from a total of 74 submissions for presentation at the conference and present the state-of-the-art in the area. Among the topics addressed are temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, formal languages, and others.

---

This book contains a carefully refereed selection of papers presented at the 1995 Annual Conference of the European Association for Computer Science Logic, CSL '95, held in Paderborn, Germany, in September 1995.
The 27 revised full papers included were selected after two rounds of reviewing from a total of 74 submissions for presentation at the conference and present the state-of-the-art in the area. Among the topics addressed are temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, formal languages, and others.

---

This book contains a carefully refereed selection of papers presented at the 1995 Annual Conference of the European Association for Computer Science Logic, CSL '95, held in Paderborn, Germany, in September 1995.
The 27 revised full papers included were selected after two rounds of reviewing from a total of 74 submissions for presentation at the conference and present the state-of-the-art in the area. Among the topics addressed are temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, formal languages, and others.
Content:
Front Matter....Pages -
Incompleteness of a first-order g?del logic and some temporal logics of programs....Pages 1-15
Semantics of non-terminating rewrite systems using minimal coverings....Pages 16-35
Congruence Types....Pages 36-51
Deduction by combining semantic tableaux and integer programming....Pages 52-63
leanEA: A lean evolving algebra compiler....Pages 64-85
A proof system for finite trees....Pages 86-105
Representing unification in a logical framework....Pages 106-129
Decision procedures using model building techniques....Pages 130-144
First order logic, fixed point logic and linear order....Pages 145-160
Simultaneous rigid E-unification is undecidable....Pages 161-177
An evolving algebra abstract machine....Pages 178-190
Rewriting with extensional polymorphic ?-calculus....Pages 191-214
Languages and logical definability in concurrency monoids....Pages 215-232
Generalized implicit definitions on finite structures....Pages 233-251
The railroad crossing problem: An experiment with instantaneous actions and immediate reactions....Pages 252-265
A logical aspect of parametric polymorphism....Pages 266-290
On the modal logic K plus theories....Pages 291-307
Improved decision procedures for the modal logics K, T and S4....Pages 308-319
A fully abstract denotational model for observational precongruence....Pages 320-334
On sharply bounded length induction....Pages 335-361
Effective strategies for enumeration games....Pages 362-367
Bounded fixed-point definability and tabular recognition of languages....Pages 368-387
Equivalences among various logical frameworks of partial algebras....Pages 388-402
Some extensions to propositional mean-value calculus: Expressiveness and decidability....Pages 403-433
Theorem proving modulo associativity....Pages 434-451
Positive deduction modulo regular theories....Pages 452-467
Back Matter....Pages 468-485
....Pages -