Abstract is missing.
- Querying the Guarded FragmentVince Bárány, Georg Gottlob, Martin Otto. 1-10 [doi]
- Highly Acyclic Groups, Hypergraph Covers and the Guarded FragmentMartin Otto. 11-20 [doi]
- Equality Is Typable in Semi-full Pure Type SystemsVincent Siles, Hugo Herbelin. 21-30 [doi]
- Strong Normalization for System F by HOAS on Top of FOASAndrei Popescu, Elsa L. Gunter, Christopher J. Osborn. 31-40 [doi]
- Game Semantics for a Polymorphic Programming LanguageJames Laird. 41-49 [doi]
- An Intuitionistic Logic that Proves Markov s PrincipleHugo Herbelin. 50-56 [doi]
- Amir Pnueli: A Gentle Giant, Lord of the Phi s and the Psi sDavid Harel. 57 [doi]
- Robin Milner, a Craftsman of Tools for the MindGordon D. Plotkin. 58-59 [doi]
- Alternating Timed Automata over Bounded TimeMark Jenkins, Joël Ouaknine, Alexander Rabinovich, James Worrell. 60-69 [doi]
- Regular Cost Functions over Finite TreesThomas Colcombet, Christof Löding. 70-79 [doi]
- Parikh Images of Grammars: Complexity and ApplicationsEryk Kopczynski, Anthony Widjaja To. 80-89 [doi]
- On the Scope of the Universal-Algebraic Approach to Constraint SatisfactionManuel Bodirsky, Martin Hils, Barnaby Martin. 90-99 [doi]
- New Conditions for Taylor Varieties and CSPLibor Barto, Marcin Kozik. 100-109 [doi]
- The Fine Print of SecurityMartín Abadi. 110 [doi]
- Modular Construction of Fixed Point Combinators and Clocked Bohm TreesJörg Endrullis, Dimitri Hendriks, Jan Willem Klop. 111-119 [doi]
- Recursion Schemes and Logical ReflectionChristopher H. Broadbent, Arnaud Carayol, C.-H. Luke Ong, Olivier Serre. 120-129 [doi]
- Undecidability of Propositional Separation Logic and Its NeighboursJames Brotherston, Max I. Kanovich. 130-139 [doi]
- The Undecidability of Boolean BI through Phase SemanticsDominique Larchey-Wendling, Didier Galmiche. 140-149 [doi]
- Segal Condition Meets Computational EffectsPaul-André Melliès. 150-159 [doi]
- The Isomorphism Problem on Classes of Automatic StructuresDietrich Kuske, Jiamou Liu, Markus Lohrey. 160-169 [doi]
- On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite StructuresYuguo He. 170-178 [doi]
- Lower Bounds for the Complexity of Monadic Second-Order LogicStephan Kreutzer, Siamak Tazari. 189-198 [doi]
- Capturing Polynomial Time on Interval GraphsBastian Laubner. 199-208 [doi]
- A Generic Operational Metatheory for Algebraic EffectsPatricia Johann, Alex Simpson, Janis Voigtländer. 209-218 [doi]
- Polarity and the Logic of Delimited ContinuationsNoam Zeilberger. 219-227 [doi]
- Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New ApplicationsAndrea Calì, Georg Gottlob, Thomas Lukasiewicz, Bruno Marnette, Andreas Pieris. 228-242 [doi]
- An Extension of Data Automata that Captures XPathMikolaj Bojanczyk, Slawomir Lasota. 243-252 [doi]
- Deciding Definability in FO::2::(<) (or XPath) on TreesThomas Place, Luc Segoufin. 253-262 [doi]
- The Emptiness Problem for Tree Automata with Global ConstraintsLuis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, Camille Vacher. 263-272 [doi]
- Addition-Invariant FO and RegularityNicole Schweikardt, Luc Segoufin. 273-282 [doi]
- Theorem Proving for Verification: The Early DaysJ. Strother Moore. 283 [doi]
- Breaking Paths in Atomic Flows for Classical LogicAlessio Guglielmi, Tom Gundersen, Lutz Straßburger. 284-293 [doi]
- Infinitary Completeness in LudicsMichele Basaldella, Kazushige Terui. 294-303 [doi]
- On Strong Maximality of Paraconsistent Finite-Valued LogicsArnon Avron, Ofer Arieli, Anna Zamansky. 304-313 [doi]
- Probabilistic Information FlowMário S. Alvim, Miguel E. Andrés, Catuscia Palamidessi. 314-321 [doi]
- Weak Equivalences in Psi-CalculiMagnus Johansson, Jesper Bengtson, Joachim Parrow, Björn Victor. 322-331 [doi]
- A Calculus of Contracting ProcessesMassimo Bartoletti, Roberto Zunino. 332-341 [doi]
- On Probabilistic Automata in Continuous TimeChristian Eisentraut, Holger Hermanns, Lijun Zhang. 342-351 [doi]
- omega-QRB-Domains and the Probabilistic PowerdomainJean Goubault-Larrecq. 352-361 [doi]
- Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model ReductionVincent Danos, Jérôme Feret, Walter Fontana, Russell Harmer, Jean Krivine. 362-381 [doi]
- The Expressive Power of SynchronizationsCosimo Laneve, Antonio Vitale. 382-391 [doi]
- On the Expressivity of Symmetry in Event StructuresSam Staton, Glynn Winskel. 392-401 [doi]
- A Finiteness Structure on Resource TermsThomas Ehrhard. 402-410 [doi]
- A Sound and Complete Calculus for Finite Stream CircuitsStefan Milius. 421-430 [doi]