Abstract is missing.
- Computability of Algebraic and Definable ClosureNathanael L. Ackerman, Cameron E. Freer, Rehana Patel. 1-11 [doi]
- Observable ModelsSergei N. Artëmov. 12-26 [doi]
- Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal LogicsTiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel. 27-46 [doi]
- Completeness Theorems for First-Order Logic Analysed in Constructive Type TheoryYannick Forster 0002, Dominik Kirst, Dominik Wehr. 47-74 [doi]
- On the Constructive Truth and Falsity in Peano ArithmeticHirohiko Kushida. 75-84 [doi]
- Belief Expansion in Subset ModelsEveline Lehmann, Thomas Studer. 85-97 [doi]
- Finitism, Imperative Programs and Primitive RecursionDaniel Leivant. 98-110 [doi]
- Knowledge of Uncertain Worlds: Programming with Logical ConstraintsYanhong A. Liu, Scott D. Stoller. 111-127 [doi]
- A Globally Sound Analytic Calculus for Henkin QuantifiersMatthias Baaz, Anela Lolic. 128-143 [doi]
- Feedback HyperjumpRobert S. Lubarsky. 144-155 [doi]
- Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested SequentsTim Lyon. 156-176 [doi]
- On Deriving Nested Calculi for Intuitionistic Logics from Semantic SystemsTim Lyon. 177-194 [doi]
- Parameterised Complexity of Abduction in Schaefer's FrameworkYasir Mahmood 0002, Arne Meier, Johannes Schmidt 0001. 195-213 [doi]
- Tracking Computability of GPAC-Generable FunctionsDiogo Poças, Jeffery I. Zucker. 214-235 [doi]
- Modal Type Theory Based on the Intuitionistic Modal Logic $\mathbf{IEL}^{-}$Daniel Rogozin. 236-248 [doi]
- Lifting Recursive Counterexamples to Higher-Order ArithmeticSam Sanders. 249-267 [doi]
- On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem Under Semantic Tableaux DeductionDan E. Willard. 268-286 [doi]