Abstract is missing.
- XML Navigation and Tarski s Relation AlgebrasMaarten Marx. 1-2 [doi]
- Verification in Predicate Logic with Time: Algorithmic QuestionsAnatol Slissenko. 3-17 [doi]
- Note on Formal Analogical Reasoning in the Juridical ContextMatthias Baaz. 18-26 [doi]
- An Abstract Strong Normalization TheoremUlrich Berger. 27-35 [doi]
- On Bunched PolymorphismMatthew Collinson, David J. Pym, Edmund Robinson. 36-50 [doi]
- Distributed Control Flow with Classical Modal LogicTom Murphy VII, Karl Crary, Robert Harper. 51-69 [doi]
- A Logic of CoequationsJirí Adámek. 70-86 [doi]
- A Semantic Formulation of TT-Lifting and Logical Predicates for Computational MetalanguageShin-ya Katsumata. 87-102 [doi]
- Order Structures on Böhm-Like ModelsPaula Severi, Fer-Jan de Vries. 103-118 [doi]
- Higher-Order Matching and GamesColin Stirling. 119-134 [doi]
- Decidability of Type-Checking in the Calculus of Algebraic Constructions with Size AnnotationsFrédéric Blanqui. 135-150 [doi]
- On the Role of Type Decorations in the Calculus of Inductive ConstructionsBruno Barras, Benjamin Grégoire. 151-166 [doi]
- L-Nets, Strategies and Proof-NetsPierre-Louis Curien, Claudia Faggian. 167-183 [doi]
- Permutative LogicJean-Marc Andreoli, Gabriele Pulcini, Paul Ruet. 184-199 [doi]
- Focusing the Inverse Method for Linear LogicKaustuv Chaudhuri, Frank Pfenning. 200-215 [doi]
- Towards a Typed Geometry of InteractionEsfandiar Haghverdi, Philip J. Scott. 216-231 [doi]
- From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint SatisfactionHubie Chen, Víctor Dalmau. 232-247 [doi]
- An Algebraic Approach for the Unsatisfiability of Nonlinear ConstraintsAshish Tiwari. 248-262 [doi]
- Coprimality in Finite ModelsMarcin Mostowski, Konrad Zdanowski. 263-275 [doi]
- Towards a Characterization of Order-Invariant Queries over Tame StructuresMichael Benedikt, Luc Segoufin. 276-291 [doi]
- Decidability of Term Algebras Extending Partial AlgebrasBakhadyr Khoussainov, Sasha Rubin. 292-308 [doi]
- Results on the Guarded Fragment with Equivalence or Transitive RelationsEmanuel Kieronski. 309-324 [doi]
- The Modular Decomposition of Countable Graphs: Constructions in Monadic Second-Order LogicBruno Courcelle, Christian Delhommé. 325-338 [doi]
- On the Complexity of Hybrid Logics with BindersBalder ten Cate, Massimo Franceschet. 339-354 [doi]
- The Complexity of Independence-Friendly Fixpoint LogicJulian C. Bradfield, Stephan Kreutzer. 355-368 [doi]
- Closure Properties of Weak Systems of Bounded ArithmeticAntonina Kolokolova. 369-383 [doi]
- Transfinite Extension of the Mu-CalculusJulian C. Bradfield, Jacques Duparc, Sandra Quickert. 384-396 [doi]
- Bounded Model Checking of Pointer ProgramsWitold Charatonik, Lilia Georgieva, Patrick Maier. 397-412 [doi]
- PDL with Intersection and Converse Is DecidableCarsten Lutz. 413-427 [doi]
- On Deciding Topological Classes of Deterministic Tree LanguagesFilip Murlak. 428-441 [doi]
- Complexity and Intensionality in a Type-1 Framework for Computable AnalysisBranimir Lambov. 442-461 [doi]
- Computing with Sequences, Weak Topologies and the Axiom of ChoiceVasco Brattka, Matthias Schröder. 462-476 [doi]
- Light Functional InterpretationMircea-Dan Hernest. 477-492 [doi]
- Feasible Proofs of Matrix Properties with Csanky s AlgorithmMichael Soltys. 493-508 [doi]
- A Propositional Proof System for Log SpaceSteven Perron. 509-524 [doi]
- Identifying Polynomial-Time Recursive FunctionsCarsten Schürmann, Jatin Shah. 525-540 [doi]
- Confluence of Shallow Right-Linear Rewrite SystemsGuillem Godoy, Ashish Tiwari. 541-556 [doi]
- The Ackermann Award 2005Erich Grädel, Janos Makowsky, Alexander A. Razborov. 557-565 [doi]
- Clemens Lautemann: 1951-2005 ::::An Obituary::::Johann A. Makowsky. 566-566 [doi]