Abstract is missing.
- Justified and Common Knowledge: Limited ConservativityEvangelia Antonakos. 1-11 [doi]
- The Intensional Lambda CalculusSergei N. Artëmov, Eduardo Bonelli. 12-25 [doi]
- Generalized Non-deterministic Matrices and (n, k)-ary QuantifiersArnon Avron, Anna Zamansky. 26-40 [doi]
- Elementary Differential Calculus on Discrete and Hybrid StructuresHoward A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera. 41-53 [doi]
- Weighted Distributed Systems and Their LogicsBenedikt Bollig, Ingmar Meinecke. 54-68 [doi]
- Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier. 69-83 [doi]
- On Decidability and Expressiveness of Propositional Interval Neighborhood LogicsDavide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco. 84-99 [doi]
- Reasoning About Sequences of Memory StatesRémi Brochenin, Stéphane Demri, Étienne Lozes. 100-114 [doi]
- Cut Elimination in Deduction Modulo by Abstract CompletionGuillaume Burel, Claude Kirchner. 115-131 [doi]
- Density Elimination and Rational Completeness for First-Order LogicsAgata Ciabattoni, George Metcalfe. 132-146 [doi]
- Extracting the Resolution Algorithm from a Completeness Proof for the Propositional CalculusRobert L. Constable, Wojciech Moczydlowski. 147-161 [doi]
- Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion LogicsJennifer M. Davoren. 162-179 [doi]
- A Decidable Temporal Logic of Repeating ValuesStéphane Demri, Deepak D Souza, Régis Gascon. 180-194 [doi]
- Model Checking Knowledge and Linear Time: PSPACE CasesKai Engelhardt, Peter Gammie, Ron van der Meyden. 195-211 [doi]
- Realizations and LPMelvin Fitting. 212-223 [doi]
- Successive Abstractions of Hybrid Automata for Monotonic CTL Model CheckingRaffaella Gentilini, Klaus Schneider, B. Mishra. 224-240 [doi]
- Explicit Proofs in Formal Provability LogicEvan Goris. 241-253 [doi]
- A Synthesis Algorithm for Hybrid SystemsSrikanth Gottipati, Anil Nerode. 254-268 [doi]
- Including the Past in Topologic Bernhard Heinemann. 269-283 [doi]
- A Note on Rewriting Proofs and Fibonacci NumbersMax I. Kanovich. 284-292 [doi]
- On Complexity of Ehrenfeucht-Fraïssé GamesBakhadyr Khoussainov, Jiamou Liu. 293-309 [doi]
- The Law of the Iterated Logarithm for Algorithmically Random Brownian MotionBjørn Kjos-Hanssen, Anil Nerode. 310-317 [doi]
- Hypersequent Calculus for Intuitionistic Logic with Classical AtomsHidenori Kurokawa. 318-331 [doi]
- Proof Identity for Classical Logic: Generalizing to NormalityRoman Kuznets. 332-348 [doi]
- On the Constructive Dedekind Reals: Extended AbstractRobert S. Lubarsky, Michael Rathjen. 349-362 [doi]
- Verifying Balanced TreesZohar Manna, Henny B. Sipma, Ting Zhang. 363-378 [doi]
- Compactness Properties for Stable Semantics of Logic ProgramsVictor W. Marek, Jeffrey B. Remmel. 379-400 [doi]
- Uniform Circuits, & Boolean Proof NetsVirgile Mogbil, Vincent Rahli. 401-421 [doi]
- Finite Automata Presentable Abelian GroupsAndré Nies, Pavel Semukhin. 422-436 [doi]
- Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional LogicMichael O Connor. 437-448 [doi]
- Some Puzzles About Probability and Probabilistic ConditionalsRohit Parikh. 449-456 [doi]
- A Temporal Dynamic Logic for Verifying Hybrid System InvariantsAndré Platzer. 457-471 [doi]
- Multiplexor Categories and Models of Soft Linear LogicBrian F. Redmond. 472-485 [doi]
- Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding AlgorithmsVladimir V. Rybakov. 486-497 [doi]
- Total Public AnnouncementsDavid Steiner, Thomas Studer. 498-511 [doi]