Abstract is missing.
- Combination of Compatible Reduction Orderings that are Total on Ground TermsFranz Baader. 2-13 [doi]
- Automata-Driven Automated InductionAdel Bouhoula, Jean-Pierre Jouannaud. 14-25 [doi]
- Ground Reducibility is EXPTIME-CompleteHubert Comon, Florent Jacquemard. 26-34 [doi]
- Strong Normalization of Explicit Substitutions via Cut Elimination in Proof Nets (Extended Abstract)Roberto Di Cosmo, Delia Kesner. 35-46 [doi]
- Temporal Linear Logic Specifications for Concurrent Processes (Extended Abstract)Max I. Kanovich, Takayasu Ito. 48-57 [doi]
- Believe it or not, AJM s Games Model is a Model of Classical Linear LogicPatrick Baillot, Vincent Danos, Thomas Ehrhard, Laurent Regnier. 68-75 [doi]
- Games and Definability for System FDominic J. D. Hughes. 76-86 [doi]
- Boolean Expression Diagrams (Extended Abstract)Henrik Reif Andersen, Henrik Hulgaard. 88-98 [doi]
- How Much Memory is Needed to Win Infinite Games?Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz. 99-110 [doi]
- Quantitative Analysis and Model CheckingMichael Huth, Marta Z. Kwiatkowska. 111-122 [doi]
- A Partially Deadlock-Free Typed Process CalculusNaoki Kobayashi. 128-139 [doi]
- Bisimulation for Labelled Markov ProcessesRichard Blute, Josee Desharnais, Abbas Edalat, Prakash Panangaden. 149-158 [doi]
- A Kleene Theorem for Timed AutomataEugene Asarin, Paul Caspi, Oded Maler. 160-171 [doi]
- Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete LatticesDavid Janin. 172-182 [doi]
- On the Complexity of Reasoning in Kleene AlgebraDexter Kozen. 195-202 [doi]
- On the Forms of Locality over Finite ModelsLeonid Libkin. 204-215 [doi]
- Large Finite Structures with Few L:::k:::-TypesMartin Grohe. 216-227 [doi]
- First-Order Logic with Two Variables and Unary Temporal LogicKousha Etessami, Moshe Y. Vardi, Thomas Wilke. 228-235 [doi]
- The Monadic Quantifier Alternation Hierarchy over Graphs is InfiniteOliver Matz, Wolfgang Thomas. 236-244 [doi]
- Semantics of Exact Real ArithmeticPeter John Potts, Abbas Edalat, Martín Hötzel Escardó. 248-257 [doi]
- A Relational Account of Call-by-Value SequentialityJon G. Riecke, Anders Sandholm. 258-267 [doi]
- Complete Cuboidal Sets in Axiomatic Domain TheoryMarcelo P. Fiore, Gordon D. Plotkin, A. John Power. 268-279 [doi]
- Towards a Mathematical Operational SemanticsDaniele Turi, Gordon D. Plotkin. 280-291 [doi]
- The Hardest Natural Decidable TheorySergei G. Vorobyov. 294-305 [doi]
- Two-Variable Logic with Counting is DecidableErich Grädel, Martin Otto, Eric Rosen. 306-317 [doi]
- Complexity of Two-Variable Logic with CountingLeszek Pacholski, Wieslaw Szwast, Lidia Tendera. 318-327 [doi]
- On the Cubic Bottleneck in Subtyping and Flow AnalysisNevin Heintze, David A. McAllester. 342-351 [doi]
- The Complexity of Subtype Entailment for Simple TypesFritz Henglein, Jakob Rehof. 352-361 [doi]
- Set Constraints with IntersectionWitold Charatonik, Andreas Podelski. 362-372 [doi]
- Induction and Recursion on the Partial Real Line via Biquotients of Bifree AlgebrasMartín Hötzel Escardó, Thomas Streicher. 376-386 [doi]
- Continuation Models are Universal for Lambda-Mu-CalculusMartin Hofmann, Thomas Streicher. 387-395 [doi]
- Discrimination by Parallel ObserversMariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn. 396-407 [doi]
- Ramified Higher-Order UnificationJean Goubault-Larrecq. 410-421 [doi]
- Linear Higher-Order Pre-UnificationIliano Cervesato, Frank Pfenning. 422-433 [doi]
- A Logic for Reasoning with Higher-Order Abstract SyntaxRaymond McDowell, Dale Miller. 434-445 [doi]