9. CSL 1995: Paderborn, Germany

Hans Kleine Büning (Ed.): 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 1092 Springer 1996, ISBN 3-540-61377-3 BibTeX

@proceedings{DBLP:conf/csl/1995,
  editor    = {Hans Kleine B{\"u}ning},
  title     = {Computer Science Logic, 9th International Workshop, CSL '95,
               Annual Conference of the EACSL, Paderborn, Germany, September
               22-29, 1995, Selected Papers},
  booktitle = {CSL},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1092},
  year      = {1996},
  isbn      = {3-540-61377-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Matthias Baaz, Alexander Leitsch, Richard Zach: Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs. 1-15 BibTeX
José Barros, Joseph A. Goguen: Semantics of Non-terminating Rewrite Systems Using Minimal Coverings. 16-35 BibTeX
Gilles Barthe, Herman Geuvers: Congruence Types. 36-51 BibTeX
Bernhard Beckert, Reiner Hähnle: Deduction by Combining Semantic Tableaux and Integer Programming. 52-63 BibTeX
Bernhard Beckert, Joachim Posegga: leanEA: A Lean Evolving Algebra Compiler. 64-85 BibTeX
Patrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke: A Proof System for Finite Trees. 86-105 BibTeX
Jason Brown, Lincoln A. Wallen: Representing Unification in a Logical Framework. 106-129 BibTeX
Ricardo Caferra, Nicolas Peltier: Decision Procedures Using Model Building Techniques. 130-144 BibTeX
Peter Clote: A Note on the Relation Between Polynomial Time Functionals and Constable's Class K. 145-160 BibTeX
Anuj Dawar, Steven Lindell, Scott Weinstein: First Order Logic, Fixed Point Logic and Linear Order. 161-177 BibTeX
Anatoli Degtyarev, Andrei Voronkov: Simultaneous Regid E-Unification Is Undecidable. 178-190 BibTeX
Giuseppe Del Castillo, Igor Durdanovic, Uwe Glässer: An Evolving Algebra Abstract Machine. 191-214 BibTeX
Roberto Di Cosmo, Delia Kesner: Rewriting with Extensional Polymorphic Lambda-Calculus. 215-232 BibTeX
Manfred Droste, Dietrich Kuske: Languages and Logical Definability in Concurrency Monoids. 233-251 BibTeX
Stéphane Grumbach, Zoé Lacroix, Steven Lindell: Generalized Implicit Definitions on Finite Structures. 252-265 BibTeX
Yuri Gurevich, James K. Huggins: The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate Reactions. 266-290 BibTeX
Ryu Hasegawa: A Logical Aspect of Parametric Polymorphism. 291-307 BibTeX
Alain Heuerding, Stefan Schwendimann: On the Modal Logic K Plus Theories. 308-319 BibTeX
Jörg Hudelmaier: Improved Decision Procedures for the Modal Logics K, T, and S4. 320-334 BibTeX
Anna Ingólfsdóttir, Andrea Schalk: A Fully Abstract Denotational Model for Observational Precongruence. 335-361 BibTeX
Jan Johannsen: On Sharply Bounded Length Induction. 362-367 BibTeX
Martin Kummer, Matthias Ott: Effective Strategies for Enumeration Games. 368-387 BibTeX
Hans Leiß: Bounded Fixed-Point Definability and Tabular Recognition of Languages. 388-402 BibTeX
Till Mossakowski: Equivalences among Various Logical Frameworks of Partial Algebras. 403-433 BibTeX
Paritosh K. Pandya: Some Extensions to Propositional Mean-Value Caculus: Expressiveness and Decidability. 434-451 BibTeX
Albert Rubio: Theorem Proving modulo Associativity. 452-467 BibTeX
Laurent Vigneron: Positive Deduction modulo Regular Theories. 468-485 BibTeX