Abstract is missing.
- Backward induction in games of perfect informationRobert J. Aumann. 1 [doi]
- On Building Constructive Formal Theories of Computation Noting the Roles of Turing, Church, and BrouwerRobert L. Constable. 2-8 [doi]
- Privacy, Anonymity, and Accountability in Ad-Supported ServicesJoan Feigenbaum. 9-10 [doi]
- Turing's Password: What Internet Cannot LeakLeonid A. Levin. 11 [doi]
- Term Rewriting and Lambda CalculusJan Willem Klop. 12 [doi]
- Logics of Dynamical SystemsAndré Platzer. 13-24 [doi]
- Lower Bounds for Existential Pebble Games and k-Consistency TestsChristoph Berkholz. 25-34 [doi]
- Dense-Timed Pushdown AutomataParosh Aziz Abdulla, Mohamed Faouzi Atig, Jari Stenman. 35-44 [doi]
- Coproducts of Monads on SetJirí Adámek, Stefan Milius, Nathan Bowler, Paul Blain Levy. 45-54 [doi]
- Approximate Verification of the Symbolic Dynamics of Markov ChainsManindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan. 55-64 [doi]
- Regular Transformations of Infinite StringsRajeev Alur, Emmanuel Filiot, Ashutosh Trivedi. 65-74 [doi]
- The Semantics of Parsing with Semantic ActionsRobert Atkey. 75-84 [doi]
- Modular Construction of Cut-free Sequent Calculi for Paraconsistent LogicsArnon Avron, Beata Konikowska, Anna Zamansky. 85-94 [doi]
- Inductive Types in Homotopy Type TheorySteven Awodey, Nicola Gambino, Kristina Sojakova. 95-104 [doi]
- Combining Deduction Modulo and Logics of Fixed-Point DefinitionsDavid Baelde, Gopalan Nadathur. 105-114 [doi]
- Graph Logics with Rational Relations and the Generalized Intersection ProblemPablo Barceló, Diego Figueira, Leonid Libkin. 115-124 [doi]
- Near Unanimity Constraints Have Bounded Pathwidth DualityLibor Barto, Marcin Kozik, Ross Willard. 125-134 [doi]
- A Computational Interpretation of ParametricityJean-Philippe Bernardy, Guilhem Moulin. 135-144 [doi]
- Von Neumann's Biased Coin RevisitedLaurent Bienvenu, Benoit Monin. 145-154 [doi]
- On the Magnitude of Completeness Thresholds in Bounded Model CheckingDaniel Bundala, Joël Ouaknine, James Worrell. 155-164 [doi]
- Collapsible Pushdown Automata and Labeled Recursion Schemes: Equivalence, Safety and Effective SelectionArnaud Carayol, Olivier Serre. 165-174 [doi]
- Partial-Observation Stochastic Games: How to Win When Belief FailsKrishnendu Chatterjee, Laurent Doyen 0001. 175-184 [doi]
- Decidable Problems for Probabilistic Automata on Infinite WordsKrishnendu Chatterjee, Mathieu Tracol. 185-194 [doi]
- Mean-Payoff Pushdown GamesKrishnendu Chatterjee, Yaron Velner. 195-204 [doi]
- Decomposing Quantified Conjunctive (or Disjunctive) FormulasHubie Chen, Víctor Dalmau. 205-214 [doi]
- An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint SatisfactionHubie Chen, Moritz Müller. 215-224 [doi]
- On the Ordered ConjectureYijia Chen, Jörg Flum. 225-234 [doi]
- The Winning Ways of Concurrent GamesPierre Clairambault, Julian Gutierrez, Glynn Winskel. 235-244 [doi]
- Strong Complementarity and Non-locality in Categorical Quantum MechanicsBob Coecke, Ross Duncan, Aleks Kissinger, Quanlong Wang. 245-254 [doi]
- The HOM Problem is EXPTIME-CompleteCarles Creus, Adria Gascón, Guillem Godoy, Lander Ramos. 255-264 [doi]
- Where First-Order and Monadic Second-Order Logic CoincideMichael Elberfeld, Martin Grohe, Till Tantau. 265-274 [doi]
- First-Order and Monadic Second-Order Model-Checking on Ordered StructuresViktor Engelmann, Stephan Kreutzer, Sebastian Siebertz. 275-284 [doi]
- A Perfect Model for Bounded VerificationJavier Esparza, Pierre Ganty, Rupak Majumdar. 285-294 [doi]
- Deciding the Value 1 Problem for Probabilistic Leaktight AutomataNathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj. 295-304 [doi]
- Delta-Decidability over the RealsSicun Gao, Jeremy Avigad, Edmund M. Clarke. 305-314 [doi]
- Countermodels from Sequent Calculi in Multi-Modal LogicsDeepak Garg, Valerio Genovese, Sara Negri. 315-324 [doi]
- The Complexity of Decomposing Modal and First-Order TheoriesStefan Göller, Jean Christoph Jung, Markus Lohrey. 325-334 [doi]
- Automatic Sequences and Zip-SpecificationsClemens Grabmayer, Jörg Endrullis, Dimitri Hendriks, Jan Willem Klop, Lawrence S. Moss. 335-344 [doi]
- Functionals Using Bounded Information and the Dynamics of AlgorithmsSerge Grigorieff, Pierre Valarcher. 345-354 [doi]
- The Ordinal-Recursive Complexity of Timed-arc Petri Nets, Data Nets, and Other Enriched NetsSerge Haddad, Sylvain Schmitz, Philippe Schnoebelen. 355-364 [doi]
- A Constructive Proof of Dependent Choice, Compatible with Classical LogicHugo Herbelin. 365-374 [doi]
- Better Abstractions for Timed AutomataFrédéric Herbreteau, B. Srivathsan, Igor Walukiewicz. 375-384 [doi]
- Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial ObjectsNaohiko Hoshino. 385-394 [doi]
- Extending Type Theory with ForcingGuilhem Jaber, Nicolas Tabareau, Matthieu Sozeau. 395-404 [doi]
- The Complexity of Verbal Languages over GroupsSanjay Jain, Alexei Miasnikov, Frank Stephan. 405-414 [doi]
- Decidability of DPDA Language Equivalence via First-Order GrammarsPetr Jancar. 415-424 [doi]
- Capsules and SeparationJean-Baptiste Jeannin, Dexter Kozen. 425-430 [doi]
- Two-Variable First-Order Logic with Equivalence ClosureEmanuel Kieronski, Jakub Michaliszyn, Ian Pratt-Hartmann, Lidia Tendera. 431-440 [doi]
- Learning Probabilistic Systems from Tree SamplesAnvesh Komuravelli, Corina S. Pasareanu, Edmund M. Clarke. 441-450 [doi]
- Non-definability of Languages by Generalized First-order Formulas over (N, +)Andreas Krebs, A. V. Sreejith. 451-460 [doi]
- A Kantorovich-Monadic Powerdomain for Information Hiding, with Probability and NondeterminismAnnabelle McIver, Larissa Meinicke, Carroll Morgan. 461-470 [doi]
- An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-CalculusDamiano Mazza. 471-480 [doi]
- Game Semantics in String DiagramsPaul-André Melliès. 481-490 [doi]
- Decidable Elementary Modal LogicsJakub Michaliszyn, Jan Otop. 491-500 [doi]
- Short Propositional Refutations for Dense Random 3CNF FormulasSebastian Müller, Iddo Tzameret. 501-510 [doi]
- On the Complexity of Linear Authorization LogicsVivek Nigam. 511-520 [doi]
- On the Significance of the Collapse OperationPawel Parys. 521-530 [doi]
- A Higher-Order Distributed Calculus with Name CreationAdrien Piérard, Eijiro Sumii. 531-540 [doi]
- The Complete Proof Theory of Hybrid SystemsAndré Platzer. 541-550 [doi]
- Interpretations in Trees with Countably Many BranchesAlexander Rabinovich, Sasha Rubin. 551-560 [doi]
- Conservative Concurrency in HaskellDavid Sabel, Manfred Schmidt-Schauß. 561-570 [doi]
- Constructing Fully Complete Models for Multiplicative Linear LogicAndrea Schalk, Hugh Steele. 571-580 [doi]
- Induction in Algebra: A First Case StudyPeter Schuster. 581-585 [doi]
- An Automata Model for Trees with Ordered Data ValuesTony Tan. 586-595 [doi]
- Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem ProvingDmitriy Traytel, Andrei Popescu 0001, Jasmin Christian Blanchette. 596-605 [doi]
- Higher Semantics of Quantum ProtocolsJamie Vicary. 606-615 [doi]