Abstract is missing.
- Model Construction for Modal ClausesUllrich Hustadt, Fabio Papacchini, Cláudia Nalon, Clare Dixon. 3-23 [doi]
- A Terminating Sequent Calculus for Intuitionistic Strong Löb Logic with the Subformula PropertyCamillo Fiorentini, Mauro Ferrari 0002. 24-42 [doi]
- Mechanised Uniform Interpolation for Modal Logics K, GL, and iSLHugo Férée, Iris van der Giessen, Sam van Gool, Ian Shillito. 43-60 [doi]
- Skolemisation for Intuitionistic Linear LogicAlessandro Bruni, Eike Ritter, Carsten Schürmann 0001. 61-77 [doi]
- Local Intuitionistic Modal Logics and Their CalculiPhilippe Balbiani, Han Gao, Çigdem Gencer, Nicola Olivetti. 78-96 [doi]
- Non-iterative Modal Resolution CalculiDirk Pattinson, Cláudia Nalon. 97-113 [doi]
- A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent SystemsHans van Ditmarsch, Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid 0001. 114-134 [doi]
- A Decision Method for First-Order Stream LogicHarald Ruess. 137-156 [doi]
- What Is Decidable in Separation Logic Beyond Progress, Connectivity and Establishment?Tanguy Bozec, Nicolas Peltier, Quentin Petitjean, Mihaela Sighireanu. 157-175 [doi]
- Sequents vs Hypersequents for Åqvist SystemsAgata Ciabattoni, Matteo Tesi. 176-195 [doi]
- Uniform Substitution for Differential Refinement LogicEnguerrand Prebet, André Platzer. 196-215 [doi]
- Sequent Systems on Undirected GraphsMatteo Acclavio. 216-236 [doi]
- A Proof Theory of (ømega-)Context-Free Languages, via Non-wellfounded ProofsAnupam Das 0002, Abhishek De 0001. 237-256 [doi]
- A Cyclic Proof System for Guarded Kleene Algebra with TestsJan Rooduijn, Dexter Kozen, Alexandra Silva 0001. 257-275 [doi]
- + Without the Top Concept Modulo Cycle-Restricted OntologiesFranz Baader, Oliver Fernández Gil. 279-297 [doi]
- Confluence of Logically Constrained Rewrite Systems RevisitedJonas Schöpf, Fabian Mitterwallner, Aart Middeldorp. 298-316 [doi]
- Equational Anti-unification over Absorption TheoriesMauricio Ayala-Rincón, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia. 317-337 [doi]
- The Benefits of DiligenceVictor Arrial, Giulio Guerrieri, Delia Kesner. 338-359 [doi]
- A Dependency Pair Framework for Relative Termination of Term RewritingJan-Christoph Kassing, Grigory Vartanyan, Jürgen Giesl. 360-380 [doi]
- Solving Quantitative EquationsGeorg Ehling, Temur Kutsia. 381-400 [doi]
- Equivalence Checking of Quantum Circuits by Model CountingJingyi Mei, Tim Coopmans, Marcello M. Bonsangue, Alfons Laarman. 401-421 [doi]