{"id":"aff359e9-b071-4ffd-9d50-43d6128f3a85","arxiv_id":"2412.00356","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":1,"one_line_summary":"Sorites no-sharp-cutoff claims are satisfiable in orthologic and fundamental logic, making fundamental logic a candidate common base for epistemic-modality and vagueness phenomena.","lead":"This logic paper studies whether changing our basic rules of reasoning can make the gray areas of vague words consistent with our firm beliefs about the extremes. It argues that a very weak logic, called fundamental logic, naturally handles both epistemic modals like 'might' and sorites-style vagueness.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Fact 10 misstates the extension of the conjunction of excluded middle: the state (−∞, n−1) does not force p0∨¬p0; the correct second state is (−∞, 0). The central consistency results stand, but the printed support for the global-indeterminacy claim needs correction.","rationale":"The reader's weakest-assumption analysis focused on the paper's reliance on [24] for the rejection of distributivity. That is a real philosophical presupposition, but the paper explicitly flags it and the formal consistency results are independent of it. My concern is internal and more specific: Fact 10, which is part of the formal support for the fundamental-logic approach, contains a false equality. Recomputing the extension of the conjunction of excluded middle shows that (−∞, n−1) is not in the extension while (−∞, 0) is. This is a concrete, checkable error in a displayed theorem, not a matter of philosophical taste. It does not undermine the central consistency results in Facts 4, 5, and 8, so rejection would be disproportionate. But because Fact 10 is used to argue for the distinctive expressive benefits of fundamental logic over orthologic, the paper should be accepted only after the correction is made and the surrounding text is checked for downstream reliance on the wrong state.","tokens_in":18132,"tokens_out":14617,"duration_ms":136618,"concrete_test":"Fix n=4, δ=1 and compute extensions directly from Facts 6, 7, and 9. Verify: (i) (−∞,3) fails p0∨¬p0 because 0⊳(−∞,3) and for every y⊲0, y∉⟦p0⟧∪⟦¬p0⟧; (ii) (−∞,0) forces every pk∨¬pk because 0≤k for all k∈{0,1,2,3}; (iii) the extension of the conjunction is exactly {(3,∞),(−∞,0)} and its negation is exactly the finite-coordinate states in S. If this recomputation confirms the correction, amend Fact 10's first equality and verify that the §7 discussion of global indeterminacy still goes through unchanged.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"Fact 10 claims ┌(p0∨¬p0)∧…∧(pn−1∨¬pn−1)┐ has extension {(n−1,∞), (−∞,n−1)} in S_{n,δ}. This is false as stated. By Fact 9, the extension of pk∨¬pk is {(i,j)∈S | k≤i or j≤k}. Take n≥2 and the state (−∞,n−1): for k=0, neither 0≤−∞ nor n−1≤0 holds, so (−∞,n−1)∉⟦p0∨¬p0⟧. Concretely, 0⊳(−∞,n−1) by Definition 12.3, and no y⊲0 forces p0 or ¬p0, so the disjunction is not forced. The correct second state is (−∞,0), since j=0≤k for every k∈n. With that correction, the second equality in Fact 10—that the negation of the conjunction is forced exactly at states with finite coordinates—remains true. Thus the error appears to be a one-symbol typo rather than a collapse of the construction. Facts 4 and 5, and the satisfiability/consistency results for orthologic, compatibility logic, and fundamental logic, are unaffected. However, Fact 10 is explicitly cited as exhibiting Fine's 'global' indeterminacy claim and is included in the reader's strongest claim, so it should not stand as printed.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper investigates which non-classical base logic for conjunction, disjunction, and negation can accommodate two sources of non-classicality: epistemic modals, which according to earlier work motivate dropping distributivity and moving to orthologic, and vagueness, which has motivated weakening classical logic along intuitionistic or Finean lines. It recalls the systems of fundamental logic, orthologic, compatibility logic, intuitionistic logic, and classical logic, together with relational fixed-point models. The paper's main formal contribution is a symmetric Sorites model S_{n,δ} in which the extremes p0 and ¬p_{n−1} together with all no-sharp-cutoff claims ¬(p_k∧¬p_{k+ℓ}) are jointly forced (Fact 4), yielding consistency in orthologic and compatibility logic (Fact 5). It then defines a pseudosymmetric model S_{n,δ} in which excluded middle instances are no longer tautologies but express settledness, and Facts 6–10 show the corresponding consistency in fundamental logic. The paper argues that fundamental logic is a natural common weakening and includes a discussion of costs and benefits relative to orthologic, including the Gödel–Gentzen embedding of orthologic into fundamental logic.","tokens_in":18466,"tokens_out":21692,"duration_ms":186717,"significance":"If the main model-theoretic results stand, the paper gives a clear and explicit demonstration that the Sorites constellation 'extremes plus no sharp cutoffs' does not force classical or intuitionistic logic, and that the retreat to orthologic or fundamental logic is coherent. The constructions are transparent, the main facts are proved directly, and the paper is candid about its reliance on the epistemic-modal data of [24], which it explicitly takes as a premise rather than re-deriving. The paper therefore makes a solid contribution to the debate on the right non-classical base logic for vagueness and epistemic modals, even though the philosophical conclusions are appropriately conditional and the completeness theorems for compatibility logic are only sketched.","major_comments":[{"comment":"Fact 10 as printed is false. By Fact 9, the extension of p0∨¬p0 is {(i,j)∈S | 0≤i or j≤0}. For n≥2 the state (−∞,n−1) satisfies neither disjunct, so it does not force p0∨¬p0 and hence cannot belong to the extension of the conjunction of all instances of excluded middle. The correct second state is (−∞,0), since j=0≤k for every k∈n. With that correction, the second equality—that the negation of the conjunction is forced exactly at the states with finite coordinates—does hold; as printed, that equality also fails, because (−∞,0) is related to (−∞,n−1) and would therefore not lie in the indicated set. Because Fact 10 is cited in §7 as the model-theoretic witness of Fine's 'global indeterminacy' point, it should be corrected before publication. This is a local one-symbol error: Facts 4–9 and the consistency results for orthologic, compatibility logic, and fundamental logic are unaffected.","section":"§6, Fact 10"}],"minor_comments":[{"comment":"The rule of proof-by-cases with side assumptions is misprinted: the conclusion should be α∧(ϕ∨ψ)⊢χ, not α∧(ϕ∨ψ)⊢ψ. As written, the rule does not match the informal description or the intended notion of compatibility logic.","section":"§2, after Definition 2"},{"comment":"The word 'psuedocomplementation' should be 'pseudocomplementation'.","section":"§2, after Definition 2"},{"comment":"In the second equation, the forward direction only considers successors (i′,j′) in S, but the frame also contains the integer states ℓ∈n, and Definition 12.4 makes (i,j)⊳ℓ for every ℓ. The proof should explicitly note that no integer state forces ¬pk (because (k,∞)⊳ℓ and (k,∞)⊩pk); the claim is true, but the proof as written is incomplete.","section":"§6, proof of Fact 7"},{"comment":"The completeness proof for compatibility logic is only a sketch; since these theorems are not needed for the central satisfiability results, this is acceptable, but a little more detail on why the Stone representation preserves weak pseudocomplementation would improve self-containedness.","section":"§4, Theorems 4 and 5"}],"recommendation":"minor_revision","confidential_remarks":"The paper is a good fit for the journal and the central consistency results are sound. The Fact 10 error is a typo that must be fixed, but it does not undermine the main claims. The reliance on the author's own earlier systems is transparent and appropriate for this line of work."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"You should know two things upfront. First, the paper’s central formal claim is right: the symmetric model in §5 makes the no-sharp-cutoff conjunction satisfiable in orthologic and compatibility logic, and the pseudosymmetric model in §6 extends this to fundamental logic. I checked the constructions and the proofs; they are explicit and hold. Second, Fact 10 as printed is wrong. The stress-test note is correct: the extension of the conjunction of excluded-middle instances is not {(n−1, ∞), (−∞, n−1)}; the second state should be (−∞, 0). The rest of Fact 10, including the extension of the negated conjunction, survives that one-symbol fix. This looks like a typo, not a flaw in the model, but it appears in the passage used to illustrate Fine’s “global indeterminacy” claim, so it should not stand as printed.\n\nWhat is actually new: the explicit relational models for Sorites series, and the direct comparison of orthologic, compatibility logic, and fundamental logic on those models. The author shows that giving up distributivity and giving up excluded middle are two different ways to make the Sorites premises consistent, and that a weaker system can combine the two. The proof sketches for Theorems 4 and 5 are genuinely sketches, not full proofs, but the key model-theoretic facts are proved directly and the cited completeness results are background, so this is a minor soft spot, not a load-bearing one.\n\nThe largest philosophical soft spot is acknowledged in §7: the case against distributivity is imported wholesale from Holliday–Mandelkern’s epistemic-modals work. If you do not accept that data, the motivation for orthologic and hence fundamental logic needs a different basis. The author says this explicitly, and the formal results do not depend on resolving that debate.\n\nThe paper does not claim to have settled the main question, and it hedges appropriately. It is a clear, honest contribution to philosophical logic, aimed at readers working on non-classical logic, vagueness, and epistemic modals. With the Fact 10 correction, it deserves a serious referee and likely publication after minor revision.","headline":"Solid new models for the Sorites in orthologic, compatibility logic, and fundamental logic; the central consistency results hold, and Fact 10 has a one-character typo that should be fixed before publication.","tokens_in":18973,"tokens_out":3794,"would_cite":true,"duration_ms":35310,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03B20","03B45","03B60"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper establishes that the Sorites premises—extremes plus denial of sharp cutoffs—are jointly consistent in orthologic and in fundamental logic, so the paradox does not force classical or intuitionistic logic, and fundamental logic is…","keywords":["Sorites paradox","vagueness","orthologic","fundamental logic","compatibility logic","epistemic modals","non-classical logic","excluded middle"],"falsifier":"A robust experimental demonstration that ordinary speakers accept sentences of the form '$φ$ and might not $φ$' as assertable without sarcasm or irony would falsify the paper's central motivation, since the rejection of distributivity—the ground for orthologic and fundamental logic—depends on those sentences being contradictions.","tokens_in":17924,"feed_emoji":"🧩","tokens_out":7962,"duration_ms":70735,"temperature":0.7,"pith_summary":"Vague predicates like 'young' generate a paradox when we assert the extremes and deny any sharp cutoff. The paper asks what logic we should retreat to if we also accept that epistemic modals like 'might' invalidate the distributive laws. It tries to establish that these Sorites premises are jointly satisfiable in orthologic (logic without distributivity) and in fundamental logic (which further drops excluded middle), and that the latter offers the most natural common base. The paper works by building explicit relational models with partial states, one symmetric and one pseudosymmetric, in which the offending conjunction is forced at a distinguished state.","feed_headline":"Sorites stays consistent when logic drops distributivity","feed_subtitle":"A pair of models shows the paradox's core claims are jointly satisfiable in orthologic and fundamental logic.","key_machinery":"The central object is a relational model with an 'openness' relation $\\mathrel{\\rhd}$, read as 'x does not reject any proposition that y accepts.' A valuation is required to be a fixed point of the closure operator $c_\\rhd(A)=\\{x : \\forall x'\\rhd x\\ \\exists x''\\lhd x' \\text{ with } x''\\in A\\}$, which makes every formula's truth set a fixed point. Negation is interpreted as rejection along open states, and disjunction as the closure of the union, so a disjunction can be forced without either disjunct already being forced. In the Sorites models, states are pairs $(i,j)$ with $i+\\delta<j$; the reflexive-symmetric symmetric model validates orthologic, and the pseudosymmetric model adds states $k$ for which $p_k\\vee\\neg p_k$ is rejected, validating fundamental logic. The spacing constraint $i+\\delta<j$ is the workhorse: it forces $\\neg(p_k\\wedge\\neg p_{k+\\ell})$ for every $\\ell\\le\\delta$, yielding the no-sharp-cutoff conjuncts.","core_discovery":"On the paper's own terms, the central discovery is that the formula $p_0 \\wedge \\neg p_{n-1} \\wedge \\bigwedge \\neg(p_k \\wedge \\neg p_{k+\\ell})$ is satisfiable, not only in classical or intuitionistic semantics, but in orthologic and in fundamental logic. The symmetric Sorites model uses states $(i,j)$ with $i+\\delta<j$, letting $i$ mark the last predicate that holds and $j$ the first that is negated, so the gap $\\delta$ blocks sharp cutoffs of length up to $\\delta$. Since the model is reflexive and symmetric, it is a model of orthologic; with no constraints on the valuation beyond the fixed-point property, it also serves the compatibility semantics for weak pseudocomplementation. The pseudosymmetric model adds one state per $k$ that rejects $p_k\\vee\\neg p_k$, so the same formula stays consistent while excluded middle acquires expressive content, marking exactly where the series has a fact of the matter. The paper concludes that fundamental logic—obtained by dropping both distributivity and double-negation elimination—accommodates the non-classicality of epistemic modals and of vagueness together.","pith_inferences":["The $\\delta$ gap that limits sharp cutoffs is a free parameter; fitting it to psychophysical just-noticeable differences could turn the model into a quantitative account of granularity in vague predicates.","The paper's dual treatment suggests a unified picture: both 'might' contradictions and sharp cutoffs are states that block common refinement, so one semantic notion of openness handles modal and vagueness incompatibility.","If fundamental logic becomes the base, then $p\\vee\\neg p$ becomes an expressive assertion about determinacy; this could give a formal language for debates about whether certain mathematical or metaphysical questions have an objective answer."],"forward_implications":["The Sorites premises are satisfiable in orthologic and compatibility logic, so denying distributivity is a sufficient logical response to the paradox.","The same premises are satisfiable in fundamental logic, so the paradox does not require accepting excluded middle.","In the fundamental approach, each instance of excluded middle $p_k\\vee\\neg p_k$ is forced exactly at states that settle the $k$-th item, giving a formal way to express 'there is a fact of the matter' versus 'no fact of the matter.'","The conjunctive and disjunctive versions of the Sorites behave differently in the fundamental treatment: $\\neg(p_k\\wedge\\neg p_{k+1})$ is forced everywhere, but $\\neg p_k\\vee p_{k+1}$ is not, so one can accept the former without the latter.","The Gödel–Gentzen translation embeds orthologic faithfully into fundamental logic, so moving to fundamental logic loses no orthological reasoning."],"supporting_citations":[{"why":"Argues that distributivity is invalid for a language with epistemic modals, motivating orthologic as the base logic; the paper takes this for granted.","marker":"[24]"},{"why":"Develops the global approach to vagueness and the logic of weak pseudocomplementation, which the paper builds on for compatibility logic and the no-sharp-cutoff idea.","marker":"[12]"},{"why":"Defines fundamental logic, its Fitch-style proof theory, its pseudosymmetric semantics, and the Gödel–Gentzen embedding used in the discussion.","marker":"[21]"},{"why":"Provides the soundness and completeness of orthologic with respect to reflexive-symmetric relational models.","marker":"[17]"},{"why":"Supplies the Stone representation used in the completeness proof for compatibility logic.","marker":"[30]"}],"fun_headline_variants":["Sorites paradox survives in orthologic and fundamental logic","No sharp cutoffs: how weaker logics keep the heap consistent","Quantum-style logic also handles vague predicates","Fundamental logic: a home for epistemic modals and vagueness","Dropping distributivity leaves the Sorites consistent"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The paper takes for granted the arguments that 'It's raining and it might not be raining' is a contradiction, and that this undermines the distributive laws; if those natural-language data are wrong, the case for orthologic and fundamental logic as the base for vagueness loses its footing.","fun_headline_variants_meta":{"raw":{"variants":["Sorites paradox survives in orthologic and fundamental logic","No sharp cutoffs: how weaker logics keep the heap consistent","Quantum-style logic also handles vague predicates","Fundamental logic: a home for epistemic modals and vagueness","Dropping distributivity leaves the Sorites consistent"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000668,"raw_usage":{"total_tokens":3048,"prompt_tokens":946,"completion_tokens":2102,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":562,"completion_tokens_details":{"reasoning_tokens":2021}},"tokens_in":562,"tokens_out":2102,"duration_ms":13726,"temperature":1.0,"reasoning_tokens":2021,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T05:27:40.118179+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A robust experimental demonstration that ordinary speakers accept sentences of the form '$φ$ and might not $φ$' as assertable without sarcasm or irony would falsify the paper's central motivation, since the rejection of distributivity—the ground for orthologic and fundamental logic—depends on those sentences being contradictions.","supporting_citations":[{"cited_title":"Oxford Universi ty Press, New York (2020)","cited_arxiv_id":null,"evidence_quote":"Develops the global approach to vagueness and the logic of weak pseudocomplementation, which the paper builds on for compatibility logic and the no-sharp-cutoff idea."},{"cited_title":"Časopis pro pěstování matematiky a fysiky 67(1), 1–25 (1938)","cited_arxiv_id":null,"evidence_quote":"Supplies the Stone representation used in the completeness proof for compatibility logic."}],"review_version":1}