Schedule

Sunday, January 3
7:00 – 9:00 pm Welcoming reception at a nearby restaurant “Oceans 234”, just north of the hotel on the beach.

Monday, January 4
9:00 Registration table opens
9:45 – 10:00 Welcoming remarks
10:00 – 11:00 Invited talk: Andre Scedrov. Multiset Rewriting with Dense Time and the Analysis of Cyber-Physical Security Protocols
11:00 – 11:30 Max Kanovich, Stepan Kuznetsov and Andre Scedrov. On Lambek’s Restriction in the Presence of Exponential Modalities
11:30 – 12:00 Coffee break
12:00 – 12:30 Harley Eades Iii and Valeria de Paiva. Multiple Conclusion Linear Logic: Cut Elimination and more
12:30 – 13:00 Richard Statman. Levy labels and recursive types
13:00 – 2:30 Lunch
2:30 – 3:00 Ioannis Kokkinis, Zoran Ognjanovic and Thomas Studer. Probabilistic Justification Logic
3:00 – 3:30 Vladimir Krupski and Alexey Yatmanov. Sequent Calculus for Intuitionistic Epistemic Logic IEL
3:30 – 4:00 Tudor Protopopescu. An Arithmetical Interpretation of Verification and Intuitionistic Knowledge
4:00 – 4:30 Coffee break
4:30 – 5:00 Sergei Artemov. On Aggregating Probabilistic Evidence
5:00 – 5:30 Roman Kuznets. Interpolation Method for Multicomponent Sequent Calculi
5:30 – 6:00 Evangelia Antonakos. Pairing Traditional and Generic Common Knowledge

Tuesday, January 5
9:00 – 3:00  Outing to the Morikami Gardens
4:00 – 4:30 Coffee break
4:30 – 5:00 Robert Lubarsky. Parallel Feedback Turing Computability
5:00 – 5:30 Marco Devesas Campos and Marcelo Fiore. Classical Logic with Mendler Induction—A Dual Calculus and its Strong Normalization
5:30 – 6:00 R. Ramanujam, Vaishnavi Sundararajan and S.P. Suresh. Complexity of fragments of intuitionistic logic with disjunction

Wednesday, January 6
9:30 – 10:00 Shoshin Nomura, Hiroakira Ono and Katsuhiko Sano. A Cut-free Labelled Sequent Calculus for Dynamic Epistemic Logic
10:00 – 10:30 Bernhard Heinemann. Augmenting Subset Spaces to Cope with Multi-Agent Knowledge
10:30 – 11:00 Antonis Achilleos. Modal Logics with Hard Diamond-free Fragment
11:00 – 11:30 Coffee break
11:30 – 12:00 Scott Messick. Compactness in the Theory of Continuous Automata
12:00 – 12:30 Douglas Cenzer, Jeffrey Remmel and Victor Marek. Index sets for finite normal predicate logic programs with function symbols
12:30 – 13:00 Nathanaël Fijalkow. The Online Complexity of Probabilistic Languages
13:00 – 2:30 Lunch
2:30 – 3:00 Matteo Mio and Henryk Michalewski. Measure Quantifier in Monadic Second Order Logic
3:00 – 3:30 Daniel R. Licata and Michael Shulman. Adjoint logic with a 2-category of modes
3:30 – 4:00 Iosif Petrakis. The Urysohn Extension Theorem for Bishop Spaces
4:00 – 4:30 Coffee break
4:30 – 5:00 R. Ramanujam and Ramanathan S. Thinniyam. Definability in First Order Theories of Graph Orderings
5:00 – 5:30 Alexey Sorokin. Ogden property for linear displacement context-free grammars
5:30 – 6:00 Henrik Forssell, Håkon Gylterud and David I. Spivak. Type theoretical databases
7:00 – 10:00 Conference Banquet

Thursday, January 7
10:00 – 11:00 Invited talk: Steve Awodey. Cubical Homotopy Type Theory
11:00 – 12:00 Farewell coffee break and LFCS Town Hall Meeting