Søren Brinck Knudstorp

activity

20242026

collaborators

5 papers

math.LO2026

The logic of bunched implications is undecidable

Nick Galatos, Peter Jipsen, Søren Brinck Knudstorp +1

The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close con…

math.LO2025

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$

Søren Brinck Knudstorp

It is a long-standing open problem whether modal logics of the form $K \oplus □^{n} p \to □^{m} p$ for $n > m > 1$ have the finite model property (FMP). We solve this by sho…

math.LO2025

Diamonds and Dominoes: Impossibility Results for Associative Modal Logics

Søren Brinck Knudstorp

We show that for any class of Boolean algebras with an associative operator, if it contains the complex algebra of (P(N), U), its equational theory is undecidable. Equivalently, an…

math.LO2025

Convex Team Logics

Aleksi Anttila, Søren Brinck Knudstorp

We prove expressive completeness results for convex propositional and modal team logics, where a logic is convex if, for each formula, if it is true in two teams $t$ and $u$ and $t…

math.LO2024

Tho Modal Logic of Minimal Upper Bounds

Søren Brinck Knudstorp

To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic (MIL), a modal logic over partial orders. In MIL, points are interpr…

The logic of bunched implications is undecidable

Knocking Down Boxes: The FMP for K⊕□m+kp→□mp

Diamonds and Dominoes: Impossibility Results for Associative Modal Logics

Convex Team Logics

Tho Modal Logic of Minimal Upper Bounds

Knocking Down Boxes: The FMP for $K \oplus □^{m + k} p \to □^{m} p$