Abstract is missing.
- Conversation and GamesNicholas Asher, Soumya Paul. 1-18 [doi]
- Ramsey Theory on Trees and ApplicationsNatasha Dobrinen. 19-22 [doi]
- Automata, Logic and Games for the λ-CalculusC.-H. Luke Ong. 23-26 [doi]
- Semantics and Proof Theory of the Epsilon CalculusRichard Zach. 27-47 [doi]
- Neighbourhood Contingency BisimulationZeinab Bakhtiari, Hans van Ditmarsch, Helle Hvid Hansen. 48-63 [doi]
- The Complexity of Finding Read-Once NAE-Resolution RefutationsHans Kleine Büning, Piotr J. Wojciechowski, K. Subramani. 64-76 [doi]
- Knowing Values and Public InspectionJan van Eijck, Malvin Gattinger, Yanjing Wang. 77-90 [doi]
- Random Models for Evaluating Efficient Büchi Universality CheckingCorey Fisher, Seth Fogarty, Moshe Y. Vardi. 91-105 [doi]
- A Substructural Epistemic Resource LogicDidier Galmiche, Pierre Kimmel, David J. Pym. 106-122 [doi]
- Deriving Natural Deduction Rules from Truth TablesHerman Geuvers, Tonny Hurkens. 123-138 [doi]
- A Semantic Analysis of Stone and Dual Stone Negations with RegularityArun Kumar, Mohua Banerjee. 139-153 [doi]
- Achieving While Maintaining: - A Logic of Knowing How with Intermediate ConstraintsYanjun Li, Yanjing Wang. 154-167 [doi]
- Peirce's Sequent Proofs of DistributivityMinghui Ma, Ahti-Veikko Pietarinen. 168-182 [doi]
- On Semantic GamificationIgnacio Ojea Quintana. 183-197 [doi]
- Ancient Indian Logic and AnalogyJeff B. Paris, Alena Vencovská. 198-210 [doi]
- Definability of Recursive Predicates in the Induced Subgraph OrderRamanathan S. Thinniyam. 211-223 [doi]
- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham LogicPrzemyslaw Andrzej Walega. 224-238 [doi]