2000 character limit reached
Positive Modal Logic Beyond Distributivity
Published 28 Apr 2022 in math.LO and cs.LO | (2204.13401v3)
Abstract: We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka duality for meet-semilattices. We introduce the notion of $\Pi_1$-persistence and show that every weak positive modal logic is $\Pi_1$-persistent. This approach leads to a new relational semantics for weak positive modal logic, for which we prove an analogue of Sahlqvist correspondence result.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.