Abstract is missing.
- Notions of Average-Case Complexity for Random 3-SATAlbert Atserias. 1-5 [doi]
- Abstract Interpretation of Proofs: Classical Propositional CalculusMartin Hyland. 6-21 [doi]
- Applications of Craig Interpolation to Model CheckingKenneth L. McMillan. 22-23 [doi]
- Bindings, Mobility of Bindings, and the generic judgments -Quantifier: An AbstractDale Miller. 24 [doi]
- My (Un)Favourite ThingsPawel Urzyczyn. 25 [doi]
- On Nash Equilibria in Stochastic GamesKrishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski. 26-40 [doi]
- A Bounding QuantifierMikolaj Bojanczyk. 41-55 [doi]
- Parity and Exploration Games on Infinite GraphsHugo Gimbert. 56-70 [doi]
- Integrating Equational Reasoning into Instantiation-Based Theorem ProvingHarald Ganzinger, Konstantin Korovin. 71-84 [doi]
- Goal-Directed Methods for Lukasiewicz LogicGeorge Metcalfe, Nicola Olivetti, Dov M. Gabbay. 85-99 [doi]
- A General Theorem on Termination of RewritingJeremy E. Dawson, Rajeev Goré. 100-114 [doi]
- Predicate Transformers and Linear Logic: Yet Another Denotational ModelPierre Hyvernat. 115-129 [doi]
- Structures for Multiplicative Cyclic Linear Logic: Deepness vs CyclicityPietro Di Gianantonio. 130-144 [doi]
- On Proof Nets for Multiplicative Linear Logic with UnitsLutz Straßburger, François Lamarche. 145-159 [doi]
- The Boundary Between Decidability and Undecidability for Transitive-Closure LogicsNeil Immerman, Alexander Moshe Rabinovich, Thomas W. Reps, Shmuel Sagiv, Greta Yorsh. 160-174 [doi]
- Game-Based Notions of Locality Over Finite ModelsMarcelo Arenas, Pablo Barceló, Leonid Libkin. 175-189 [doi]
- Fixed Points of Type Constructors and Primitive RecursionAndreas Abel, Ralph Matthes. 190-204 [doi]
- On the Building of Affine RetractionsAleksy Schubert. 205-219 [doi]
- Higher-Order Matching in the Linear lambda-calculus with PairingPhilippe de Groote, Sylvain Salvati. 220-234 [doi]
- A Dependent Type Theory with Names and BindingUlrich Schöpp, Ian Stark. 235-249 [doi]
- Towards Mechanized Program Verification with Separation LogicTjark Weber. 250-264 [doi]
- A Functional Scenario for Bytecode Verification of Resource BoundsRoberto M. Amadio, Solange Coupet-Grimal, Silvano Dal-Zilio, Line Jakubiec. 265-279 [doi]
- Proving Abstract Non-interferenceRoberto Giacobazzi, Isabella Mastroeni. 280-294 [doi]
- Intuitionistic LTL and a New Characterization of Safety and LivenessPatrick Maier. 295-309 [doi]
- Moving in a Crumbling Network: The Balanced CasePhilipp Rohde. 310-324 [doi]
- Parameterized Model Checking of Ring-Based Message Passing SystemsE. Allen Emerson, Vineet Kahlon. 325-339 [doi]
- A Third-Order Bounded Arithmetic Theory for PSPACEAlan Skelley. 340-354 [doi]
- Provably Total Primitive Recursive Functions: Theories with InductionAndrés Cordón-Franco, Alejandro Fernández-Margarit, Francisco Félix Lara Martín. 355-369 [doi]
- Logical Characterizations of PSPACEDavid Richerby. 370-384 [doi]
- The Logic of the Partial lambda-Calculus with EqualityLutz Schröder. 385-399 [doi]
- Complete Lax Logical Relations for Cryptographic Lambda-CalculiJean Goubault-Larrecq, Slawomir Lasota, David Nowak, Yu Zhang. 400-414 [doi]
- Subtyping Union TypesJerome Vouillon. 415-429 [doi]
- Pfaffian Hybrid SystemsMargarita V. Korovina, Nicolai Vorobjov. 430-441 [doi]
- Axioms for Delimited Continuations in the CPS HierarchyYukiyoshi Kameyama. 442-457 [doi]
- Set Constraints on Regular TermsPawel Rychlikowski, Tomasz Truderung. 458-472 [doi]
- Unsound Theorem ProvingChristopher Lynch. 473-487 [doi]
- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive NegationAlessandro Avellone, Camillo Fiorentini, Guido Fiorino, Ugo Moscato. 488-502 [doi]
- Automated Generation of Analytic Calculi for Logics with LinearityAgata Ciabattoni. 503-517 [doi]