Accepted Papers

List of Papers at LFCS 20

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