Affine modal propositional logic

Hafez K.D. (1); Seyed-Mohammad Bagheri (1) ((1) Tarbiat modares university)

REVIEW 3 major objections 4 minor 12 references

Affine modal propositional logic

T0 review · 3 major / 4 minor · reviewed 2026-07-31 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Every consistent theory in affine modal propositional logic has a topological model, and affine satisfiability implies global satisfiability.

desk verdict A natural new topological semantics for affine modal logic with plausible completeness and compactness claims, but the proofs as written are not reliable and need substantial repair. read the letter →

arxiv 2607.23323 v1 pith:OKATJ57N submitted 2026-07-25 math.LO

Hafez K.D. (1) , Seyed-Mohammad Bagheri (1) ((1) Tarbiat modares university) This is my paper · ORCID

classification math.LO MSC 03B4503B50

keywords affinemodallogictopologicalsemanticslowersemi-continuouscompletenesscompactnesscanonicalmodelultrameanconstructionfinitelyadditiveprobability

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper introduces a topological semantics for affine modal propositional logic, a fragment of continuous logic with only addition, scalar multiplication, and the modal operator □. Instead of interpreting □ as the interior of a subset, the semantics interprets □ as the lower semi-continuous envelope of a real-valued function. The paper proves that every consistent theory is satisfiable in such a model (completeness), and that a set of conditions is satisfiable as soon as every condition in its affine closure is separately satisfiable (affine compactness). These results matter because they give the modal fragment a natural geometric semantics and a compactness principle, with the canonical model forming a compact convex space.

What carries the argument

The key object is the lower semi-continuous envelope operator, f(x)=sup{h(x): f≥h, h lower semi-continuous}, which extends the interior operator on characteristic functions and respects the affine connectives. The compactness proof relies on the ultramean construction: a finitely additive probability measure on an index set, a quotient of the product by measure-one equality, and integration of formula values against the charge. Standard extension and representation theorems for sublinear functionals are used to convert the sublinear functional Q(ϕ)=inf{r:ϕ≤r∈Γ} into a positive linear functional, which becomes a probability charge.

What would settle it

Find a maximal affinely satisfiable set Γ and a proposition ϕ such that ϕ≤Q(ϕ) is not in Γ (with Q(ϕ)=inf{r:ϕ≤r∈Γ}), or, more directly, construct a set of conditions whose every nonnegative finite combination is separately satisfiable but for which no single model satisfies all conditions at once — either would refute the affine compactness theorem.

Watch

Extended reading notes

Core claim

The central claim is that the modal operator □ of affine S4 is exactly the lower semi-continuous envelope operation on a topological space of maximal consistent theories. The authors build a canonical model whose points are maximal consistent theories and whose topology is generated by the sets where (□ϕ) exceeds a real value. The truth lemma shows each formula evaluates to its assigned real value at each point, yielding completeness. For compactness, they construct an ultramean product of models using a finitely additive probability charge: the value of a formula at the ultramean point is the integral of its values in the factors. They show that every affinely satisfiable set of conditions

Load-bearing premise

For a maximal affinely satisfiable set Γ, each proposition must attain its infimum: the condition ϕ ≤ Q(ϕ), where Q(ϕ)=inf{r:ϕ≤r∈Γ}, must itself belong to Γ; the paper assumes this without proof.

Editorial extensions

If this is right

Every consistent theory in affine modal S4 has a topological model, so the proof system is complete with respect to the envelope semantics.
A set of conditions is satisfiable as soon as every condition in its affine closure (nonnegative finite combinations) is separately satisfiable, a compactness principle for affine modal logic.
The canonical model is a compact convex space, giving a geometric structure to the space of theories.
Approximate completeness yields that Γ⊨0≤ϕ entails Γ⊢−1/n≤ϕ for every n, connecting semantic validity to provability within arbitrarily small error.
When restricted to characteristic functions, the semantics reduces to the classical topological semantics of S4, showing it is a genuine generalization.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The lower-semi-continuous semantics suggests affine modal logic could serve as a many-valued modal logic over [0,1] with a non-dual pair of modalities (□ as lower envelope, ♢ as upper envelope), paralleling fuzzy modal logics.
The affine compactness theorem may transfer to first-order affine modal logic if the ultramean construction adapts to structures with predicates, though the paper does not address this.
The use of finitely additive charges rather than countably additive measures indicates the semantics tolerates nonmeasurable sets, potentially connecting to game-theoretic or finitely-additive probability semantics.
The realization-at-infimum property, asserted without proof, is the critical step for compactness; if it can be derived from weaker assumptions, the theorem would be more robust, but if it fails, the ultramean construction collapses.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Short version: the paper introduces a topological semantics for affine modal logic where □ is the lower semi-continuous envelope, and claims completeness plus an affine compactness theorem. The idea is natural and worth taking seriously; the proofs as written are not.

What's new: as far as I know, the lsc-envelope semantics is new, and it does generalize the classical interior semantics. The affine compactness statement—“every affinely satisfiable set is satisfiable”—is a nice analogue of compactness in continuous logic, and the ultracharge construction is the right tool. If the paper is fixable, it would be a real contribution.

Soft spots, in order of seriousness.

1. The truth lemma (Prop. 4.2) is not proved. The step where a semantic fact about all maximal theories containing δ≤□ψ_i is turned into a syntactic derivation from that finite set is exactly the kind of compactness one is supposed to be proving; it's asserted without argument. Also, saying “for every δ>0” is too strong—a point in the basic open set only guarantees each □ψ_i is positive, not ≥δ for a fixed δ.

2. Lemma 5.1 (the ultramean lemma) is wrong as written. The proof compares with φ^{M_i}(a_i) where it needs (□φ)^{M_i}(a_i). As written, the claimed inequality is false: a function with a spike at a_i satisfies the written inequality but not the intended one. I think it's repairable by using the envelope values throughout, but the current text doesn't do that.

3. Theorem 5.2 asserts without proof that φ≤Q(φ) belongs to a maximal affinely satisfiable Γ. The stress-test note worried this is essentially compactness and circular. I disagree with the stress-test here: for a fixed affine combination, the set of possible values is the image of a cube under an affine map, hence closed; given that every positive ε variant is satisfiable, a compactness-of-[0,1]^k argument gives the point. So this is a missing lemma, not a circularity. But the paper should provide it.

4. Lemma 3.7 has a bogus case (s<0) and is used later; needs a proper proof.

So: the central ideas are probably right, but the manuscript as it stands has two unproved load-bearing parts (truth lemma and ultramean lemma) and one omitted-but-provability lemma. It deserves a serious referee, but I would not want to rely on any of the theorems until the proofs are rewritten. I'd send it out, expecting major revision. I would not cite it yet.

Referee Report

3 major / 4 minor

Summary. The paper introduces a topological semantics for an affine fragment of continuous modal propositional logic: models are topological spaces with real-valued valuations in [0,1], and the modal operator □ is interpreted as the lower semi-continuous envelope of a formula's value function. It proposes a Hilbert-style proof system AS4 (axioms A1–A15, rules R1–R4) and claims soundness (Prop. 3.3), completeness via a canonical model (Thms. 4.3–4.5), and an 'affine compactness' theorem (Thm. 5.2) proved by an ultramean construction. The final section relates maximal theories to positive linear functionals and asserts compact convexity of the canonical model. The overall project is interesting, but the manuscript as written contains load-bearing gaps in the proofs of the truth lemma and the affine compactness theorem.

Significance. If correct, the paper would give a natural continuous analogue of the McKinsey–Tarski topological semantics for S4, together with a compactness principle for the affine modal fragment. The ultramean construction is a promising technique, and the proof-theoretic lemmas in Section 3 are potentially useful. The paper does not provide machine-checked proofs or code, so the assessment rests on the text. The significance is substantial, but the current presentation is not sufficiently rigorous to support the central claims.

major comments (3)

[Section 5, Theorem 5.2] The line 'Moreover, φ≤Q(φ) belongs to Γ' is the key step that makes the rest of the proof work, but no justification is given. Maximality alone only says that if Γ∪{S} is affinely satisfiable then S∈Γ. To apply this one must prove that Γ∪{φ≤Q(φ)} is affinely satisfiable, i.e., that every finite positive combination of Γ together with φ≤Q(φ) is satisfiable. The facts that φ≤Q+ε∈Γ for every ε>0 and that each such condition is satisfiable do not imply satisfiability of the limit condition, because the set of values of a formula over all models is not closed under infima. This is essentially the compactness principle being proved, so the argument is circular. The construction of models M_i with φ^{M_i}(a_i)≤Q(φ) depends on this assertion, and without it the ultramean construction collapses. A possible repair is to use approximate witnesses φ≤Q+1/n and an ultramean over n, but that is not wha
[Section 4, Proposition 4.2] In the second half of the truth lemma, after choosing a basic open U with y∈U⇒r−ε≤φ_y, the text asserts without proof that U may be written as B(□ψ_1,0)∩···∩B(□ψ_k,0) and that this implies the syntactic consequence {δ≤□ψ_1,...,δ≤□ψ_k}⊢r−ε≤φ for every δ>0. The first point requires absorbing constants into the ψ_i and using the idempotence □□ψ=□ψ; the second needs a compactness-style consistency argument (if the consequence failed, extend to a maximal consistent y with δ≤□ψ_i and φ≤r−ε, contradicting y∈U). Moreover, the final conclusion 'for every y∈U, r−ε≤(□φ)_y' requires choosing δ smaller than min_i(□ψ_i)_y after applying Lemma 3.7. These steps are load-bearing for completeness and need to be written out.
[Section 3, Lemma 3.7] The proof of the R2 case for s<0 is not a valid induction step: 'Then, for sufficiently big n one has that Γ⊢_n rθ+sφ≤sψ' changes the induction parameter n and does not follow from the displayed hypotheses. Since R2 is only stated for nonnegative scalars, the s<0 case requires a separate argument (for example, using the inconsistency of Γ,0≤θ in that case). Lemma 3.7 is used later in Proposition 4.2 and Lemma 3.8, so this gap propagates to the completeness proof.

minor comments (4)

[Section 4, Theorem 4.4] In the proof, the displayed inequality should be φ^M(x)≤−1/n, not −1/n≤φ^M(x). The argument is otherwise correct.
[Section 4, Proposition 4.2] The notation B(□ψ_i,0) is confusing: the subbasic sets are defined as {r<(□φ)_x}, and the use of □ψ_i as the argument should be explained. It would be clearer to write B(ψ_i,0).
[Section 5, Lemma 5.1] In the second half of the proof, the phrase 'we may assume a_i∈U_i for all i' should be justified by the fact that the charge is finitely additive and sets of measure zero do not affect the integral. As written it is acceptable but slightly terse.
[Section 5, Theorem 5.2] The phrase 'maximal probability charge' is unnecessary; the Riesz representation theorem gives a probability charge, and maximality plays no role.

Circularity Check

1 steps flagged · score 6.0 of 10

Theorem 5.2 asserts without proof that a maximal affinely satisfiable set contains φ≤Q(φ), which is essentially the compactness property the theorem aims to prove.

other [Section 5, proof of Theorem 5.2, after definition of Q(φ)]
"By maximality, Q is defined for every ϕ and it is sublinear, i.e. Q(ϕ+ψ)≤Q(ϕ)+Q(ψ), Q(rϕ)=rQ(ϕ) for r≥0. Moreover, ϕ≤Q(ϕ) belongs to Γ."

For a maximal affinely satisfiable Γ, membership S∈Γ is equivalent to affine satisfiability of Γ∪{S}. Thus the assertion 'ϕ≤Q(ϕ) belongs to Γ' is equivalent to affine satisfiability of Γ∪{ϕ≤Q(ϕ)}. This is exactly an instance of the compactness being proved: we have satisfiability of finite affine combinations together with approximations ϕ≤Q+ε, but need to pass to the limit ϕ≤Q. The paper provides no argument showing that affine satisfiability is closed under taking such infima, and the subsequent construction of M_i with φ^{M_i}(a_i)≤Q(φ) relies entirely on this unproved step. Hence the compactness conclusion is assumed before it is proved.

full rationale

The canonical-model completeness proof in Section 4 appears self-contained and independent of Section 5. However, the proof of affine compactness in Theorem 5.2 contains a load-bearing circular step. After defining Q(φ)=inf{r:φ≤r∈Γ} for a maximal affinely satisfiable Γ, the authors assert without proof that φ≤Q(φ) belongs to Γ. Under maximality, this membership is equivalent to affine satisfiability of Γ∪{φ≤Q(φ)}, which is precisely the kind of finite-to-infinite closure that affine compactness is supposed to establish. The rest of the theorem—the Hahn-Banach extension, the Kantorovich extension, the ultracharge and the ultramean model—depends on this assertion to produce the models M_i and points a_i with φ^{M_i}(a_i)≤Q(φ). No separate proof is given for the realization-at-infimum property, and it does not follow from maximality alone, since a set of conditions may be satisfiable up to every epsilon without being satisfiable at the limit. Therefore the central compactness claim partially reduces to an unproved assumption of the same content, while the completeness theorem retains independent value.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper relies on standard functional analysis and set-theoretic tools (Zorn, Hahn-Banach, Kantorovich, Riesz). The only nonstandard input is the unproved realization assertion in the affine compactness proof, which is a load-bearing premise rather than an independently motivated axiom.

assumptions (5)

standard math Zorn's lemma: consistent sets extend to maximal consistent theories and affinely satisfiable sets extend to maximal affinely satisfiable sets.
Used in Sections 4 and 5 to obtain maximal theories for the canonical model and for the affine compactness proof.
standard math Hahn-Banach extension theorem for sublinear functionals on real vector spaces.
Used in Theorem 5.2 to extend the functional T0≤Q on R to a linear T≤Q on V.
standard math Kantorovich extension theorem: positive linear functionals on a majorizing subspace of C_b(Ω) extend to positive linear functionals on C_b(Ω).
Used in Theorem 5.2 to extend T from V to C_b(Ω), assuming V majorizes C_b(Ω).
standard math Riesz representation theorem: positive linear functionals on C_b(Ω) correspond to finitely additive probability charges.
Used in Theorem 5.2 to obtain the ultracharge μ used in the ultramean construction.
ad hoc to paper A maximal affinely satisfiable set Γ satisfies φ≤Q(φ)∈Γ for Q(φ)=inf{r:φ≤r∈Γ}.
Asserted without proof in Theorem 5.2; load-bearing for constructing the models M_i. This is the main proof gap and a circularity concern.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Affine modal propositional logic." pith.science (2026). https://pith.science/paper/OKATJ57N

@misc{pith2026260723323,
  author       = {Pith},
  title        = {Pith review of: Affine modal propositional logic},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OKATJ57N}},
  note         = {Machine review of arXiv:2607.23323}
}

read the original abstract

Topological semantics for affine modal propositional logic is introduced. The interior operator on subsets is replaced with the lower semi-continuous envelope operator on functions. Completeness and affine compactness theorems are proved for this logic.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

12 extracted references · 1 linked inside Pith

[1]

Alfsen,Compact convex sets and boundary integrals, Springer-Verlag (1971)

E.M. Alfsen,Compact convex sets and boundary integrals, Springer-Verlag (1971)

1971
[2]

Aliprantis, K.C

C.D. Aliprantis, K.C. Border,Infinite dimensional analysis, third edition, Springer (2006). 11

2006
[3]

Bhaskara Rao, M

K.P.S. Bhaskara Rao, M. Bhaskara Rao,Theory of charges, Academic Press (1983)

1983
[4]

Ben Yaacov, A

I. Ben Yaacov, A. Berenstein, C. W. Henson, A. Usvyatsov,Model theory for met- ric structures, Model Theory with Applications to Algebra and Analysis, Cambridge University Press, 315-427, (2008)

2008
[5]

Bagheri,Elements of affine model theory, arXiv preprint arXiv:2408.03555, (2024)

S.-M. Bagheri,Elements of affine model theory, arXiv preprint arXiv:2408.03555, (2024)

arXiv 2024
[6]

Bagheri, R

S.-M. Bagheri, R. Safari,Completeness for linear continuous logic, Journal of Logic and Computation, 27(4):985-998, (2017)

2017
[7]

Blackburn, M

P. Blackburn, M. de Rijke, Y. Venema,Modal logic, Cambridge University Press, (2001)

2001
[8]

van Benthem, G

J. van Benthem, G. Bezhanishvili,Modal Logics of Space, Handbook of Spatial Logics, Springer Netherlands, 217-298, (2007)

2007

Show all 12 references

[9]

McKinsey, A

J. McKinsey, A. Tarski,The algebra of topology, Annals of Mathematics, 45:141-191, (1944)

1944
[10]

Baratella,Continuous propositional modal logic, Journal of Applied Non-Classical Logics, 28(4):297-312, (2018)

S. Baratella,Continuous propositional modal logic, Journal of Applied Non-Classical Logics, 28(4):297-312, (2018)

2018
[11]

Baratella,A completeness theorem for continuous predicate modal logic, Arch

S. Baratella,A completeness theorem for continuous predicate modal logic, Arch. Math. Logic, 58:183-201, (2019)

2019
[12]

Goldblatt,Mathematical modal logic: A view of its evolution, Journal of Applied Logic, 1(5):309-392, (2003)

R. Goldblatt,Mathematical modal logic: A view of its evolution, Journal of Applied Logic, 1(5):309-392, (2003). 12

2003

Pith tools

Reviewed July 31, 2026 · model on record in the stance chip above.

[1] [1]

Alfsen,Compact convex sets and boundary integrals, Springer-Verlag (1971)

E.M. Alfsen,Compact convex sets and boundary integrals, Springer-Verlag (1971)

1971

[2] [2]

Aliprantis, K.C

C.D. Aliprantis, K.C. Border,Infinite dimensional analysis, third edition, Springer (2006). 11

2006

[3] [3]

Bhaskara Rao, M

K.P.S. Bhaskara Rao, M. Bhaskara Rao,Theory of charges, Academic Press (1983)

1983

[4] [4]

Ben Yaacov, A

I. Ben Yaacov, A. Berenstein, C. W. Henson, A. Usvyatsov,Model theory for met- ric structures, Model Theory with Applications to Algebra and Analysis, Cambridge University Press, 315-427, (2008)

2008

[5] [5]

Bagheri,Elements of affine model theory, arXiv preprint arXiv:2408.03555, (2024)

S.-M. Bagheri,Elements of affine model theory, arXiv preprint arXiv:2408.03555, (2024)

arXiv 2024

[6] [6]

Bagheri, R

S.-M. Bagheri, R. Safari,Completeness for linear continuous logic, Journal of Logic and Computation, 27(4):985-998, (2017)

2017

[7] [7]

Blackburn, M

P. Blackburn, M. de Rijke, Y. Venema,Modal logic, Cambridge University Press, (2001)

2001

[8] [8]

van Benthem, G

J. van Benthem, G. Bezhanishvili,Modal Logics of Space, Handbook of Spatial Logics, Springer Netherlands, 217-298, (2007)

2007