Non-Distributive Modal Logic via Compatibility and Accessibility Relations

You are reading version 1 of this direction, frozen 2026-10-04. The latest version is version 2.

Version 1 of 29 papers20 conceptsfrozen 2026-10-04

In classical modal logic, we typically assume that the underlying world follows the rules of Boolean algebra. One of the most rigid of these rules is distributivity: the principle that "A and (B or C)" is exactly the same as "(A and B) or (A and C)."

While this seems like common sense, it turns out to be a major roadblock when modeling certain complex systems, such as quantum mechanics or the nuances of natural language. Recent research led by Wesley H. Holliday and colleagues suggests that by relaxing this distributive requirement and rebuilding modal logic on more general algebraic structures—specifically non-distributive lattices—we can solve long-standing paradoxes in linguistics and philosophy.

The Failure of Distributivity

The core motivation for this research direction is that classical logic often over-constrains how we reason about uncertainty. In The Orthologic of Epistemic Modals, Matthew Mandelkern and Wesley H. Holliday highlight a linguistic puzzle known as "Wittgenstein sentences." Consider the statement: "It is raining, but it might not be."

To a human, this sounds like a contradiction. However, in standard classical modal logic, "might" is treated as a possibility operator ($\Diamond$). If we don't know for certain it's raining, "it might not be raining" is true, even if it actually is raining. Classical logic struggles to treat this as a genuine contradiction without collapsing the distinction between what is possible and what is true.

The researchers argue that the culprit is the distributive law. By moving to ortholattices—structures where negation behaves differently and distributivity is not guaranteed—they create a logic where these epistemic contradictions are formally recognized as false, matching human intuition.

Building Lattices from Compatibility

If we move away from Boolean algebras, how do we represent the "meaning" of a statement? Standard Kripke semantics use sets of possible worlds. In the non-distributive world, Wesley H. Holliday introduces a more flexible framework in Compatibility and accessibility: lattice representation for semantics of non-classical and modal logics.

The framework relies on two distinct relations:

  1. Compatibility ($\perp$): A relation between states that determines the structure of the lattice itself (how negation and disjunction work).
  2. Accessibility ($R$): The traditional relation used to define modal operators like necessity ($\Box$) and possibility ($\Diamond$).

By separating these two, Holliday shows that we can represent any complete lattice—not just Boolean ones. This allows modal operators to be embedded into intuitionistic or even quantum logics, where the distributive law is famously invalid.

Toward a Fundamental Logic

This shift isn't just about fixing specific puzzles; it’s about finding a "base" for all logic. In A fundamental non-classical logic, Wesley H. Holliday proposes a "fundamental logic" built solely on the introduction and elimination rules of connectives.

By stripping away "controversial" axioms like double-negation elimination and distributivity, this logic serves as a neutral foundation. It is strong enough to be useful but broad enough to encompass classical, intuitionistic, and quantum systems as specific cases. In Modal Logic, Fundamentally, Holliday demonstrates that even in these extremely stripped-down non-distributive settings, $\Box$ and $\Diamond$ can still be represented using a single accessibility relation, preserving the core of what makes modal logic work.

Formalizing the Framework

To ensure these new logics are as mathematically robust as classical ones, researchers are extending foundational theorems to the non-distributive case. In Toward the van Benthem Characterization Theorem for Non-Distributive Modal Logic, Krishna Manoorkar, Mattia Panettiere, and Ruoding Wang develop new definitions for bisimulation.

Bisimulation is the standard way to tell if two modal models are "the same." By proving the Hennessy-Milner and van Benthem theorems for non-distributive logic, they show that these systems aren't just niche abstractions—they are mathematically rigorous fragments of first-order logic, just like their classical counterparts.

Why It Works

The intuition behind this research is that logical paradoxes are often symptoms of over-constrained systems. By treating the distributive law as an optional feature rather than a universal requirement, these researchers have created a framework that:

  • Aligns with Natural Language: Resolves epistemic contradictions that classical logic cannot handle (Holliday, Mandelkern).
  • Unifies Diverse Logics: Provides a single mathematical language (compatibility frames) for classical, intuitionistic, and quantum systems (Holliday).
  • Maintains Rigor: Supports the same level of model-theoretic analysis as standard modal logic (Manoorkar et al.).

Papers in this version

History & citationVersion 2 · 2026-10-04

Current · Permanent link

  1. Version 2 (latest) · 2026-10-04 · 7 papers
  2. Version 1 · 2026-10-04 · 9 papers
Cite this direction

Latest version (a living page):

@misc{lacuna_non_distributive_semantics_7751501c,
  title = {non-distributive semantics},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/non-distributive-semantics/rdr_7751501c75954eeb983fd4fec7b70f0f},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_non_distributive_modal_logic_via_compati_7751501c_v1,
  title = {Non-Distributive Modal Logic via Compatibility and Accessibility Relations},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/non-distributive-modal-logic-via-compatibility-and-accessibility-relations/rdr_7751501c75954eeb983fd4fec7b70f0f/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}