🔢 mathematics

Modal Measurable Logics via a Modal Loomis-Sikorski Representation Theorem

This paper introduces modal measurable logics as a modal extension of infinitary classical logic tailored for measure-theoretic applications in dynamical systems and point-free ergodic theory, and establishes their completeness with respect to a new Kripke-like semantics on measurable spaces by leveraging a modal extension of the Loomis-Sikorski theorem and restricted Jonsson-Tarski duality.

Original authors: Nick Bezhanishvili, Jim de Groot, Lawrence S. Moss

Published 2026-07-01

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Nick Bezhanishvili, Jim de Groot, Lawrence S. Moss

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to describe a complex, shifting world using a language of logic. Usually, logicians use "Kripke frames," which are like maps made of dots (points) and arrows (connections) to show how things relate to one another.

This paper introduces a new way to build these maps, specifically for worlds that are "measurable"—think of them as worlds where you can measure things like probability, area, or time, rather than just counting discrete dots. The authors, Bezhanishvili, de Groot, and Moss, are trying to create a logic that works perfectly with these measurable worlds, especially for studying things that change over time (dynamical systems).

Here is the breakdown of their work using simple analogies:

1. The Problem: The "Fuzzy" Map

In standard logic, if you have a list of infinite items, you can easily say "the union of all these items" (putting them all together) or "the intersection" (what they all have in common).

However, when you try to do this with measurable spaces (like a map of a city where you care about the area of neighborhoods rather than just the specific houses), things get messy.

The Issue: If you take an infinite list of measurable neighborhoods and combine them, the result might not be a clean, measurable neighborhood anymore. It might become "fuzzy" or undefined in the strict mathematical sense.
The Consequence: The standard logic tools break down because they assume everything stays perfectly clean and measurable.

2. The Solution: The "Loomis-Sikorski" Magic Trick

To fix this, the authors use a famous mathematical idea called the Loomis-Sikorski theorem.

The Analogy: Imagine you have a perfect, abstract blueprint of a city (an "abstract algebra"). You want to build a real city based on it, but you keep running into construction errors where the math doesn't add up.
The Trick: The theorem says, "Don't worry about the errors in the real city. Instead, build a perfect concrete city, and then declare a specific list of 'construction errors' (called a $\sigma$ -ideal) to be null."
What "Null" Means: Think of "null" as "invisible" or "doesn't count." If a part of the city is a "null set" (like a single point on a map, which has zero area), we pretend it doesn't exist. By ignoring these tiny, problematic bits, the abstract blueprint and the concrete city become perfect matches.

3. The New Logic: "Modal Measurable Logics"

The authors created a new language (logic) to talk about these worlds.

The Language: It allows for infinite lists of "and" and "or" statements (countable meets and joins).
The Special Rule (IDC): They added a special rule called the Infinite Descending Chain (IDC) rule.
- Imagine: You have a stack of boxes getting smaller and smaller forever. If the boxes eventually disappear completely (become empty), then the "shadow" cast by those boxes must also disappear. This rule ensures the logic behaves correctly when dealing with infinite shrinking sets.

4. The New Semantics: "Marked Modal Measurable Spaces"

They didn't just invent the language; they built a new way to interpret it, called Marked Modal Measurable Spaces.

The Setup: Picture a map (a measurable space) with arrows connecting points (a relation).
The "Mark": They add a special list of "Null Sets" (the designated errors/invisible parts) to the map.
How it Works: When you evaluate a statement on this map, you don't care if it's true on the "invisible" parts. You only care if it's true everywhere except the null sets. It's like grading a test where you ignore the scribbles in the margins; if the answer is correct in the main body, it counts as correct.

5. The Big Achievement: The "Completeness" Proof

The main goal of the paper was to prove that their new logic is complete.

What "Complete" Means: It means that if a statement is true in every possible "Marked Modal Measurable Space" (every possible valid map with null sets), then our logic system can actually prove that statement. There are no "true" facts that the logic misses.
The Method: They proved this by showing that any abstract logical system can be transformed into one of these concrete "Marked Spaces" (using their Modal Loomis-Sikorski theorem). Since the logic works on the abstract side, and the abstract side is just a "shadow" of the concrete side, the logic must work on the concrete side too.

Summary

The authors built a bridge between abstract math and concrete measurement.

They noticed that standard logic struggles with infinite measurements.
They invented a new logic with a special rule to handle infinite shrinking sets.
They created a new way to view these worlds by ignoring "null" (invisible) errors.
They proved that this new logic is perfect: it can prove everything that is true in these measurable worlds.

What they explicitly say this is for:
They state this is a foundation for studying measure-based dynamical systems and point-free ergodic theory. In plain English, this means they are building the mathematical tools to better understand how things change and move over time in systems defined by probability and measurement, without getting stuck on the tiny, unmeasurable details. They do not claim this is for clinical use or specific real-world applications yet; it is purely a theoretical framework for mathematicians and logicians.

Technical Summary: Modal Measurable Logics via a Modal Loomis-Sikorski Representation Theorem

Problem Statement
The paper addresses the challenge of developing a modal logic formalism for reasoning about relational structures based on measurable spaces, specifically targeting applications in measure-theoretic work within dynamical systems and point-free ergodic theory. While standard modal logics (like $K$ ) have well-established algebraic and Kripke semantics, extending these to infinitary logics with countable meets and joins ( $\sigma$ -modal logics) presents a gap. Specifically, existing order-topological representations (via Jónsson-Tarski duality) interpret countable meets and joins as interiors of intersections and closures of unions, respectively. This fails to provide a "concrete" representation where these operations correspond to actual set-theoretic intersections and unions within a $\sigma$ -algebra. Furthermore, standard Kripke semantics over measurable spaces does not naturally accommodate the quotienting by null-sets that is central to measure-theoretic approaches (e.g., in ergodic theory, where null-sets are often "deleted" to form a point-free abstraction).

Methodology
The authors proceed through a structured development of algebraic and semantic frameworks:

Logic Definition: They define a language $\mathcal{L}_\sigma$ with countable meets and joins and a unary modal operator $\Diamond$ that distributes over countable joins. They introduce two logics:
- $K_\sigma$ : The extension of classical modal logic $K$ with countable joins/meets and the distribution axiom.
- Modal Loomis-Sikorski Logic (MLS): An extension of $K_\sigma$ with an additional infinitary rule, the Infinite Descending Chain (IDC) rule. This rule states that if a countable descending chain of formulas $\varphi_n$ has an empty meet, then the meet of their diamonds is also empty.
Algebraic Semantics:
- $\sigma$ -Modal Algebras: Boolean algebras with countable joins/meets and a $\Diamond$ operator preserving countable joins.
- Measurable $\sigma$ -Modal Algebras: $\sigma$ -modal algebras satisfying an additional condition dual to the IDC rule: for any countable descending chain $b_n$ , if $\bigwedge b_n = \bot$ , then $\bigwedge \Diamond b_n = \bot$ .
- The authors prove that $K_\sigma$ is sound and complete with respect to $\sigma$ -modal algebras, and MLS is sound and complete with respect to measurable $\sigma$ -modal algebras using standard Lindenbaum-Tarski constructions.
Duality and Representation:
- Jónsson-Tarski Restriction: They restrict the classical Jónsson-Tarski duality to $\sigma$ -modal algebras, establishing a dual equivalence between measurable $\sigma$ -modal algebras and measurable $\sigma$ -modal spaces (Stone spaces where the accessibility relation preserves Baire null-sets). However, they note this duality does not yield completeness with respect to concrete measurable spaces because the topological operations (interior/closure) do not match set-theoretic operations.
- Modal Loomis-Sikorski Theorem: To bridge the gap to concrete measurable spaces, the authors prove a modal analogue of the Loomis-Sikorski theorem. This theorem states that every measurable $\sigma$ -modal algebra is isomorphic to the quotient of a "concrete" $\sigma$ -modal algebra (a $\sigma$ -field of sets) by a modal $\sigma$ -ideal.
New Semantics (Marked Modal Measurable Spaces):
- They introduce marked modal measurable spaces (mmm-spaces), defined as tuples $(X, R, \Sigma, N)$ , where $(X, R, \Sigma)$ is a modal measurable space and $N$ is a modal $\sigma$ -ideal of "designated null-sets."
- Formulas are interpreted in the quotient algebra $(\Sigma, \Diamond)/N$ . This aligns with the "point-free" approach in ergodic theory where null-sets are factored out.

Key Contributions and Results

Definition of Modal Measurable Logics: The paper formalizes $K_\sigma$ and MLS, introducing the necessary IDC rule to capture the behavior of measurable spaces modulo null-sets.
Modal Loomis-Sikorski Theorem: The central technical contribution is the proof that every measurable $\sigma$ -modal algebra is a quotient of a concrete $\sigma$ -modal algebra by a modal $\sigma$ -ideal. This relies on the construction of modal Baire sets and the identification of modal Baire null-sets as a modal $\sigma$ -ideal.
Completeness Theorem: The authors prove that MLS (and its axiomatic extensions) is sound and complete with respect to the class of marked modal measurable spaces. This is achieved by combining the algebraic completeness of MLS with the Modal Loomis-Sikorski representation theorem.
Characterization of Validity: They characterize the validity of the IDC rule in terms of "pointwise measurable compactness" in standard modal measurable spaces (without the ideal quotient), showing that without the ideal quotient, the logic is not complete with respect to all such spaces.

Significance and Claims
The paper claims to lay the foundation for a modal logic approach to measure-based dynamical systems and point-free ergodic theory. By providing a completeness theorem for infinitary modal logics with respect to semantics that explicitly incorporate null-sets (via the quotient by a $\sigma$ -ideal), the work offers a formal framework that mirrors the "point-free" abstraction used in modern ergodic theory (citing works by Jamneshan, Tao, and others).

The authors position this work as a "necessary step" toward a more comprehensive framework that would eventually combine measure-theoretic spaces with probabilistic transition relations. They explicitly state that their current framework uses standard Kripke semantics based on measurable spaces rather than probabilistic transitions (unlike coalgebraic approaches using probability functors). The paper concludes by identifying future research directions, including generalizing these results to distributive lattices and Heyting algebras to develop constructive measure theory, and investigating the integration of explicit probability into the framework.