Abstract is missing.
- The Computability Path Ordering: The End of a QuestFrédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio. 1-14 [doi]
- The Joy of String DiagramsPierre-Louis Curien. 15-22 [doi]
- Model Transformations in Decidability Proofs for Monadic TheoriesWolfgang Thomas. 23-31 [doi]
- Molecules as AutomataLuca Cardelli. 32 [doi]
- An Infinite Automaton Characterization of Double Exponential TimeSalvatore La Torre, P. Madhusudan, Gennaro Parlato. 33-48 [doi]
- Recursion Schemata for NCkGuillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. 49-63 [doi]
- Extensional Uniformity for Boolean CircuitsPierre McKenzie, Michael Thomas, Heribert Vollmer. 64-78 [doi]
- Pure Pointer Programs with IterationMartin Hofmann, Ulrich Schöpp. 79-93 [doi]
- Quantified Positive Temporal ConstraintsWitold Charatonik, Michal Wrona. 94-108 [doi]
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality ConstraintNadia Creignou, Henning Schnoor, Ilka Schnoor. 109-123 [doi]
- Fractional Collections with Cardinality Bounds, and Mixed Linear Arithmetic with StarsRuzica Piskac, Viktor Kuncak. 124-138 [doi]
- Continuous Fragment of the mu-CalculusGaëlle Fontaine. 139-153 [doi]
- On the Relations between the Syntactic Theories of lambda-mu-CalculiAlexis Saurin. 154-168 [doi]
- A Constructive Semantic Approach to Cut Elimination in Type Theories with AxiomsOlivier Hermant, James Lipton. 169-183 [doi]
- Proving Infinitude of Prime Numbers Using Binomial CoefficientsPhuong Nguyen. 184-198 [doi]
- A Tight Karp-Lipton Collapse Result in Bounded ArithmeticOlaf Beyersdorff, Sebastian Müller. 199-214 [doi]
- A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)Stefano Berardi, Ugo de Liguoro. 215-229 [doi]
- Quantitative Game Semantics for Linear LogicUgo Dal Lago, Olivier Laurent. 230-245 [doi]
- A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear LogicPaolo Tranquilli. 246-261 [doi]
- An Indexed System for Multiplicative Additive Polarized Linear LogicMasahiro Hamano, Ryo Takemura. 262-277 [doi]
- A Characterisation of Lambda Definability with Sums Via TT-Closure OperatorsShin-ya Katsumata. 278-292 [doi]
- Superposition for Fixed DomainsMatthias Horbach, Christoph Weidenbach. 293-307 [doi]
- Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and TIan Hodkinson, Angelo Montanari, Guido Sciavicco. 308-322 [doi]
- On the Almighty WandRémi Brochenin, Stéphane Demri, Étienne Lozes. 323-338 [doi]
- On Counting Generalized ColoringsTomer Kotek, Johann A. Makowsky, Boris Zilber. 339-353 [doi]
- The Descriptive Complexity of Parity GamesAnuj Dawar, Erich Grädel. 354-368 [doi]
- An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff GamesSven Schewe. 369-384 [doi]
- Quantitative LanguagesKrishnendu Chatterjee, Laurent Doyen, Thomas A. Henzinger. 385-400 [doi]
- Characterization of Logics over Ranked Tree LanguagesThomas Place. 401-415 [doi]
- The Nesting-Depth of Disjunctive µ-Calculus for Tree Languages and the Limitedness ProblemThomas Colcombet, Christof Löding. 416-430 [doi]
- Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)Jochen Eisinger. 431-445 [doi]
- Syntactic Metatheory of Higher-Order SubtypingAndreas Abel, Dulma Rodriguez. 446-460 [doi]
- On Isomorphisms of Intersection TypesMariangiola Dezani-Ciancaglini, Roberto Di Cosmo, Elio Giovannetti, Makoto Tatsuta. 461-477 [doi]
- Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with ExistenceKoji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano. 478-492 [doi]
- Type-Based Termination with Sized ProductsGilles Barthe, Benjamin Grégoire, Colin Riba. 493-507 [doi]
- The Ackermann Award 2008Johann A. Makowsky, Damian Niwinski. 508-512 [doi]