{"id":"f3395a43-e27c-4665-9116-3e19fefbceeb","arxiv_id":"2506.08271","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"high","formal_verification":"none","parameter_count":0,"one_line_summary":"Every monadic ortholattice embeds into a full functional monadic ortholattice, but the paper's claimed representation for locally finite sigma-free polyadic ortholattices is not justified.","lead":"This paper proves a functional representation theorem for monadic ortholattices, a class of lattices used in quantum logic. The proof of the paper's extension to polyadic ortholattices contains a definitional flaw that invalidates the stated result.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Definition 2.20 forces all quantifiers to be equal, so Corollary 2.23 cannot hold for algebras with distinct commuting quantifiers and Theorem 3.13 is unsupported.","rationale":"I read the paper in good faith and agree with the reader's overall assessment. The monadic representation theorem (Theorem 2.16) is a substantial contribution and its proof strategy, using super-amalgamation and regular completions, is coherent: the directed limit C is built in Definition 2.11, Lemmas 2.12–2.14 supply the needed joins, and the embedding into (C̄)^ω preserves the single quantifier. I do not see a fatal gap in that argument at the level of the present text. The load-bearing failure is in the second half of the paper. Definition 2.20 defines a full functional δ-free cylindric ortholattice by taking, for each i∈I, the same full functional monadic quantifier over the same set X. Since the operation (♢_i f)(x)=⋁_{x∈X} f(x) does not depend on i, all quantifiers in every full functional algebra are equal. Subalgebras inherit this equality, so Corollary 2.23 implies that no δ-free cylindric ortholattice with distinct commuting quantifiers can exist. But such algebras are abundant, including the simple product construction given in the concrete test. Thus Corollary 2.23 is false, and Theorem 3.13, which relies on it, is unsubstantiated. The one-to-one correspondence in Theorem 3.12 between locally finite δ-free cylindric ortholattices and locally finite σ-free polyadic ortholattices is plausible and is not the source of the difficulty; the missing piece is a functional representation theorem for δ-free cylindric ortholattices in which the quantifiers are genuinely distinct. Because the paper presents two central claims and one of them is false, a REJECT verdict is appropriate, with the caveat that the monadic part is likely salvageable as an independent result.","tokens_in":11145,"tokens_out":6322,"duration_ms":73332,"concrete_test":"Construct the concrete δ-free cylindric ortholattice described above: let A=2² with orthocomplement (a,b)⊥=(¬a,¬b) and quantifier ∃(a,b)=(a∨b,a∨b); let L=A×A and define ∃_0(x,y)=(∃x,y), ∃_1(x,y)=(x,∃y). Verify that L satisfies Definition 2.19 and that ∃_0≠∃_1. Then attempt to find an embedding of L into any full functional δ-free cylindric ortholattice of Definition 2.20. In such an algebra, (♢_0 f)(x)=(♢_1 f)(x)=⋁_{z∈X} f(z) for every f, so any subalgebra has equal quantifiers. An injective homomorphism preserving the signature would force the images of ∃_0 and ∃_1 to be equal, contradicting ∃_0≠∃_1. Hence no such embedding exists. This directly refutes Corollary 2.23.","verdict_should_be":"REJECT","load_bearing_attack":"The critical flaw is in the definition of a full functional δ-free cylindric ortholattice (Definition 2.20). For each i∈I, the quantifier is defined by (♢_i f)(x) = ⋁_{x∈X} f(x), which is literally independent of i. Consequently, in every full functional δ-free cylindric ortholattice of this definition, and in every subalgebra of such an algebra, the quantifiers ♢_i and ♢_k coincide for all i,k∈I. Proposition 2.22 confirms that each ♢_i is a quantifier and notes commutativity, but commutativity is trivial because all quantifiers are already identical. Corollary 2.23 then claims that every δ-free cylindric ortholattice is isomorphic to a functional one; however, any δ-free cylindric ortholattice with two distinct commuting quantifiers cannot be embedded into an algebra in which all quantifiers are equal. Such algebras exist: take a nontrivial monadic ortholattice (A,∃), e.g., A=2² with ∃(a,b)=(a∨b,a∨b), and form A×A with ∃_0(x,y)=(∃x,y) and ∃_1(x,y)=(x,∃y). These are distinct commuting quantifiers. Thus Corollary 2.23 is false as stated, not merely unproved. Since Theorem 3.13 is proved by invoking Corollary 2.23 together with the correspondence in Theorem 3.12, its proof collapses. The correspondence itself (Lemmas 3.10 and 3.11) may well be correct, but it does not supply the missing functional representation for δ-free cylindric ortholattices with genuinely distinct quantifiers. The monadic representation theorem (Theorem 2.16) appears independent and plausible, but it cannot be iterated under the current Definition 2.20 to yield a family of distinct quantifiers.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","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).","tokens_in":11433,"tokens_out":10883,"duration_ms":122365,"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":[{"comment":"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.","section":"Definition 2.20 and Corollary 2.23"},{"comment":"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.","section":"Theorem 3.13"}],"minor_comments":[{"comment":"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.","section":"Definition 2.11(1)"},{"comment":"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.","section":"Theorem 2.16 proof"},{"comment":"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 = ω.","section":"Theorem 2.16 proof"},{"comment":"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.","section":"Section 3, Proposition 3.7"}],"recommendation":"major_revision","confidential_remarks":"The monadic representation theorem (Theorem 2.16) appears to be a genuine and publishable contribution. The vulnerability is entirely in the diagonal-free cylindric and polyadic parts: the current Definition 2.20 makes Corollary 2.23 false, and Theorem 3.13 is unsupported. I would encourage the editor to invite a revision in which the functional representation for diagonal-free cylindric ortholattices is either proved with a correct definition (e.g., using functions on X^I with the usual cylindrifications) or removed, and in which Theorem 3.13 receives a direct proof instead of an appeal to the faulty corollary."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know. Theorem 2.16, the monadic ortholattice functional representation, looks correct and answers Harding's open question. The rest of the paper, the δ-free cylindric and σ-free polyadic representation claims, is broken by a mistake in Definition 2.20.\n\nThe monadic proof follows the Bezhanishvili–Harding template: build a directed limit of super-amalgamations, take a regular completion, map each a to the sequence of g_n(a). I checked the steps in Lemmas 2.12–2.14 and the preservation argument. They hold. The use of super-amalgamation for ortholattices (Bruns–Harding, Miyazaki) and MacNeille/regular completions (MacLaren, Day) is standard and correctly cited. This is a genuine result.\n\nThe trouble starts with Definition 2.20. A full functional δ-free cylindric ortholattice is defined by requiring each ♢_i to make ⟨A^X;...,♢_i⟩ a full functional monadic ortholattice. But the full functional monadic ortholattice has one quantifier: (♢f)(x)=⋁{f(x)}. So all ♢_i are literally the same map. Subalgebras inherit that. Corollary 2.23 then claims every δ-free cylindric ortholattice is functional, but any algebra with two distinct commuting quantifiers cannot embed. The stress-test example is enough: take A=2² with ∃_0 on the first coordinate and ∃_1 on the second; they commute and differ. So Corollary 2.23 is false, not just unproved. Theorem 3.13 leans entirely on it, so that proof collapses. The σ-free/δ-free correspondence (Lemmas 3.10–3.11, Theorem 3.12) may well be right, but it cannot supply the missing functional representation.\n\nMinor issues: the proof of Theorem 2.16 cites Corollary 2.14 (it is Lemma 2.14) and says 'meet' where it means 'join.' Cosmetic.\n\nBottom line: the monadic half is publishable. The polyadic half needs a genuinely new definition of functional δ-free cylindric ortholattice, with quantifiers acting on different slices or a product construction, before the claims can be evaluated. As it stands, reject. But do not desk-reject; the monadic theorem deserves a referee and a revision that either removes the polyadic sections or fixes them properly.","headline":"Monadic representation theorem looks right; the polyadic half fails because Definition 2.20 forces all quantifiers equal, so Corollary 2.23 is false.","tokens_in":12011,"tokens_out":4036,"would_cite":true,"duration_ms":44904,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["06C15","03G15","03G25","03G12"],"pacs":[],"model":"deepseek-v4-flash","headline":"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.","keywords":["monadic ortholattices","functional representation","super-amalgamation","MacNeille completion","polyadic ortholattices","cylindric ortholattices","quantifiers","orthologic"],"falsifier":"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.","tokens_in":10875,"feed_emoji":"🧩","tokens_out":12708,"duration_ms":144666,"temperature":0.7,"pith_summary":"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.","feed_headline":"Every monadic ortholattice is a functional one","feed_subtitle":"A recursive super-amalgamation construction settles an open question and yields concrete set-theoretic representations.","key_machinery":"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.","core_discovery":"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.","pith_inferences":["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."],"forward_implications":["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."],"supporting_citations":[{"why":"Defines full functional monadic algebras and proves the Boolean case that this paper generalizes to ortholattices.","marker":"[10]"},{"why":"Supplies the recursive super-amalgamation strategy adapted here for monadic ortholattices.","marker":"[1]"},{"why":"Establishes the amalgamation property for ortholattices, on which the recursive V-formation construction depends.","marker":"[4]"},{"why":"Proves the super-amalgamation property for ortholattices, cited as Theorem 2.9 and used at every recursive step.","marker":"[22]"},{"why":"Constructs MacNeille completions of ortholattices, giving the complete ortholattices used as targets in the representation.","marker":"[20]"},{"why":"Provides the regular completions preserving existing meets and joins used to embed the directed limit into a complete ortholattice.","marker":"[6]"},{"why":"Poses the open question about functional monadic ortholattices that the paper answers.","marker":"[12]"}],"fun_headline_variants":["Monadic ortholattices are all functional, resolving Harding's question","Open question settled: every monadic ortholattice is functional","Functional representation holds for monadic and polyadic ortholattices","Super-amalgamation yields functional monadic ortholattices","All monadic ortholattices are functional; Harding's question is solved"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"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.","fun_headline_variants_meta":{"raw":{"variants":["Monadic ortholattices are all functional, resolving Harding's question","Open question settled: every monadic ortholattice is functional","Functional representation holds for monadic and polyadic ortholattices","Super-amalgamation yields functional monadic ortholattices","All monadic ortholattices are functional; Harding's question is solved"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001372,"raw_usage":{"total_tokens":5518,"prompt_tokens":859,"completion_tokens":4659,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":475,"completion_tokens_details":{"reasoning_tokens":4567}},"tokens_in":475,"tokens_out":4659,"duration_ms":35919,"temperature":1.0,"reasoning_tokens":4567,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-07T05:16:37.833753+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"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.","supporting_citations":[{"cited_title":"Algebra Universalis","cited_arxiv_id":null,"evidence_quote":"Supplies the recursive super-amalgamation strategy adapted here for monadic ortholattices."},{"cited_title":"Order.14, 193 – 209 (1998)","cited_arxiv_id":null,"evidence_quote":"Establishes the amalgamation property for ortholattices, on which the recursive V-formation construction depends."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Proves the super-amalgamation property for ortholattices, cited as Theorem 2.9 and used at every recursive step."},{"cited_title":"Pacific J","cited_arxiv_id":null,"evidence_quote":"Constructs MacNeille completions of ortholattices, giving the complete ortholattices used as targets in the representation."},{"cited_title":"Unpublished man- uscript (1973)","cited_arxiv_id":null,"evidence_quote":"Provides the regular completions preserving existing meets and joins used to embed the directed limit into a complete ortholattice."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Poses the open question about functional monadic ortholattices that the paper answers."}],"review_version":1}