Abstract is missing.
- Learning Context-Free Grammars from Positive Data and Membership QueriesMakoto Kanazawa. 3-18 [doi]
- A Short Introduction to SHACL for LogiciansMagdalena Ortiz 0001. 19-32 [doi]
- From Gödel's Incompleteness Theorem to the Completeness of Bot Beliefs - (Extended Abstract)Dusko Pavlovic, Temra Pavlovic. 33-50 [doi]
- Quantitative Global MemorySandra Alves, Delia Kesner, Miguel Ramos 0002. 53-68 [doi]
- Effective SkolemizationMatthias Baaz, Anela Lolic. 69-82 [doi]
- Factive Complements are Not Always Unique Entities: A Case Study with Bangla rememberArka Banerjee. 83-100 [doi]
- Two-Layered Logics for Paraconsistent ProbabilitiesMarta Bílková, Sabine Frittella, Daniil Kozhemiachenko, Ondrej Majer. 101-117 [doi]
- An Axiom System for Basic Hybrid Logic with Propositional QuantifiersPatrick Blackburn, Torben Braüner, Julie Lundbak Kofod. 118-134 [doi]
- An Evidence Logic Perspective on Schotch-Jennings ForcingTyler Brunet, Gillman Payette. 135-160 [doi]
- A Separation Logic with Histories of Epistemic Actions as ResourcesHans van Ditmarsch, Didier Galmiche, Marta Gawek. 161-177 [doi]
- Conditional Obligations in Justification LogicFederico L. G. Faroldi, Atefeh Rohani, Thomas Studer. 178-193 [doi]
- Structural Completeness and Superintuitionistic Inquisitive LogicsThomas Ferguson, Vít Puncochár. 194-210 [doi]
- Validity in Choice Logics - A Game-Theoretic InvestigationRobert Freiman, Michael Bernreiter. 211-226 [doi]
- Aleatoric Propositions: Reasoning About CoinsTim French 0002. 227-243 [doi]
- Towards an Induction Principle for Nested Data TypesPeng Fu 0001, Peter Selinger. 244-255 [doi]
- A Principled Approach to Expectation Maximisation and Latent Dirichlet Allocation Using Jeffrey's Update RuleBart Jacobs 0001. 256-273 [doi]
- Parameterized Complexity of Propositional Inclusion and Independence LogicYasir Mahmood 0002, Jonni Virtema. 274-291 [doi]
- Parallelism in Realizability ModelsSatoshi Nakata. 292-304 [doi]
- Bisimulations Between Verbrugge Models and Veltman ModelsTin Perkov. 305-317 [doi]
- Focus-Style Proofs for the Two-Way Alternation-Free μ-CalculusJan Rooduijn, Yde Venema. 318-335 [doi]
- Relevant Reasoning and Implicit BeliefsIgor Sedlár, Pietro Vigiani. 336-350 [doi]
- Decidability of Modal Logics of Non-k-Colorable GraphsIlya Shapirovsky. 351-361 [doi]
- Subsumption-Linear Q-Resolution for QBF Theorem ProvingAllen Van Gelder. 362-376 [doi]
- Maximally Multi-focused Proofs for Skew Non-Commutative MILLNiccolò Veltri. 377-393 [doi]