Abstract is missing.
- Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of ProgramsMatthias Baaz, Alexander Leitsch, Richard Zach. 1-15
- Semantics of Non-terminating Rewrite Systems Using Minimal CoveringsJosé Barros, Joseph A. Goguen. 16-35
- Congruence TypesGilles Barthe, Herman Geuvers. 36-51
- Deduction by Combining Semantic Tableaux and Integer ProgrammingBernhard Beckert, Reiner Hähnle. 52-63
- leanEA: A Lean Evolving Algebra CompilerBernhard Beckert, Joachim Posegga. 64-85
- A Proof System for Finite TreesPatrick Blackburn, Wilfried Meyer-Viol, Maarten de Rijke. 86-105
- Representing Unification in a Logical FrameworkJason Brown, Lincoln A. Wallen. 106-129
- Decision Procedures Using Model Building TechniquesRicardo Caferra, Nicolas Peltier. 130-144
- A Note on the Relation Between Polynomial Time Functionals and Constable s Class KPeter Clote. 145-160
- First Order Logic, Fixed Point Logic and Linear OrderAnuj Dawar, Steven Lindell, Scott Weinstein. 161-177
- Simultaneous Regid E-Unification Is UndecidableAnatoli Degtyarev, Andrei Voronkov. 178-190
- An Evolving Algebra Abstract MachineGiuseppe Del Castillo, Igor Durdanovic, Uwe Glässer. 191-214
- Rewriting with Extensional Polymorphic Lambda-CalculusRoberto Di Cosmo, Delia Kesner. 215-232
- Languages and Logical Definability in Concurrency MonoidsManfred Droste, Dietrich Kuske. 233-251
- Generalized Implicit Definitions on Finite StructuresStéphane Grumbach, Zoé Lacroix, Steven Lindell. 252-265
- The Railroad Crossing Problem: An Experiment with Instantaneous Actions and Immediate ReactionsYuri Gurevich, James K. Huggins. 266-290
- A Logical Aspect of Parametric PolymorphismRyu Hasegawa. 291-307
- On the Modal Logic K Plus TheoriesAlain Heuerding, Stefan Schwendimann. 308-319
- Improved Decision Procedures for the Modal Logics K, T, and S4Jörg Hudelmaier. 320-334
- A Fully Abstract Denotational Model for Observational PrecongruenceAnna Ingólfsdóttir, Andrea Schalk. 335-361
- On Sharply Bounded Length InductionJan Johannsen. 362-367
- Effective Strategies for Enumeration GamesMartin Kummer, Matthias Ott. 368-387
- Bounded Fixed-Point Definability and Tabular Recognition of LanguagesHans Leiß. 388-402
- Equivalences among Various Logical Frameworks of Partial AlgebrasTill Mossakowski. 403-433
- Some Extensions to Propositional Mean-Value Caculus: Expressiveness and DecidabilityParitosh K. Pandya. 434-451
- Theorem Proving modulo AssociativityAlbert Rubio. 452-467
- Positive Deduction modulo Regular TheoriesLaurent Vigneron. 468-485