Abstract is missing.
- Yuri, Logic, and Computer ScienceAndreas Blass, Nachum Dershowitz, Wolfgang Reisig. 1-48 [doi]
- Database Theory, Yuri, and MeJan Van den Bussche. 49-60 [doi]
- Tracking EvidenceSergei N. Artëmov. 61-74 [doi]
- Strict Canonical Constructive SystemsArnon Avron, Ori Lahav. 75-94 [doi]
- Decidable Expansions of Labelled Linear OrderingsAlexis Bès, Alexander Rabinovich. 95-107 [doi]
- Three Paths to EffectivenessUdi Boker, Nachum Dershowitz. 135-146 [doi]
- The Quest for a Tight Translation of Büchi to co-Büchi AutomataUdi Boker, Orna Kupferman. 147-164 [doi]
- Normalization of Some Extended Abstract State MachinesPatrick Cégielski, Irène Guessarian. 165-180 [doi]
- Finding Reductions AutomaticallyMichael Crouch, Neil Immerman, J. Eliot B. Moss. 181-200 [doi]
- On Complete Problems, Relativizations and Logics for Complexity ClassesAnuj Dawar. 201-207 [doi]
- Effective Closed Subshifts in 1D Can Be Implemented in 2DBruno Durand, Andrei E. Romashchenko, Alexander Shen. 208-226 [doi]
- The Model Checking Problem for Prefix Classes of Second-Order Logic: A SurveyThomas Eiter, Georg Gottlob, Thomas Schwentick. 227-250 [doi]
- A Logic for PTIME and a Parameterized Halting ProblemYijia Chen, Jörg Flum. 251-276 [doi]
- Inferring Loop Invariants Using PostconditionsCarlo A. Furia, Bertrand Meyer. 277-300 [doi]
- ASMs and Operational Algorithmic Completeness of Lambda CalculusMarie Ferbus-Zanda, Serge Grigorieff. 301-327 [doi]
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line GraphsMartin Grohe. 328-353 [doi]
- Ibn Sina on Analysis: 1. Proof Search. Or: Abstract State Machines as a Tool for History of LogicWilfrid Hodges. 354-404 [doi]
- Abstract State Machines and the Inquiry ProcessJames K. Huggins, Charles Wallace. 405-413 [doi]
- The Algebra of Adjacency Patterns: Rees Matrix Semigroups with ReversionMarcel Jackson, Mikhail V. Volkov. 414-443 [doi]
- Definability of Combinatorial Functions and Their Linear Recurrence RelationsTomer Kotek, Johann A. Makowsky. 444-462 [doi]
- Halting and Equivalence of Program Schemes in Models of Arbitrary TheoriesDexter Kozen. 463-469 [doi]
- Metrization Theorem for Space-Times: From Urysohn s Problem towards Physically Useful Constructive MathematicsVladik Kreinovich. 470-487 [doi]
- Thirteen Definitions of a Stable ModelVladimir Lifschitz. 488-503 [doi]
- DKAL and Z3: A Logic Embedding ExperimentSergio Mera, Nikolaj Bjørner. 504-528 [doi]
- Decidability of the Class E by Maslov s Inverse MethodGrigori Mints. 529-537 [doi]
- Logics for Two Fragments beyond the Syllogistic BoundaryLawrence S. Moss. 538-564 [doi]
- Choiceless Computation and SymmetryBenjamin Rossman. 565-580 [doi]
- Hereditary Zero-One Laws for GraphsSaharon Shelah, Mor Doron. 581-614 [doi]
- On Monadic Theories of Monadic PredicatesWolfgang Thomas. 615-626 [doi]