Abstract is missing.
- Tableaux and Restricted Quantification for Systems Related to Weak Kleene LogicThomas Macaulay Ferguson. 3-19 [doi]
- Constraint Tableaux for Two-Dimensional Fuzzy LogicsMarta Bílková, Sabine Frittella, Daniil Kozhemiachenko. 20-37 [doi]
- Analytic Tableaux for Non-deterministic SemanticsLukas Grätz. 38-55 [doi]
- Tableaux for Free Logics with DescriptionsAndrzej Indrzejczak, Michal Zawidzki. 56-73 [doi]
- CEGAR-Tableaux: Improved Modal Satisfiability via Modal Clause-Learning and SATRajeev Goré, Cormac Kikkert. 74-91 [doi]
- Proof-Theory and Semantics for a Theory of Definite DescriptionsNils Kürbis. 95-111 [doi]
- Basing Sequent Systems on Exclusive-OrArnon Avron. 112-128 [doi]
- Proof Search on Bilateralist Judgments over Non-deterministic SemanticsVitor Greati, Sérgio Marcelino, João Marcos 0001. 129-146 [doi]
- From Input/Output Logics to Conditional Logics via Sequents - with ProversBjörn Lellmann. 147-164 [doi]
- Towards Finding Longer ProofsZsolt Zombori, Adrián Csiszárik, Henryk Michalewski, Cezary Kaliszyk, Josef Urban. 167-186 [doi]
- lazyCoP: Lazy Paramodulation Meets Neurally Guided SearchMichael Rawson, Giles Reger. 187-199 [doi]
- AC Simplifications and Closure Redundancies in the Superposition CalculusAndré Duarte 0002, Konstantin Korovin. 200-217 [doi]
- The Role of Entropy in Guiding a Connection ProverZsolt Zombori, Josef Urban, Miroslav Olsák. 218-235 [doi]
- The nanoCoP 2.0 Connection Provers for Classical, Intuitionistic and Modal LogicsJens Otten. 236-249 [doi]
- Eliminating Models During Model EliminationMichael Rawson, Giles Reger. 250-265 [doi]
- Learning Theorem Proving ComponentsKarel Chvalovský, Jan Jakubuv, Miroslav Olsák, Josef Urban. 266-278 [doi]
- A Formally Verified Cut-Elimination Procedure for Linear Nested Sequents for Tense LogicCaitlin D'Abrera, Jeremy E. Dawson, Rajeev Goré. 281-298 [doi]
- Cut-Elimination for Provability Logic by Terminating Proof-Search: Formalised and Deconstructed Using CoqRajeev Goré, Revantha Ramanayake, Ian Shillito. 299-313 [doi]
- Complexity of a Fragment of Infinitary Action Logic with Exponential via Non-well-founded ProofsStepan L. Kuznetsov. 317-334 [doi]
- Uniform Interpolation from Cyclic Proofs: The Case of Modal Mu-CalculusBahareh Afshari, Graham E. Leigh, Guillermo Menéndez Turata. 335-353 [doi]
- Cyclic Hypersequent Calculi for Some Modal Logics with the Master ModalityJan Rooduijn. 354-370 [doi]
- A Focus System for the Alternation-Free μ-CalculusJohannes Marti, Yde Venema. 371-388 [doi]
- Terminating Calculi and Countermodels for Constructive Modal LogicsTiziano Dalmonte, Charles Grellois, Nicola Olivetti. 391-408 [doi]
- Nested Sequents for Intuitionistic Modal Logics via Structural RefinementTim S. Lyon. 409-427 [doi]
- Game Semantics for Constructive Modal LogicMatteo Acclavio, Davide Catta, Lutz Straßburger. 428-445 [doi]
- The Došen Square Under Construction: A Tale of Four ModalitiesMichael Mendler, Stephan Scheele, Luke Burke. 446-465 [doi]