Abstract is missing.
- Fixed-Point Logics on Planar GraphsMartin Grohe. 6-15
- Existential Second-Order Logic over StringsThomas Eiter, Georg Gottlob, Yuri Gurevich. 16-27
- Ordering Finite Variable Types with Generalized QuantifiersAnuj Dawar, Lauri Hella, Anil Seth. 28-43
- Convergence Results for Relational Bayesian NetworksManfred Jaeger. 44-55
- The Horn Mu-calculusWitold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz. 58-69
- On Model Checking for Non-Deterministic Infinite-State SystemsE. Allen Emerson, Kedar S. Namjoshi. 70-80
- Freedom, Weakness, and Determinism: From Linear-Time to Branching-TimeOrna Kupferman, Moshe Y. Vardi. 81-92
- Efficient Representation and Validation of ProofsGeorge C. Necula, Peter Lee. 93-104
- Secure Implementation of Channel AbstractionsMartín Abadi, Cédric Fournet, Georges Gonthier. 105-116
- The Logical Role of the Four-Valued BilatticeOfer Arieli, Arnon Avron. 118-126
- Completeness of a Relational Calculus for Program SchemesMarcelo F. Frias, Roger D. Maddux. 127-134
- Phase Semantics and Verification of Concurrent Constraint ProgramsFrançois Fages, Paul Ruet, Sylvain Soliman. 141-152
- A Congruence Theorem for Structured Operational Semantics of Higher-Order LanguagesKaren L. Bernstein. 153-164
- Bisimulation in Name-Passing Calculi without MatchingMichele Boreale, Davide Sangiorgi. 165-175
- The Fusion Calculus: Expressiveness and Symmetry in Mobile ProcessesJoachim Parrow, Björn Victor. 176-185
- Type Theory via Exact CategoriesLars Birkedal, Aurelio Carboni, Giuseppe Rosolini, Dana S. Scott. 188-198
- Higher Dimensional MultigraphsClaudio Hermida, Michael Makkai, John Power. 199-206
- An Axiomatics for Categories of Transition Systems as CoalgebrasPeter Johnstone, John Power, Toru Tsujishita, Hiroshi Watanabe, James Worrell. 207-213
- A Theory of Recursive Domains with Applications to ConcurrencyGian Luca Cattani, Marcelo P. Fiore, Glynn Winskel. 214-225
- Process Operations in Extended Dynamic LogicsJohan van Benthem. 244-250
- Herbrand s Theorem, Automated Reasoning and Semantics TableauxAndrei Voronkov. 252-263
- The Relation Between Second-Order Unification and Simultaneous Rigid ::::E::::-UnificationMargus Veanes. 264-275
- Decision Problems in Ordered RewritingHubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch. 276-286
- A Stability Theorem in Rewriting TheoryPaul-André Melliès. 287-299
- Light Affine LogicAndrea Asperti. 300-308
- Linear Logic ::::With:::: BoxesIan Mackie. 309-320
- Coinductive Techniques for Operational Equivalence of Interaction NetsMaribel Fernández, Ian Mackie. 321-332
- A Fully Abstract Game Semantics for General ReferencesSamson Abramsky, Kohei Honda, Guy McCusker. 334-344
- Recursive Types in Games: Axiomatics and Process RepresentationMarcelo P. Fiore, Kohei Honda. 345-356
- Realizability for Constructive Theory of Functions and Classes and its Application to Program SynthesisMakoto Tatsuta. 358-367
- Completeness of Type Assignment Systems with Intersection, Union, and Type QuantifiersHirofumi Yokouchi. 368-379
- Full Abstraction for First-Order Objects with Recursive Types and SubtypingRamesh Viswanathan. 380-391
- Calculus in Coinductive FormDusko Pavlovic, Martín Hötzel Escardó. 408-417
- The First-Order Theory of Ordering Constraints over Feature TreesMartin Müller, Joachim Niehren, Ralf Treinen. 432-443
- Compositional Analysis of Expected Delays in Networks of Probabilistic I/O AutomataEugene W. Stark, Scott A. Smolka. 466-477
- A Logical Characterization of Bisimulation for Labeled Markov ProcessesJosee Desharnais, Abbas Edalat, Prakash Panangaden. 478-487
- Embedded Finite Models, Stability Theory and the Impact of OrderJohn T. Baldwin, Michael Benedikt. 490-500
- On Counting Logics and Local PropertiesLeonid Libkin. 501-512
- On the Boundedness Problem for Two-Variable First-Order LogicPhokion G. Kolaitis, Martin Otto. 513-524
- Fragments of Existential Second-Order Logic without 0-1 LawsJean-Marie Le Bars. 525-536