Schedule

Sunday, January 7
7:00 – 9:00pm Welcoming reception at a nearby restaurant “Oceans 234”, just north of the hotel on the beach
 
Monday, January 8
9:00 Registration table opens
9:45 – 10:00 Welcome remarks
10:00 – 11:00 Michael Fellows. The Evolution and Future of Parameterized Complexity. 
11:00 – 11:30 Richard Statman. Completeness of BCD for an operational semantics.
11:30 – 12:00 Coffee break
12:00 – 12:30 Liron Cohen and Arnon Avron. A Minimal Computational Theory of a Minimal Computational Universe.
12:30 – 1:00 Valeria de Paiva and Harley Eades III. Dialectica Categories for the Lambek Calculus. 
1:00 – 1:30 Silvia Ghilezan, Jelena Ivetić, Simona Kašterović, Zoran Ognjanović, and Nenad Savić. Probabilistic Reasoning About Simply Typed Lambda Terms. 
 
1:30 – 3:00 Lunch
 
3:00 – 3:30 Alexander Zapryagaev and Fedor Pakhomov. Interpretations of Presburger Arithmetic in Itself.
3:30 – 4:00 Agata Ciabattoni, Tim Lyon, and Revantha Ramanayake. From Display to Labelled Proofs for Tense Logics.
4:00 – 4:30 Junhua Yu. A Tableau System for Instantial Neighborhood Logic. 
4:30 – 5:00 Coffee break
5:00 – 5:30 Yanhong A. Liu and Scott D. Stoller. Founded Semantics and Constraint Semantics of Logic Rules.
5:30 – 6:00 Benjamin Ralph. A Natural Proof System for Herbrand’s Theorem.
6:00 – 6:30 Matthias Baaz, Alexander Leitsch, and Anela Lolic. A Sequent-Calculus Based Formulation of the Extended First Epsilon Theorem.
 
Tuesday, January 9
8:30 – 5:15  Outing to the Loxahatchee Wildlife Refuge https://www.fws.gov/refuge/arm_loxahatchee/
 
5:30 – 6:00 Refreshments
6:00 – 6:30 Robert S. Lubarsky. Separating the Fan Theorem and Its Weakenings II.
6:30 – 7:00 Hannes Diener and Robert Lubarsky. Notions of Cauchyness and Metastability.
7:00 – 7:30 Sam Sanders. Metastability and Higher-Order Computability.
 
Wednesday, January 10
 
9:30 – 10:00 Sergei Artemov. Justification Awareness Models.
10:00 – 10:30 Vladimir N. Krupski On the Sharpness and the Single-Conclusion Property of Basic Justification Models.
10:30 – 11:00 Antonis Achilleos. The Completeness Problem for Modal Logic.
11:00 – 11:30 Coffee break
11:30 – 12:00 Lev D. Beklemishev. A Universal Algebra for the Variable-Free Fragment of RC^\nabla. 
12:00 – 12:30 Thomas Macaulay Ferguson. A Gödel-Artemov-Style Analysis of Constructible Falsity.
12:30 – 1:00  V. Alexis Peluce. From Epistemic Paradox to Doxastic Arithmetic. 
 
1:00 – 2:30 Lunch
 
Nerode 85 Special Session.
 
2:30 – 2:40 Opening
2:40 – 3:30 Sergei Artemov. Revising Epistemic Logic.
3:30 – 4:20 Annie Liu. From Logic to Efficient Algorithms.
4:20 – 4:50 Coffee break
4:50 – 5:40 André Platzer. Logical Foundations of Cyber-Physical Systems. 
5:40 – 6:30 Sam Sanders. On the mathematical and foundational significance of the uncountable.
 
7:00 – 10:00 Conference Banquet at Le Val de Loire, http://le-val-de-loire.com/
 
Thursday, January 11
 
9:30 – 10:30 Phokion Kolaitis. Schema Mappings: A Meeting Point of Logic and Databases.
10:30 – 11:00 Kai Brünnler, Dandolo Flumini, and Thomas Studer. A Logic of Blockchain Updates. 
11:00 – 11:30 Coffee break
11:30 – 12:00 Simone Barlocco and Clemens Kupke. Angluin Learning via Logic.
12:00 – 12:30 Miika Hannula, Juha Kontinen, and Jonni Virtema. Polyteam Semantics.
12:30 – 1:00 Town Meeting