Abstract is missing.
- The Expressive Power of Transitive Closue and 2-way Multihead AutomataYaniv Bargury, Johann A. Makowsky. 1-14
- Correctness Proof For the WAM with TypesChristoph Beierle, Egon Börger. 15-34
- Model Checking of Persistent Petri NetsEike Best, Javier Esparza. 35-52
- Provability in TBLL: A Decision ProcedureJawahar Chirimar, James Lipton. 53-67
- How to Implement First Order Formulas in Local Memory Machine ModelsElias Dahlhaus. 68-78
- A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary ComputationSolomon Feferman. 79-95
- A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest BisimulationTim Fernando. 96-110
- On Bounded TheoriesJörg Flum. 111-118
- The Cutting Plane Proof System with Bounded Degree of FalsityAndreas Goerdt. 119-133
- Denotational Versus Declarative Semantics for Functional ProgrammingJuan Carlos González Moreno, Maria Teresa Hortalá-González, Mario Rodríguez-Artalejo. 134-148
- On Transitive Closure LogicErich Grädel. 149-163
- Some Aspects of the Probabilistic Behavior of Variants of ResolutionPeter Heusch, Ewald Speckenmeyer. 164-172
- Safe Queries in Relational Databases with FunctionsYoram Hirshfeld. 173-183
- Logical Inference and Polyhedral ProjectionJohn N. Hooker. 184-200
- Stable LogicBrigitte Bösli. 201-212
- A Transformational Methodology for Proving Termination of Logic ProgramsM. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar. 213-226
- Plausibility LogicDaniel J. Lehmann. 227-241
- Towards Kleene Algebra with RecursionHans Leiß. 242-256
- Equational Specification of Abstract Types and CombinatorsKarl Meinke. 257-271
- Normal Forms in Infinite-Valued Logic: The Case of One VariableDaniele Mundici. 272-277
- A Fragment of First Order Logic Adequate for Observation EquivalenceHalit Oguztüzün. 278-292
- Ordinal Processes in Comparative Concurrency SemanticsSophie Pinchinat. 293-305
- Logical Semantics of ModularisationGerard R. Renardel de Lavalette. 306-315
- A Cut-Elimination Procedure Designed for Evaluating Proofs as ProgramsUlf R. Schmerl. 316-325
- Minimal from Classical ProofsHelmut Schwichtenberg. 326-328
- Quantifier Hierarchies over Word RelationsSebastian Seibert. 329-352
- On Completeness for NP via Projection TranslationsIain A. Stewart. 353-366
- Control of omega-Automata, Church s Problem, and the Emptiness Problem for Tree omega-AutomataJ. G. Thistle, W. Murray Wonham. 367-382
- Comparing the Theory of Representations and Constructive MathematicsA. S. Troelstra. 383-395
- Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue LogicJerzy Tyszkiewicz. 396-410
- On Completeness of Program Synthesis SystemsAndrei Voronkov. 411-418
- Proving Termination for Term Rewriting SystemsAndreas Weiermann. 419-428