Swiss Logic Gathering 2026

The Swiss Logic Gathering 2026 will take place on December 4 at the University of Bern in the main building, room 215. The address of the building is Hochschulstrasse 4, 3012 Bern, Schweiz.

Schedule

Time Speaker Title
14:00-14:40 Simon Guilloud, EPFL Lausanne Efficient Reasoning with Orthologic
14:40-15:20 Silvan Horvath, ETH Zürich LSD-systems and rank-into-rank embeddings
15:20-15:50 Coffee break  -
15:50-16:30 Djanira dos Santos Gomes and Rojo Randrianomentsoa, University of Bern Unbelievably complex
16:30-17:10 Benno Thalmann, University of Fribourg Formalizing Finite Automata and Büchi Automata in Isabelle/HOL
17:10-17:50 Simon Santschi, Czech Academy of Sciences Interpolation above S4

Abstracts

Efficient Reasoning with Orthologic

Simon Guilloud

Orthologic is a nonclassical propositional logic that supports conjunctions, disjunctions and negations. It is a weakening of classical logic obtained by dropping distributivity from the usual laws of Boolean algebra. Hence, every theorem of orthologic is a theorem of classical logic. Its practical appeal is that provability of a formula is always decidable in quadratic time, unlike classical and intuitionistic logic for which no polynomial algorithm is known. In this talk, I will introduce orthologic and its efficient decision procedure, then discuss extensions of the logic and recent applications to automated theorem proving and program verification.

LSD-systems and rank-into-rank embeddings

Silvan Horvath

A left self-distributive (or LSD) system is a set S with a binary operation * obeying the identity p(qr)=(pq)(pr). Natural instances of finite LSD systems are the so-called Laver tables, which were introduced by Richard Laver in the 1990s. Surprisingly, the answers to some very straightforward questions about these finite objects seem to require the assumption that there exists a non-trivial rank-into-rank embedding, which is among the strongest large cardinal properties not known to be inconsistent with ZFC.

Unbelievably complex

Djanira dos Santos Gomes and Rojo Randrianomentsoa

A new branch in distributed computing, which considers semantics for epistemic logics interpreted on simplicial complexes, has been widely explored as an alternative to epistemic logics with a relational semantics. Simplicial complexes shift the focus from global states for the set of all agents towards the local states of the individual agents. In simplicial complexes, global states (facets or maximal faces) are composed of local states (vertices) for all agents. Nevertheless, existing interpretations of belief on simplicial models do not use this locality in its fullness. In this talk, we will present the directed simplicial complex: this is an extension of a simplicial complex with a direction on its faces. This enables us to model a local notion of belief in a three-valued semantics, in which formulas may be true, false, or undefined.

Formalizing Finite Automata and Büchi Automata in Isabelle/HOL

Benno Thalmann

This talk presents an ongoing research project on the formalization of automata theory in the interactive theorem prover Isabelle/HOL. The project aims to develop a rigorous and reusable framework for finite automata and Büchi automata, including their fundamental properties, constructions, and relationships to other formal language representations.
For finite automata, the formalization covers key results such as determinization, equivalence with regular expressions and regular grammars, and automata minimization. The framework is further extended to Büchi automata, introducing infinite words, infinite runs, and acceptance conditions for ω-regular languages. The talk will provide an overview of the formalization approach, highlight selected results and their machine-checked proofs, and discuss current challenges and future directions of the project.

Interpolation above S4

Simon Santschi

Interpolation properties for logics are usually of the form: if "A entails B" is valid, then there exists an interpolant C involving only the 'subject matter' common to A and B such that "A entails C" and "C entails B" are valid. E.g., if A is a sentence about cows and sheep and B is a sentence about sheep and goats, then C is a sentence about sheep.

One of the most prominent interpolation property is the Craig interpolation property for propositional logics: for every valid implication "ϕ implies ψ", there exists an interpolant χ, using only atomic propositions that occur both in ϕ and ψ, such that "ϕ implies χ" and "χ implies ψ" are valid. In this talk, I will present a recent result about the Craig interpolation property for normal extensions of the modal logic S4. We will start with Craig interpolation for classical propositional logic, work our way up to the modal logic S4, and finally consider the new ideas behind our result about extensions of S4.

This is joint work with Niels C. Vooijs.