Schedule – Logical Foundations Of Computer Science

9:00 Registration table opens
9:45 – 10:00 Welcome remarks.
10:00 – 11:00 Invited Lecture: Andre Platzer. Cyber-Physical Systems Verification with KeYmaera X.
11:00 – 11:30 Daniel Levant. Finitism, Concrete Programs and Primitive Recursion.
11:30 – 12:00 Coffee Break.
12:00 – 12:30 Sergei Artemov. Observable Models.
12:30 – 1:00 Eveline Lehmann and Thomas Studer. Belief Expansion in Subset Models.
1:00 – 1:30 Yanhong A. Liu and Scott Stoller. Knowledge of Uncertain Worlds: Programming with Logical Constraints.
1:30 – 3:00 Lunch.
3:00 – 6:00 Round Table/Panel Discussion on Logical Foundations of Computer Science:
Anil Nerode (Cornell), Andre Scedrov (UPenn), Carl Hewitt (MIT), Daniel Leivant (U of Indiana), Matthias Baaz (TU Vienna).

9:00 – 4:00 Outing in Morikami Gardens https://morikami.org/
4:00 – 6:30 Special Session on Jeff Remmel and Gerald Sacks:
Anil Nerode, Victor Marek, Valentina Harizanov, Douglas Cenzer, and Nick Loehr.
(refreshments)

9:30 – 10:30 Invited Lecture: Thomas Studer. On the proof theory of common knowledge.
10:30 – 11:00 Sam Sanders. Lifting Recursive Counterexamples to Higher-Order Arithmetic.
11:00 – 11:30 Coffee break.
11:30 – 12:00 Nathanael Ackerman, Cameron Freer, and Rehana Patel. Computability of Algebraic and Definable Closure.
12:00 – 12:30 Yannick Forster, Dominik Kirst, and Dominik Wehr. Completeness Theorems for First-Order Logic Analyzed in Constructive Type Theory.
12:30 – 1:00 Robert Lubarsky. Feedback Hyperjump.
1:00 – 2:30 Lunch.
2:30 – 3:00 Hirohiko Kushida. On the Constructive Truth and Falsity in Peano Arithmetic. (The Rosser Prize talk)
3:00 – 3:30 Tim Lyon. Syntactic Cut-Elimination for Intuitionistic Fuzzy Logic via Linear Nested Sequents.
3:30 – 4:00 Matthias Baaz and Anela Lolic. A Globally Sound Analytic Calculus for Henkin Quantifiers.
4:00 – 4:30 Coffee break.
4:30 – 5:00 Tiziano Dalmonte, Bjoern Lellmann, Nicola Olivetti, and Elaine Pimentel. Countermodel Construction via Optimal Hypersequent Calculi for Non-Normal Modal Logics.
5:00 – 5:30 Tim Lyon. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.
5:30 – 6:00 Yasir Mahmood, Arne Meier, and Johannes Schmidt. Parameterised Complexity of Abduction in Schaefer’s Framework.
7:00 – 10:00 Conference Banquet at Le Val de Loire.

9:30 – 10:00 Daniel Rogozin. Modal type theory based on the intuitionistic modal logic IEL^-.
10:00 – 10:30 Dan Willard. On the Tender Line Separating Generalizations and Boundary-Case Exceptions for the Second Incompleteness Theorem under Semantic Tableaux Deduction.
10:30 – 11:00 Diogo Poças and Jeffery Zucker. Tracking Computability of GPAC-Generable Functions.
11:00 – 12 noon Coffee Break, Town Meeting/Closure.