Abstract is missing.
- Background, Reserve, and Gandy MachinesAndreas Blass, Yuri Gurevich. 1-17 [doi]
- Choiceless Polynominal Time Computation and the Zero-One LawAndreas Blass, Yuri Gurevich. 18-40 [doi]
- Composition and Submachine Concepts for Sequential ASMsEgon Börger, Joachim Schmid. 41-60 [doi]
- Une tentative malheureuse do construire une structure éliminant rapidement les quanteursBruno Poizat. 61-70 [doi]
- Translating Theory into Practice - Abstract State Machines within MicrosoftWolfram Schulte. 71 [doi]
- Choiceless Polynominal Time Logic: Inability to ExpressSaharon Shelah. 72-125 [doi]
- Schema RevisitedColin Stirling. 126-138 [doi]
- Automated Verification = Graphs, Automata, and LogicMoshe Y. Vardi. 139 [doi]
- A Fully Complete PER Model for ML Polymorphic TypesSamson Abramsky, Marina Lenisa. 140-155 [doi]
- Subtyping with Power TypesDavid Aspinall. 156-171 [doi]
- The Descriptive Comlexity of the Fixed-Points of Bounded FormulasAlbert Atserias. 172-186 [doi]
- Hypersequent and the Proof Theory of Intuitionistic Fuzzy LogicMatthias Baaz, Richard Zach. 187-201 [doi]
- Continuous Functionals of Dependent Types and Equilogical SpacesAndrej Bauer, Lars Birkedal. 202-216 [doi]
- Definability over Linear ConstraintsMichael Benedikt, H. Jerome Keisler. 217-231 [doi]
- Bounded Arithmetic and Descriptive ComplexityAchim Blumensath. 232-246 [doi]
- Independence: Logics and ConcurrencyJulian C. Bradfield. 247-261 [doi]
- Flatness Is Not a WeaknessHubert Comon, Véronique Cortier. 262-276 [doi]
- Sequents, Frames, and CompletenessThierry Coquand, Guo-Qiang Zhang. 277-291 [doi]
- Disjunctive Tautologies as Synchronisation SchemesVincent Danos, Jean-Louis Krivine. 292-301 [doi]
- Axiomatizing the Least Fixed Point Operation and Binary SupremumZoltán Ésik. 302-316 [doi]
- Interactive Programs in Dependent Type TheoryPeter Hancock, Anton Setzer. 317-331 [doi]
- Modal Satisfiability Is in Deterministic Linear SpaceEdith Hemaspaandra. 332-342 [doi]
- Logic Programming and Co-inductive DefinitionsMathieu Jaume. 343-355 [doi]
- A Theory of Explicit Mathematics Equivalent to ID::1::Reinhard Kahle, Thomas Studer. 356-370 [doi]
- On the Complexity of Explicit Modal LogicsRoman Kuznets. 371-383 [doi]
- Finite Models and Full CompletenessJames Laird. 384-398 [doi]
- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and SmaleJohann A. Makowsky, Klaus Meer. 399-410 [doi]
- Elimination of Negation in a Logical FrameworkAlberto Momigliano. 411-426 [doi]
- Discreet Games, Light Affine Logic and PTIME ComputationAndrzej S. Murawski, C.-H. Luke Ong. 427-441 [doi]
- Completeness of Higher-Order Duration CalculusZhan Naijun. 442-456 [doi]
- Equational Termination by Semantic LabellingHitoshi Ohsaki, Aart Middeldorp, Jürgen Giesl. 457-471 [doi]
- On the Computational Interpretation of NegationMichel Parigot. 472-484 [doi]
- From Programs to Games: Invariance and Safety for BisimulationMarc Pauly. 485-496 [doi]
- Logical Relations and Data AbstractionJohn Power, Edmund Robinson. 497-511 [doi]
- Elementary Choiceless Constructive AnalysisPeter Schuster. 512-526 [doi]
- On the Logic of the Standard Proof PredicateRostislav E. Yavorsky. 527-541 [doi]