arxiv: 2605.14182 · v1 · submitted 2026-05-13 · 🧮 math.LO

Recognition: 2 theorem links

· Lean Theorem

The modal theory of linear orders

Wojciech Aleksander Wo{\l}oszyn

Authors on Pith no claims yet

Pith reviewed 2026-05-15 01:46 UTC · model grok-4.3

classification 🧮 math.LO

keywords modal logiclinear ordersembeddingsmonotone mapscondensationsscatterednessmodal definabilitypropositional modal logic

0 comments

The pith

Modal logic on linear orders allows elimination of modalities under embeddings and monotone maps, while condensations render scatteredness definable.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper investigates the modal theory of linear orders interpreted under four classes of maps: embeddings, monotone maps, condensations, and end-extensions. It establishes modality elimination results showing that modal operators can be removed when reasoning about embeddings and monotone maps between such orders. Condensations are shown to make the property of scatteredness expressible by a modal formula. Exact propositional modal validities are then computed for the principal cases arising from these interpretations.

Core claim

Modality elimination holds for embeddings and monotone maps on linear orders; condensations make scatteredness modally definable; and the exact propositional modal validities are determined for the main cases under the listed map classes.

What carries the argument

Kripke semantics for propositional modal logic on linear orders, with the operations of embeddings, monotone maps, condensations, and end-extensions serving as the relational interpretations.

If this is right

Scattered linear orders become distinguishable from non-scattered ones by a single modal formula when using condensations.
Propositional modal validities coincide exactly with the logics computed for embeddings and for monotone maps in the main cases.
End-extensions preserve certain modal properties that embeddings and monotone maps eliminate.
Modal definability results extend to classification of linear orders up to the considered maps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Similar elimination techniques might apply to other relational structures such as trees or partial orders under analogous maps.
The definability of scatteredness via condensations suggests a route to modal axiomatizations of well-foundedness properties in orders.
Computed validities could serve as a baseline for comparing modal logics across different classes of ordered structures.

Load-bearing premise

Standard Kripke semantics on linear orders together with the listed map classes suffice to capture the intended modal behavior without hidden assumptions about the underlying orders or the modal language.

What would settle it

A specific linear order and embedding (or monotone map) where a modal formula is preserved yet cannot be reduced to a modality-free equivalent, or a condensation that fails to define scatteredness by any modal sentence.

Figures

Figures reproduced from arXiv: 2605.14182 by Wojciech Aleksander Wo{\l}oszyn.

**Figure 1.** Figure 1: Examples of ordered partitions of a 4-element set as satisfiable patterns of equalities and strict inequalities in a linear order: dots are variables, monochromatic regions indicate equalities, and the left-to-right order of regions encodes the required <-relations. There is also a natural coarseness order on ordered partitions. Given ordered partitions P and Q, we write P ≼ Q if Q is obtained from P by m… view at source ↗

**Figure 2.** Figure 2: Coarseness for ordered partitions: P ≼ Q if and only if Q is obtained by merging adjacent blocks of P. This coarseness relation is the reason ordered partitions are useful for monotone maps. In the category of linear orders and monotone maps, and likewise for condensations, P ≼ Q says exactly that a tuple realizing P can be sent by an accessibility mapping to a tuple realizing Q; the map may identify adjac… view at source ↗

read the original abstract

I study the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. I prove modality elimination for embeddings and monotone maps, show that condensations make scatteredness modally definable, and compute exact propositional modal validities in the main cases.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper cleanly proves modality elimination for embeddings and monotone maps on linear orders and shows scatteredness is modally definable via condensations, with some validity computations that look fresh but rest on standard semantics.

read the letter

The main things here are the modality elimination proofs for embeddings and monotone maps, plus the result that condensations make scatteredness definable in the modal language. Those feel like the actual new pieces. The validity computations for the main classes of maps are also spelled out explicitly, which is useful for anyone working in modal logic on orders. The paper sticks to standard Kripke semantics over linear orders and the listed map classes, so the setup is straightforward and avoids hidden assumptions that would complicate things. What it does well is keep the statements precise and separate the cases by map type without overclaiming broader impact. The proofs are presented as direct from the semantics, and there is no sign of circularity or post-hoc fitting. Soft spots are minor: the validity results would benefit from a bit more comparison to existing work on modal definability in orders, just to make the exact contribution clearer, and the end-extension case gets less attention than the others. Nothing looks load-bearing or broken. This is for people already in modal logic or order theory who care about expressivity under structure-preserving maps. A reader who knows the basics of Kripke frames on linear orders will get value from the elimination and definability theorems. It deserves a serious referee because the claims are specific, the methods are standard but applied cleanly, and the results are checkable in principle. I would send it to review rather than desk reject.

Referee Report

0 major / 3 minor

Summary. The paper studies the modal theory of linear orders under embeddings, monotone maps, condensations, and end-extensions. It proves modality elimination for embeddings and monotone maps, shows that condensations make scatteredness modally definable, and computes exact propositional modal validities in the main cases.

Significance. If the results hold, the work advances modal logic by clarifying how structure-preserving maps on linear orders affect modal expressivity and definability. The modality elimination theorems and the modal characterization of scatteredness via condensations are substantive contributions that connect modal semantics directly to order-theoretic properties, with potential implications for model theory of orders.

minor comments (3)

The introduction should explicitly define the modal language and the semantics for each class of maps (embeddings, monotone maps, etc.) before stating the main theorems, to improve readability for readers unfamiliar with the specific setup.
In the section on condensations, the definition of the condensation map and its interaction with the modal operators could be illustrated with a small diagram or example to clarify how scatteredness becomes definable.
The computation of propositional modal validities would benefit from a table summarizing the validities for each principal class of maps, as the textual descriptions are dense.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our manuscript and the recommendation of minor revision. The referee's summary correctly identifies the core results on modality elimination, modal definability of scatteredness under condensations, and the computation of modal validities for linear orders under the relevant classes of maps.

Circularity Check

0 steps flagged

No significant circularity detected

full rationale

The paper derives modality elimination for embeddings and monotone maps, modal definability of scatteredness via condensations, and exact propositional modal validities directly from standard Kripke semantics on linear orders with the listed map classes. No step reduces by construction to a self-definition, a fitted input renamed as prediction, or a load-bearing self-citation chain; the claims rest on explicit proofs within the given semantics rather than presupposing the target results in the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard Kripke semantics for modal logic and basic properties of linear orders under the listed maps. No free parameters, invented entities, or ad-hoc axioms are indicated in the abstract.

axioms (2)

standard math Kripke semantics for propositional modal logic on relational structures
Standard framework assumed for interpreting modal operators on linear orders.
domain assumption Linear orders are transitive, irreflexive, and total relations
Basic order-theoretic background required for the maps and structures studied.

pith-pipeline@v0.9.0 · 5319 in / 1275 out tokens · 50690 ms · 2026-05-15T01:46:01.447950+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Main Theorem: modality elimination for embeddings and monotone maps; scatteredness modally definable via condensations; exact propositional modal validities S4.3cap, S5, S4.2, S4.2.1
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

No reference to cost functions, golden ratio, or recognition ladders

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages · 1 internal anchor

[1]

Patrick Blackburn and Maarten de Rijke and Yde Venema , title =

work page
[2]

Alexander Chagrov and Michael Zakharyaschev , title =

work page
[3]

R. A. Bull , title =. 1966 , pages =

work page 1966
[4]

2016 , note =

Kees Doets , title =. 2016 , note =

work page 2016
[5]

Modal model theory , journaltitle =

Joel David Hamkins and Wojciech Aleksander Wo. Modal model theory , journaltitle =. 2024 , pages =

work page 2024
[6]

The modal logic of inner models , journaltitle =

Tanmay Inamdar and Benedikt L. The modal logic of inner models , journaltitle =. 2016 , pages =

work page 2016
[7]

David Marker , title =

work page
[8]

The modal theory of the category of sets

Wojciech Aleksander Wo. The modal theory of the category of sets , year =. 2603.25550 , archivePrefix =

work page internal anchor Pith review Pith/arXiv arXiv
[9]

The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles , journaltitle =

Joel David Hamkins and. The Modal Logic of Set-Theoretic Potentialism and the Potentialist Maximality Principles , journaltitle =. 2022 , pages =

work page 2022
[10]

2026 , pages =

Joel David Hamkins , title =. 2026 , pages =

work page 2026
[11]

The Modal Logic of Abelian Groups , journaltitle =

S. The Modal Logic of Abelian Groups , journaltitle =. 2023 , pages =

work page 2023
[12]

2003 , pages =

Joel David Hamkins , title =. 2003 , pages =

work page 2003
[13]

The Modal Logic of Forcing , journaltitle =

Joel David Hamkins and Benedikt L. The Modal Logic of Forcing , journaltitle =. 2008 , pages =. doi:10.1090/S0002-9947-07-04297-3 , eprint =

work page doi:10.1090/s0002-9947-07-04297-3 2008
[14]

Structural Connections Between a Forcing Class and Its Modal Logic , journaltitle =

Joel David Hamkins and George Leibman and Benedikt L. Structural Connections Between a Forcing Class and Its Modal Logic , journaltitle =. 2015 , pages =. doi:10.1007/s11856-015-1185-5 , eprint =

work page doi:10.1007/s11856-015-1185-5 2015
[15]

Modal Group Theory , year =

Wojciech Aleksander Wo. Modal Group Theory , year =

work page