9. CSL 1995: Paderborn, Germany

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

Last update Sat May 25 02:37:47 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page