Søren Brinck Knudstorp

activity

20242026

collaborators

7 papers

math.LO2026

Possibly Relevant Translations

SÃ¸ren Brinck Knudstorp

We develop translations from relevant logics into normal modal logics, and use them to clarify structural connections between relevant and modal logic, obtain a few corollary resul…

math.LO2026

Undecidability in Relevant Logic

SÃ¸ren Brinck Knudstorp

We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the sem…

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…

Possibly Relevant Translations

Undecidability in Relevant Logic

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

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