Abstract is missing.
- Some Decision Problems of Enormous ComplexityHarvey Friedman. 2-13 [doi]
- Two-Variable Descriptions of RegularityErich Grädel, Eric Rosen. 14-23 [doi]
- The Two-Variable Guarded Fragment with Transitive RelationsHarald Ganzinger, Christoph Meyer, Margus Veanes. 24-34 [doi]
- Logics with Aggregate OperatorsLauri Hella, Leonid Libkin, Juha Nurmonen, Limsoon Wong. 35-44 [doi]
- Guarded Fixed Point LogicErich Grädel, Igor Walukiewicz. 45-54 [doi]
- Towards a Theory of Bisimulation for Local NamesAlan Jeffrey, Julian Rathke. 56-66 [doi]
- Weak Bisimulation and Open MapsMarcelo P. Fiore, Gian Luca Cattani, Glynn Winskel. 67-76 [doi]
- Region Analysis and the Polymorphic Lambda CalculusAnindya Banerjee, Nevin Heintze, Jon G. Riecke. 88-97 [doi]
- Pattern Matching as Cut EliminationSerenella Cerrito, Delia Kesner. 98-108 [doi]
- Some Computational Properties of Intersection TypesAntonio Bucciarelli, Silvia De Lorenzis, Adolfo Piperno, Ivano Salvo. 109-118 [doi]
- Type Inference for Recursive DefinitionsA. J. Kfoury, Santiago M. Pericás-Geertsen. 119-129 [doi]
- Plausibility Measures and Default Reasoning: An OverviewJoseph Y. Halpern, Nir Friedman. 130-135 [doi]
- Subtyping Recursive Types in Kernel FunDario Colazzo, Giorgio Ghelli. 137-146 [doi]
- A Fragment Calculus - Towards a Model of Separate Compilation, Linking and Binary CompatibilitySophia Drossopoulou, Susan Eisenbach, David Wragg. 147-156 [doi]
- Proof Techniques for Cryptographic ProcessesMichele Boreale, Rocco De Nicola, Rosario Pugliese. 157-166 [doi]
- On Hoare Logic and Kleene Algebra with TestsDexter Kozen. 167-172 [doi]
- Full Abstraction and Universality via RealisabilityMichael Marz, Alexander Rohr, Thomas Streicher. 174-182 [doi]
- On Bunched Predicate LogicDavid J. Pym. 183-192 [doi]
- Abstract Syntax and Variable BindingMarcelo P. Fiore, Gordon D. Plotkin, Daniele Turi. 193-202 [doi]
- Semantical Analysis of Higher-Order Abstract SyntaxMartin Hofmann. 204-213 [doi]
- A New Approach to Abstract Syntax Involving BindersMurdoch Gabbay, Andrew M. Pitts. 214-224 [doi]
- Paramodulation with Non-Monotonic OrderingsMiquel Bofill, Guillem Godoy, Robert Nieuwenhuis, Albert Rubio. 225-233 [doi]
- Full Completeness of the Multiplicative Linear Logic of Chu SpacesHarish Devarajan, Dominic J. D. Hughes, Gordon D. Plotkin, Vaughan R. Pratt. 234-242 [doi]
- Cartesian Closed Double Categories, Their Lambda-Notation, and the Pi-CalculusRoberto Bruni, Ugo Montanari. 246-265 [doi]
- First-Order Logic vs. Fixed-Point Logic in Finite Set TheoryAlbert Atserias, Phokion G. Kolaitis. 275-284 [doi]
- Entailment of Atomic Set Constraints is PSPACE-CompleteJoachim Niehren, Martin Müller, Jean-Marc Talbot. 285-294 [doi]
- A Superposition Decision Procedure for the Guarded Fragment with EqualityHarald Ganzinger, Hans de Nivelle. 295-304 [doi]
- Working with Arms: Complexity Results on Atomic Representations of Herbrand ModelsGeorg Gottlob, Reinhard Pichler. 306-315 [doi]
- Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant QueriesLeonid Libkin. 316-325 [doi]
- Counting and Addition Cannot Express Deterministic Transitive ClosureMatthias Ruhl. 326-334 [doi]
- Parametric Quantitative Temporal ReasoningE. Allen Emerson, Richard J. Trefler. 336-343 [doi]
- Modular Temporal LogicAugustin Baziramwabo, Pierre McKenzie, Denis Thérien. 344-351 [doi]
- On the Verification of Broadcast ProtocolsJavier Esparza, Alain Finkel, Richard Mayr. 352-359 [doi]
- On the Expressive Power of CTLFaron Moller, Alexander Moshe Rabinovich. 360-369 [doi]
- Proving Security Protocols CorrectLawrence C. Paulson. 370-383 [doi]
- Reasoning about Common Knowledge with Infinitely Many AgentsJoseph Y. Halpern, Richard A. Shore. 384-393 [doi]
- Parikh s Theorem in Commutative Kleene AlgebraMark W. Hopkins, Dexter Kozen. 394-401 [doi]
- The Higher-Order Recursive Path OrderingJean-Pierre Jouannaud, Albert Rubio. 402-411 [doi]
- Extensional Equality in Intensional Type TheoryThorsten Altenkirch. 412-420 [doi]
- A Fully Abstract Game Semantics for Finite NondeterminismRussell Harmer, Guy McCusker. 422-430 [doi]
- Concurrent Games and Full CompletenessSamson Abramsky, Paul-André Melliès. 431-442 [doi]
- Correctness of Multiplicative Proof Nets Is LinearStefano Guerrini. 454-463 [doi]
- Linear Types and Non-Size-Increasing Polynomial Time ComputationMartin Hofmann. 464-473 [doi]