Computer Science Logic: 9th International Workshop, Csl '95, Annual Conference Of The Eacsl Paderborn, Germany, September 22-29, 1995. Selected Papers (lecture Notes In Computer Science)

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. 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 lean EA : 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 A note on the relation between polynomial time functionals and Constable's class K ....Pages 145-160 First order logic, fixed point logic and linear order....Pages 161-177 Simultaneous rigid E-unification is undecidable....Pages 178-190 An evolving algebra abstract machine....Pages 191-214 Rewriting with extensional polymorphic λ-calculus....Pages 215-232 Languages and logical definability in concurrency monoids....Pages 233-251 Generalized implicit definitions on finite structures....Pages 252-265 The railroad crossing problem: An experiment with instantaneous actions and immediate reactions....Pages 266-290 A logical aspect of parametric polymorphism....Pages 291-307 On the modal logic K plus theories....Pages 308-319 Improved decision procedures for the modal logics K, T and S4....Pages 320-334 A fully abstract denotational model for observational precongruence....Pages 335-361 On sharply bounded length induction....Pages 362-367 Effective strategies for enumeration games....Pages 368-387 Bounded fixed-point definability and tabular recognition of languages....Pages 388-402 Equivalences among various logical frameworks of partial algebras....Pages 403-433 Some extensions to propositional mean-value calculus: Expressiveness and decidability....Pages 434-451 Theorem proving modulo associativity....Pages 452-467 Positive deduction modulo regular theories....Pages 468-485 "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."--PUBLISHER'S WEBSITE The 27 papers in this volume cover topics including temporal logics, rewriting systems, deduction, theorem proving, process algebra, linear logics, proof theory, and formal languages.