List of Papers at LFCS 20
- Nathanael Ackerman, Cameron Freer and Rehana Patel. Computability of Algebraic and Definable Closure
- Sergei Artemov. Epistemic Modeling with Unknown Worlds
- Tiziano Dalmonte, Bjoern Lellmann, Nicola Olivetti and Elaine Pimentel. Countermodel construction via optimal hypersequent calculi for non-normal modal logics
- Yannick Forster, Dominik Kirst and Dominik Wehr. Completeness Theorems for First-Order Logic Analysed in Constructive Type Theory
- Hirohiko Kushida. On the Constructive Truth and Falsity in Peano Arithmetic
- Eveline Lehmann and Thomas Studer. Belief expansion in subset models
- Daniel Leivant. Finitism, concrete programs and primitive recursion
- Yanhong A. Liu and Scott Stoller. Knowledge of Uncertain Worlds: Programming with Logical Constraints
- Anela Lolic and Matthias Baaz. A Globally Sound Analytic Calculus for Henkin Quantifiers
- Robert Lubarsky. Feedback Hyperjump
- Tim Lyon. Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents
- Tim Lyon. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems
- Yasir Mahmood, Arne Meier and Johannes Schmidt. Parameterised Complexity of Abduction in Schaefer’s Framework
- Diogo Poças and Jeffery Zucker. Tracking computability of GPAC-generable functions
- Daniel Rogozin. Modal type theory based on the intuitionistic modal logic IEL^-
- Sam Sanders. Lifting recursive counterexamples to higher-order arithmetic
- Dan Willard. On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction