Pith. sign in

REVIEW 2 major objections 4 minor 23 references

Functional monadic ortholattices and locally finite $\sigma$-free polyadic ortholattices

T0 review · 2 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Pith's one-line read The paper proves that every monadic ortholattice is isomorphic to a functional monadic ortholattice, answering a recent open question, and extends the result to locally finite substitution-free polyadic ortholattices.

desk verdict Monadic representation theorem looks right; the polyadic half fails because Definition 2.20 forces all quantifiers equal, so Corollary 2.23 is false. read the letter →

arxiv 2506.08271 v1 pith:6SN2X6LN submitted 2025-06-09 math.LO

classification math.LO MSC 06C1503G1503G2503G12
keywords monadicortholatticesfunctionalrepresentationsuper-amalgamationMacNeillecompletionpolyadiccylindricquantifiersorthologic
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 tries to establish that abstract monadic ortholattices—ortholattices equipped with a quantifier, which are algebraic models of orthologic—always sit inside a full functional monadic ortholattice, an algebra of functions from a set into a complete ortholattice with pointwise operations and a supremum quantifier. If correct, this resolves a recent open question and gives every monadic ortholattice a concrete set-theoretic realization. The same question is then posed for substitution-free polyadic ortholattices, algebraic models of predicate orthologic without equality, and the paper claims a positive answer for the locally finite ones by way of a one-to-one correspondence with locally finite diagonal-free cylindric ortholattices. A sympathetic reader should care because functional representations turn abstract algebras into ordinary function spaces, the kind of concrete semantics that supports duality and completeness arguments in non-classical logic.

What carries the argument

The load-bearing object is the recursive super-amalgamation tower of Definition 2.11. A V-formation is a pair of ortholattice embeddings $\phi_1:A\to A_1$ and $\phi_2:A\to A_2$; a super-amalgamation is an amalgam $\psi_1,\psi_2$ in which every comparability $\psi_i(a_i)\le \psi_k(a_k)$ is witnessed by an intermediate element from $A$. The tower repeatedly super-amalgamates the closed subalgebra $B$ with the previous stage and a fresh copy of $A$, producing embeddings $f_n,g_n$ and maps $h_n=g_n|_B$. Lemma 2.12 forces the images of closed elements to stabilize along the tower, and Lemma 2.13 identifies $\bigvee_n d_n g_n(a)$ with $d_k g_k(\exists a)$; that identity is exactly what makes the function-space quantifier a faithful image of $\exists$. The final step uses a regular completion of the directed limit, i.e., a complete ortholattice containing it by an embedding that preserves all existing meets and joins.

What would settle it

A concrete way to test the main theorem is to compute the directed limit in Definition 2.11 for a small finite monadic ortholattice and check whether the least upper bound identity of Lemma 2.13 holds; if some element's coordinate sequence lacks a least upper bound, or the least upper bound is not $d_k g_k(\exists a)$, the representation fails. For the polyadic extension, a direct test is to exhibit a diagonal-free cylindric ortholattice with two distinct quantifiers and ask whether it embeds into any full functional diagonal-free cylindric ortholattice as defined in Definition 2.20.

Watch

Extended reading notes

Core claim

The central claim is Theorem 2.16: for every monadic ortholattice $A$ with quantifier $\exists$, there is a complete ortholattice $\bar{C}$, a set $X$, and a monadic ortholattice embedding of $A$ into the full functional monadic ortholattice $\bar{C}^X$, where the quantifier acts by $\diamondsuit f(x) = \bigvee\{f(y) : y \in X\}$. The embedding is built by fixing the closed subalgebra $B$ of elements fixed by $\exists$, forming a directed system $A_0 \to A_1 \to \cdots$ in which each step is a super-amalgamation of the V-formation $\langle B; A_{n-1}, A, h_{n-1}, 1_B\rangle$, taking the directed limit $C$, and then regularly completing $C$ to $\bar{C}$. The key point is that the least upper bound of the coordinate sequence for $a \in A$ is exactly the coordinate of $\exists a$, so the quantifier is realized as the pointwise supremum. As corollaries, the paper derives a functional representation for diagonal-free cylindric ortholattices and, through a one-to-one correspondence, for locally finite substitution-free polyadic ortholattices.

Load-bearing premise

The construction cannot go through unless every V-formation of ortholattices has a super-amalgamation, and the polyadic extension additionally assumes that the single-function-space quantifiers of Definition 2.20 can realize distinct commuting quantifiers.

Editorial extensions

If this is right

  • A recent open question is answered affirmatively: the abstract class of monadic ortholattices coincides with the concrete class of functional monadic ortholattices.
  • Every diagonal-free cylindric ortholattice—an ortholattice equipped with pairwise commuting quantifiers—is isomorphic to a functional one, by Corollary 2.23.
  • Locally finite substitution-free polyadic ortholattices and locally finite diagonal-free cylindric ortholattices stand in a one-to-one correspondence, so functional representations transfer between the two settings.
  • The representation embeds into a function space over countably many coordinates built from a regular completion, so the result applies to non-distributive lattices and not only to Boolean algebras.

Reading between the lines

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

  • The recursive recipe suggests a general criterion for functional representability in other varieties: super-amalgamation plus regular completions may be enough to run the same tower argument; orthomodular lattices, as the paper itself notes, lack at least one of these ingredients.
  • The polyadic theorem is only as strong as the construction in Definition 2.20, which uses the same supremum operator for every index; a genuinely multidimensional construction with one quantifier per coordinate would be needed for distinct commuting quantifiers.
  • Since the target algebra is a regular completion of a directed limit, the theorem implicitly provides a canonical completion-based semantics for monadic orthologic, a connection the paper does not develop.
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.

Referee Report

2 major / 4 minor

Summary. The paper has two aims. First, it proves a functional representation theorem for monadic ortholattices (Theorem 2.16), claiming that every monadic ortholattice embeds into a full functional monadic ortholattice of the form A^X with the pointwise quantifier; this is said to resolve a question of Harding. The proof adapts the recursive super-amalgamation construction of Bezhanishvili and Harding for monadic Heyting algebras, using the super-amalgamation property of ortholattices (Bruns--Harding, Miyazaki) and MacNeille completions (MacLaren, Day). Second, the paper introduces locally finite substitution-free polyadic ortholattices, establishes a one-to-one correspondence with locally finite diagonal-free cylindric ortholattices (Theorem 3.12), and claims a functional representation for them (Theorem 3.13) as an immediate consequence of the monadic theorem and a corollary about diagonal-free cylindric ortholattices (Corollary 2.23).

Significance. If Theorem 2.16 is correct, it is a solid contribution: it extends Halmos's functional representation of monadic Boolean algebras to the non-distributive setting and resolves an open question. The proof is a genuine adaptation of existing techniques, and the cited external results (super-amalgamation, MacNeille completion, regular completion) are used appropriately. The monadic part of the paper appears to be the strongest and most valuable portion. The polyadic part, however, is not established: the definition of the full functional diagonal-free cylindric ortholattice forces all quantifiers to be equal, making Corollary 2.23 false, and Theorem 3.13 depends on that corollary. The proposed correspondence in Section 3 is plausible but does not by itself provide a functional representation.

major comments (2)
  1. [Definition 2.20 and Corollary 2.23] In the full functional diagonal-free cylindric ortholattice defined in Definition 2.20, each quantifier is the same operator: clause (5) of Definition 2.4 defines (♢f)(x) = ⋁_{x∈X} f(x), with no dependence on i, so ♢_i = ♢_k for all i,k∈I. This equality is inherited by every subalgebra in the sense of Definition 2.21. Corollary 2.23 therefore asserts that every diagonal-free cylindric ortholattice—whose quantifiers are only required to commute pairwise—is isomorphic to one in which all quantifiers coincide. That is false. For example, take a nontrivial monadic ortholattice (A,∃) and consider A×A with ∃_0(a,b) = (∃a,b) and ∃_1(a,b) = (a,∃b); these are distinct commuting quantifiers, so this is a diagonal-free cylindric ortholattice that cannot be embedded into any algebra satisfying ♢_0 = ♢_1. Corollary 2.23 is not merely unproved; it is false as stated.
  2. [Theorem 3.13] The proof of Theorem 3.13 is the single sentence 'The result follows immediately by Theorem 2.16, Corollary 2.23, and Theorem 3.12.' Since Corollary 2.23 is false, this proof collapses. Moreover, even if Corollary 2.23 were repaired by redefining the full functional diagonal-free cylindric ortholattice with genuinely distinct quantifiers, Theorem 3.12 would not automatically transfer functional representations: Lemmas 3.10 and 3.11 give a bijection on underlying algebras, but they do not show that a subalgebra of a full functional diagonal-free cylindric ortholattice corresponds to a subalgebra of a full functional σ-free polyadic ortholattice. A separate proof of Theorem 3.13, or an explicit transfer argument, is required.
minor comments (4)
  1. [Definition 2.11(1)] The condition 'f_0 ∘ 1_A = g_0 ∘ 1_A' is a typo; it should be 'f_0 ∘ 1_B = g_0 ∘ 1_B', since 1_A is the identity on A and the two embeddings need only agree on the common subalgebra B.
  2. [Theorem 2.16 proof] In the displayed computation, 'the fact that the embedding i preserves meet operation' should say 'join operation', and the reference to 'Corollary 2.14' should be to Lemma 2.14.
  3. [Theorem 2.16 proof] The phrase 'For simplicity, we identify X with ω since X is assumed to be countable' is confusing: X is a freely chosen set in Definition 2.4 and no countability assumption on the original algebra is used; the authors may simply set X = ω.
  4. [Section 3, Proposition 3.7] The operator in the proof of Proposition 3.7 is denoted variously as b∇, \nabla, and c∇; please unify the notation to match Definition 3.4.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation: the monadic functional representation is self-contained; the δ-free cylindric and polyadic extension has a definitional gap rather than a circular one.

full rationale

The monadic representation theorem (Theorem 2.16) is derived, not assumed. The construction in Definition 2.11 uses the external super-amalgamation theorem for ortholattices (Theorem 2.9, cited to Bruns–Harding and Miyazaki) and regular completions (Theorem 2.10, cited to MacLaren and Day). Lemmas 2.12–2.14 then prove that the map f(a)(n)=i∘d_n∘g_n(a) satisfies f(∃a)=♢f(a) in the full functional monadic ortholattice (Cbar)^ω. No parameter is fitted to the target representation, and no step presupposes the theorem being proved. The self-citations (e.g., Harding [12], McDonald [21]) are background and definitional, not load-bearing for the monadic proof. The later δ-free cylindric claim does contain a serious definitional gap, though it is not a circularity in the monadic argument: Definition 2.20 defines the full functional δ-free cylindric ortholattice by requiring each ⟨A^X;·,+,−,c0,c1,♢_i⟩ to be a full functional monadic ortholattice, and Definition 2.4(5) gives the identical operation (♢f)(x)=⋁{f(x):x∈X} for every i. Hence all functional quantifiers coincide, Proposition 2.22's commutativity is trivial, and Corollary 2.23's assertion that every δ-free cylindric ortholattice is representable does not cover algebras with distinct commuting quantifiers; Theorem 3.13 inherits this gap through Theorem 3.12. This is a mathematical/definitional failure of the multi-quantifier generalization, not a circular derivation of the monadic representation theorem.

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

The paper relies on standard algebraic results about ortholattices, all cited to prior literature. No free parameters or invented entities are introduced.

assumptions (3)
  • domain assumption The variety of ortholattices has the super-amalgamation property.
    Used in Definition 2.11 at every recursive step; cited from Bruns and Harding [4] and Miyazaki [22].
  • domain assumption Every ortholattice has a MacNeille completion and a regular completion.
    Used in Theorem 2.10 and Theorem 2.16 to embed C into a complete ortholattice; cited from MacLaren [20] and Day [6].
  • standard math The directed limit of a chain of ortholattice embeddings is an ortholattice and each injection is an embedding.
    Used in Definition 2.11 and Lemmas 2.12 and 2.13; this is standard category theory for directed colimits.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Functional monadic ortholattices and locally finite $\sigma$-free polyadic ortholattices." pith.science (2026). https://pith.science/paper/6SN2X6LN

@misc{pith2026250608271,
  author       = {Pith},
  title        = {Pith review of: Functional monadic ortholattices and locally finite $\sigma$-free polyadic ortholattices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/6SN2X6LN}},
  note         = {Machine review of arXiv:2506.08271}
}
abstract

In this paper, we show that every monadic ortholattice is isomorphic to a functional one, thereby resolving a recent question posed by Harding. We then study certain substitution-free reducts of the polyadic ortholattices, which we call locally finite $\sigma$-free polyadic ortholattices, and provide an analogous functional representation result.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

23 extracted references · 21 canonical work pages

  1. [1]

    Algebra Universalis

    Bezhanishvili, G., Harding, J.: Functional monadic Heyting algebras. Algebra Universalis. 48, 1 – 10 (2002)

  2. [2]

    Birkhoff, G., Von Neumann, J.: The logic of quantum mechanics. Ann. of Math.37, 823 – 843 (1936)

  3. [3]

    American Mathematical Society Publications, vol

    Birkhoff, G.: Lattice Theory (3rd ed.). American Mathematical Society Publications, vol. 25, American Mathematical Society, Rhode Island (1967)

  4. [4]

    Order.14, 193 – 209 (1998)

    Bruns, G., Harding, J.: Amalgamation of ortholattices. Order.14, 193 – 209 (1998)

  5. [5]

    Trends in Logic, Studia Logica Library, vol

    Chiara, M., Guintini, R., Greechie, R.: Reasoning in Quantum Theory: Sharp and Un- sharp Quantum Logics. Trends in Logic, Studia Logica Library, vol. 22, Dordrecht: Springer, Netherlands (2004)

  6. [6]

    Unpublished man- uscript (1973)

    Day, A.: Varieties of Heyting algebras, II (Amalgamation and injectivity). Unpublished man- uscript (1973)

  7. [7]

    Galler, B.A.: Cylindric and polyadic algebras, Proc. Amer. Math. Soc.8, 1, 176 – 183 (1957)

  8. [8]

    Goldblatt, R.I., A semantic analysis of orthologic. J. Philos. Logic.3, 19 – 35 (1974)

Show all 23 references
  1. [9]

    Birkh¨ auser, Basel (2011)

    Gr¨ atzer, G.: Lattice Theory: Foundation. Birkh¨ auser, Basel (2011)

  2. [10]

    Chelsea Publishing Company, New York (1962)

    Halmos, P.: Algebraic Logic. Chelsea Publishing Company, New York (1962)

  3. [11]

    Harding, J.: Orthomodular lattice whose MacNeille completions are not orthomodular. Order. 8, 93 – 103 (1991)

  4. [12]

    Harding, J.: Quantum monadic algebras. J. Phys. A.55no. 39 (2023)

  5. [13]

    Accepted at Algebra Universalis (2025)

    Harding, J., McDonald, J., Peinado, M.: Monadic ortholattices: completions and duality. Accepted at Algebra Universalis (2025)

  6. [14]

    Studies in Logic and the Foundations and Mathematics, Elsevier, vol

    Henkin, L.: The representation theorem for cylindrical algebras. Studies in Logic and the Foundations and Mathematics, Elsevier, vol. 16, 85 – 97 (1955)

  7. [15]

    In Proceedings of Symposia in Pure Mathematics, Vol

    Henkin, L., Tarski, A.: Cylindric Algebras. In Proceedings of Symposia in Pure Mathematics, Vol. II, 83 – 113. American Mathematical Society, Providence, R.I. (1961)

  8. [16]

    Algebra Universalis.68, 257 – 285 (2012)

    Hodkinson, I.: A construction of cylindric and polyadic algebras from atomic relation alge- bras. Algebra Universalis.68, 257 – 285 (2012)

  9. [17]

    Part I, volume 64 of Studies in Logic and the Foundations of of Mathematics

    Henkin, L., Monk, J.D., and Tarski, A.: Cylindric algebras. Part I, volume 64 of Studies in Logic and the Foundations of of Mathematics. North-Holland Publishing Co., Amsterdam (1985)

  10. [18]

    Part II, volume 115 of Studies in Logic and the Foundations of of Mathematics

    Henkin, L., Monk, J.D., and Tarski, A.: Cylindric algebras. Part II, volume 115 of Studies in Logic and the Foundations of of Mathematics. North-Holland Publishing Co., Amsterdam (1985)

  11. [19]

    Pacific J

    Janowitz, M.: Quantifiers and orthomodular lattices. Pacific J. Math.13, 1241 – 1249 (1963)

  12. [20]

    Pacific J

    MacLaren, M.: Atomic orthocomplemented lattices. Pacific J. Math.14, 597 – 612 (1964) 13

  13. [21]

    Under review atStudia Logica(2025)

    McDonald, J.: Canonical completion and duality for cylindric ortholattices and cylindric Boolean algebras. Under review atStudia Logica(2025)

  14. [22]

    Miyazaki, Y.: The super-amalgamation property of the variety of ortholattices. Rep. Math. Logic.33, 45 – 63 (1999)

  15. [23]

    Actas de las X Jornadas de la Uni´ on Matem´ atica Argentina, Bah ´ ıa Blanca, 52 – 62 (1957)

    Monteiro, A., Varsavsky, O.: Algebras de Heyting mon´ adicas. Actas de las X Jornadas de la Uni´ on Matem´ atica Argentina, Bah ´ ıa Blanca, 52 – 62 (1957)

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.