Schedule

Day 1

6 November

Keynotes are 1 hour, contributed talks 30 mins, including questions.

Times are in Brisbane local time.

Recordings of many of the talks are available on YouTube.

9:00 - 10:00

Extensions and limitations of the Specker-Blatter Theorem

Janos Makowsky (Keynote)

10:15 - 12:15

Towards compact semantics for intuitionistic provability logic

Jim de Groot & Ian Shillito

A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised

Ian Shillito

Modal Epistemic Lukasiewicz logic with application in immune systems

Ramaz Liparteliani

Resolution Calculi for non-normal modal logics

Dirk Pattinson

Break 12:15 - 14:00

14:00 - 15:00

Principles of Logics for Plausible Reasoning

David Billington

A modular bisimulation characterization theorem for hybrid propositional logic

Guillermo Badia, Daniel Gaina, Alex Knapp, Tomasz Kowalski & Martin Wirsing

15:15 - 16:15

Two logics for indicative conditionals

Paul Egre

Effective infinitesimals in R

Karel Hrbacek & Mikhail G. Katz

16:30 - 18:00

Day 2

7 November

09:00 - 10:00

A structure of punctual dimension n

Ellen Hammat [CANCELLED]

Recent developments in Set Theory with a Universal Set

Thomas Forster

10:15 - 12:15

On the first-order theory in graph products

Volker Diekert

On the complexity of epimorphism testing with virtually abelian targets

Murray Elder, Jerry Shen and Armin Weiß

An algebraic study of tense operators on Modal Pseudocomplemented De Morgan Algebras

Gustavo Pelaitay & Maia Starobinsky

Tense operators on distributive lattices with implication

Gustavo Pelaitay & William Zuluaga

Excursion (free afternoon)

Day 3

8 November

09:00 - 10:00

Improved decision procedures for multimodal tense (description) logic ALCI using CEGAR-tableaux

Raj Gore (Keynote)

10:15 - 12:15

Mechanised constructive reverse mathematics: soundness and completeness of bi-intuitionistic logic

Ian Shillito & Dominic Kirst

The Astounding Actuality of Medieval Logic

Wolfgang Lenzen

Non-compactness and converse well-foundedness

Ian Shillito

Building on propositional satisfiability, variations on a colorful theme

Tao He, Abdallah Saffidine, & Tiankuang (Ty) Zhang

Break 12:15 - 14:40

14:45 - 16:15

Supercongruences and MC-finiteness

Janos Makowsky

Approximate polynomial reasoning about resources

Luca Pasetto, Matteo Cristani, Francesco Olivieri, Guido Governatori, & Tewabe Chekole Workneh

Dynamic Superiorities in Defeasible Logic

Matteo Cristani, Francesco Olivieri & Guido Governatori

16:30 - 17:00

The Łoś-Tarski Theorem and Forbidden Induced Substructures

Jörg Flum & Yija Chen

17:00 - 18:00

An exposition of the compactness of 𝐿(𝑄cf)

Enrique Casanovas (Keynote)

Page updated

Google Sites

Report abuse

Schedule

6 November

Extensions and limitations of the Specker-Blatter Theorem

Towards compact semantics for intuitionistic provability logic

A new calculus for intuitionistic Strong Löb logic: strong termination and cut-elimination, formalised

Modal Epistemic Lukasiewicz logic with application in immune systems

Resolution Calculi for non-normal modal logics

Principles of Logics for Plausible Reasoning

A modular bisimulation characterization theorem for hybrid propositional logic

Two logics for indicative conditionals

Effective infinitesimals in R

Upper bounding substructural logics through well-quasi-orderings

Impossibilities in action

Introduction to the Quantified Argument Calculus

7 November

A structure of punctual dimension n

Recent developments in Set Theory with a Universal Set

On the first-order theory in graph products

An algebraic study of tense operators on Modal Pseudocomplemented De Morgan Algebras

Tense operators on distributive lattices with implication

8 November

Improved decision procedures for multimodal tense (description) logic ALCI using CEGAR-tableaux

Mechanised constructive reverse mathematics: soundness and completeness of bi-intuitionistic logic

The Astounding Actuality of Medieval Logic

Non-compactness and converse well-foundedness

Building on propositional satisfiability, variations on a colorful theme

Supercongruences and MC-finiteness

Approximate polynomial reasoning about resources

Dynamic Superiorities in Defeasible Logic

The Łoś-Tarski Theorem and Forbidden Induced Substructures

An exposition of the compactness of 𝐿(𝑄cf)