Abstract is missing.
- Local Reasoning about Programs that Alter Data StructuresPeter W. O'Hearn, John C. Reynolds, Hongseok Yang. 1-19 [doi]
- Applications of Alfred Tarski s Ideas in Database TheoryJan Van den Bussche. 20-37 [doi]
- Locus Solum: From the Rules of Logic to the Logic of RulesJean-Yves Girard. 38 [doi]
- The Expressive Power of Horn Monadic Linear LogicMax I. Kanovich. 39-53 [doi]
- Non-commutativity and MELL in the Calculus of StructuresAlessio Guglielmi, Lutz Straßburger. 54-68 [doi]
- Quadratic Correctness Criterion for Non-commutative LogicVirgile Mogbil. 69-83 [doi]
- Capture Complexity by PartitionYijia Chen, Enshao Shen. 84-98 [doi]
- An Existential Locality TheoremMartin Grohe, Stefan Wöhrle. 99-114 [doi]
- Actual Arithmetic and FeasibilityJean-Yves Marion. 115-129 [doi]
- The Natural Order-Generic Collapse for omega-Representable Databases over the Rational and the Real Ordered GroupNicole Schweikardt. 130-144 [doi]
- An Algebraic Foundation for HigraphsJohn Power, Konstantinos Tourlas. 145-159 [doi]
- Semantic Characterisations of Second-Order Computability over the Real NumbersMargarita V. Korovina, Oleg V. Kudinov. 160-172 [doi]
- An Abstract Look at RealizabilityEdmund Robinson, Giuseppe Rosolini. 173-187 [doi]
- The Anatomy of InnocenceVincent Danos, Russell Harmer. 188-202 [doi]
- An Improved Extensionality Criterion for Higher-Order Logic ProgramsMarc Bezem. 203-216 [doi]
- A Logic for Abstract State MachinesRobert F. Stärk, Stanislas Nanchen. 217-231 [doi]
- Constrained Hyper TableauxJan van Eijck. 232-246 [doi]
- Modal Logic and the Two-Variable FragmentCarsten Lutz, Ulrike Sattler, Frank Wolter. 247-261 [doi]
- A Logic for Approximate First-Order ReasoningFrédéric Koriche. 262-276 [doi]
- Inflationary Fixed Points in Modal LogicAnuj Dawar, Erich Grädel, Stephan Kreutzer. 277-291 [doi]
- Categorical and Kripke Semantics for Constructive S4 Modal LogicNatasha Alechina, Michael Mendler, Valeria de Paiva, Eike Ritter. 292-307 [doi]
- Labelled Natural Deduction for Interval LogicsThomas Marthedal Rasmussen. 308-323 [doi]
- Decidable Navigation Logics for Object StructuresFrank S. de Boer, Rogier M. van Eijk. 324-338 [doi]
- The Decidability of Model Checking Mobile AmbientsWitold Charatonik, Jean-Marc Talbot. 339-354 [doi]
- A Generalization of the Büchi-Elgot-Trakhtenbrot TheoremMatthias Galota, Heribert Vollmer. 355-368 [doi]
- An Effective Extension of the Wagner Hierarchy to Blind Counter AutomataOlivier Finkel. 369-383 [doi]
- Decision Procedure for an Extension of WS1SFelix Klaedtke. 384-398 [doi]
- Limiting Partial Combinatory Algebras towards Infinitary Lambda-Calculi and Classical LogicYohji Akama. 399-413 [doi]
- Intersection LogicSimona Ronchi Della Rocca, Luca Roversi. 414-428 [doi]
- Life without the Terminal TypeLutz Schröder. 429-442 [doi]
- Fully Complete Minimal PER Models for the Simply Typed lambda-CalculusSamson Abramsky, Marina Lenisa. 443-457 [doi]
- A Principle of InductionKeye Martin. 458-468 [doi]
- On a Generalisation of Herbrand s TheoremMatthias Baaz, Georg Moser. 469-483 [doi]
- Well-Founded Recursive RelationsJean Goubault-Larrecq. 484-497 [doi]
- Stratified Context Unification Is in PSPACEManfred Schmidt-Schauß. 498-512 [doi]
- Uniform Derivation of Decision Procedures by SuperpositionAlessandro Armando, Silvio Ranise, Michaël Rusinowitch. 513-527 [doi]
- Complete Categorical Equational DeductionGrigore Rosu. 528-538 [doi]
- Beyond Regularity: Equational Tree Automata for Associative and Commutative TheoriesHitoshi Ohsaki. 539-553 [doi]
- Normalized TypesPierre Courtieu. 554-569 [doi]
- Markov s Principle for Propositional Type TheoryAlexei Kopylov, Aleksey Nogin. 570-584 [doi]
- Recursion for Higher-Order EncodingsCarsten Schürmann. 585-599 [doi]
- Monotone Inductive and Coinductive Constructors of Rank 2Ralph Matthes. 600-614 [doi]