{"id":"33eb49b2-6504-4e36-93b6-8c26e5136129","arxiv_id":"2501.11768","paper_version":2,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"Possibility frames generalize Kripke frames and yield continuum many Kripke-incomplete modal logics that are nevertheless complete for full possibility frames, with duality theory and completeness results for all normal modal logics.","lead":"This mathematics paper develops 'possibility frames', partial-state models for modal logic in which propositions are regular open sets, and proves these frames are strictly more general than standard Kripke frames: continuum many modal logics are Kripke-incomplete yet complete for full possibility frames. It also proves every normal modal logic is complete for a special class of filter-descriptive possibility frames.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Claimed validation of (Split) in §2.5 fails for the admissible valuation p=↓R: the canonical encoding σ_R is empty, so Proposition 2.49 and Theorem 2.50 are not established.","rationale":"The reader accepted with moderate confidence, focusing on the omitted proof of Theorem 2.51. My check of the actual construction found a more immediate problem: the key frame F of §2.5 does not validate (Split) for the admissible valuation p=↓R, because the canonical encoding used to define O− is empty for the unbounded regular open set R. This is not a disagreement with the general possibility-semantics program; the construction may be repairable by moving to a bounded interval or altering the encoding. But as written, Theorem 2.50 is not established, and Theorem 2.51 inherits the gap. I therefore recommend CONDITIONAL rather than ACCEPT: the authors need to fix the construction or explicitly restrict the valuation/space and re-prove Proposition 2.49. If the full paper contains such a restriction elsewhere, the concrete test above would settle whether the concern actually lands.","tokens_in":67359,"tokens_out":26548,"duration_ms":292114,"concrete_test":"Re-run the proof of Proposition 2.49 with π(p)=↓R. Compute ⟦α⟧ on the pair-component following Lemma 2.48: for each nonempty set of pairs σ, the conjunct ¬♦⊊□⊳p is false, because every finite interval can be properly extended inside R. If the computation indeed forces ⟦α⟧=∅, then F ⊮ (Split), confirming the bug. If the authors instead intend to base the frame on a bounded interval or to define σO differently, the same check must be repeated on the amended frame before Theorem 2.50 can be accepted.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The most concrete load-bearing problem is in §2.5, before the deferred polymodal-to-unimodal reduction. The frame F is claimed to validate (Split). Take the admissible valuation π(p) = {O ∈ RO(R) \\ {∅}}, i.e., the first component of S, which is a regular open set in F. Let ψ = ♦⊲⊤. For O = R, we have R R⊲ {(-1,1)} (the interval (-1,1) contains an interval contained in R), so R ⊩ ψ; since p holds at R and Ri is universal, every state forces ♦i(p∧ψ). But under this valuation, for every finite interval (a,b), Lemma 2.47 gives {⟨a,b⟩} ⊩ □⊳p, and also {⟨a,b⟩} ⊩ ♦⊊□⊳p because (a,b) can be properly extended inside R; hence ¬♦⊊□⊳p fails. Therefore α = ♦+⊤ ∧ □+(□⊳p ∧ ¬♦⊊□⊳p) is false at every set of pairs, so ϕ = ♦⊲α is false everywhere on F. Thus the consequent of (Split) is false at every state while the antecedent is true at every state, so F does not validate (Split). The root cause is that the canonical encoding σO in (4) is empty for the unbounded regular open R, so Proposition 2.49 has no value for O = R. This invalidates the proof of Theorem 2.50 as written, and with it the claimed foundation for Theorem 2.51. The separate concern about the cited unimodal reduction remains, but this failure occurs earlier in the argument.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper develops a general semantics for normal modal logics based on partial possibilities rather than total worlds, building on Humberstone's possibility semantics and on connections with weak forcing. It defines possibility frames, studies their model theory (morphisms, special frame classes, interplay conditions between accessibility and refinement), proves duality theorems relating full possibility frames to complete and completely additive BAOs and filter-descriptive frames to all BAOs, and outlines definability and correspondence theory. A central advertised application is the existence of continuum many full possibility frames whose logics are Kripke-frame incomplete, with a concrete polymodal construction in §2.5 and a deferred unimodal version in §7.1.","tokens_in":67672,"tokens_out":14873,"duration_ms":170571,"significance":"If the main results hold, the paper would establish that full possibility frames form a genuinely more general semantics than Kripke frames for normal modal logics, while retaining a well-behaved duality theory. The paper is careful and systematic: it gives explicit first-order conditions for the basic semantic closure properties, provides concrete frame constructions, develops categorical dualities for several classes of frames, and obtains a choice-free filter representation of BAOs. These are valuable contributions independent of the specific incompleteness example. However, the flagship example in §2.5 appears to be incorrect as it stands, and because Theorem 2.50 and the promised Theorem 2.51 rest on it, the advertised completeness claim is not currently established.","major_comments":[{"comment":"The claim that the frame F validates (Split) is false. Consider the admissible valuation π(p) = RO(R) \\ {∅}; this set is ↓R in the frame, hence regular open and admissible, and it satisfies ⟦p⟧ ∩ RO(R) = ↓R with O = R. But by (4), σ_R = ∅, and by (5), R⁻ = ∅, which is not an element of S. Under this valuation, for every finite interval (a,b), Lemma 2.47 gives {⟨a,b⟩} ⊩ □⊳p, and since (a,b) can be properly extended to an interval still contained in R, we also have {⟨a,b⟩} ⊩ ♦⊊□⊳p; hence ¬♦⊊□⊳p fails at every singleton. The conjunct ♦+⊤ fails at every regular open, so ⟦α⟧ = ∅, and Lemma 2.46 then gives ⟦♦⊲α⟧ = ∅ rather than ↓R. Thus the consequent of (Split) is false at every state, while the antecedent is true at every state (take y′ = R as the universal Ri-successor). Therefore F does not validate (Split), and Theorem 2.50, which builds on this example, is not established as written.","section":"§2.5, Lemma 2.46 and Proposition 2.49"},{"comment":"The unimodal continuum result is stated with its proof deferred to Section 7 and described as following from Theorem 2.50, the duality theory, and 'known results about polymodal-to-unimodal reduction'. No specific reduction is identified in the material before Section 5, and no preservation statement is given for the two properties that matter: Kripke-frame incompleteness and being characterized by full possibility frames. Even after the polymodal construction in §2.5 is repaired, the unimodal theorem would require explicit preservation lemmas for the cited reduction. As presented, the headline unimodal claim is therefore conditional on facts that are not stated.","section":"§2.5, Theorem 2.51"}],"minor_comments":[{"comment":"For a < b, the expression b + |a−b|/2 is strictly greater than b, so the set O⁻ defined in (5) is not a strict subset of O; the text's assertion that 'O⁻ ⊊ O' is false as printed. The intended operation is presumably b − |a−b|/2 (or the midpoint), and the formula should be corrected consistently in (5), Lemma 2.48, and the definition of R+.","section":"Equation (5) and surrounding text"},{"comment":"The notation σ_O in (4) is empty for unbounded regular opens such as O = R, since R contains no maximal open subinterval. The construction should either restrict attention to bounded regular opens or explicitly handle this case; as it stands, the 'shrinking' step is undefined for the admissible proposition ↓R.","section":"§2.5, canonical encoding for unbounded O"}],"recommendation":"major_revision","confidential_remarks":"The §2.5 example is the paper's advertised first proof that full possibility frames can characterize Kripke-incomplete logics, and that proof is currently wrong in a definable model. The rest of the paper—especially the duality theory of §5 and the general completeness results—appears largely independent and may well be salvageable. I would like to see a corrected construction or a reworking of the argument before acceptance; if the construction cannot be repaired, the advertised completeness claim would need to be withdrawn or substantially weakened."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear colleague,\n\nThe paper is a major systematic development of possibility semantics. The duality theory (Sections 5–6), the filter-descriptive frames, and the Sahlqvist correspondence results look careful and genuinely extend the modal logic toolkit. The author knows the literature, and the proofs I checked are detailed and mostly consistent. That said, the headline example—the full possibility frame with no Kripke equivalent—has a serious flaw. The stress-test note is right: for the admissible valuation p = ↓R (all nonempty regular open subsets of R), the canonical encoding σ_R is empty because R has no maximal open intervals. Consequently O^- = ∅, α is false everywhere, and the formula (Split) is not validated. The antecedent is true at every state (Ri is universal and R forces p ∧ ♦⊲⊤), but the consequent is false. So the proof of Theorem 2.50 fails as written, and Theorem 2.51 leans on it. This is not a minor gap: the claim of continuum many Kripke-incomplete logics for full possibility frames is the paper's main advertised novelty.\n\nThe rest of the paper may well survive—the duality between filter-descriptive possibility frames and all BAOs, and the completeness results for Sahlqvist logics, seem independent of this construction. But §2.5 needs repair (e.g., restricting to bounded regular opens or redefining the encoding) before the completeness claims can be accepted.\n\nWho is this for? Modal logicians and algebraically minded logicians will find useful material in the duality and correspondence sections. The paper deserves a serious referee, but the referee should be asked to scrutinize §2.5 carefully. The current version cannot be accepted as is.\n\nRecommendation: send to peer review with a request for major revision; the flaw is concrete and fixable, but the paper is not ready in its current form.","headline":"The paper's flagship Kripke-incompleteness example has a load-bearing flaw: under the admissible valuation p = ↓R, the canonical encoding σ_R is empty, so the frame does not validate (Split), and Theorems 2.50–2.51 are not established as written.","tokens_in":68202,"tokens_out":7225,"would_cite":false,"duration_ms":69582,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["03B45","03G05"],"pacs":[],"model":"deepseek-v4-flash","headline":"Possibility frames built from partial states give a strictly more general normal modal semantics than Kripke frames, characterizing continuum many unimodal logics that are Kripke-frame incomplete.","keywords":["modal logic","possibility semantics","partial possibilities","Boolean algebras with operators","duality theory","regular open algebras","Kripke-frame incompleteness","forcing semantics"],"falsifier":"Concretely, apply the cited polymodal-to-unimodal reduction to the polymodal frames of the paper's continuum construction and compute whether the resulting unimodal logics remain pairwise distinct and Kripke-incomplete; if any reduced logic is Kripke-complete, or if the continuum many frames collapse to only finitely many reduced logics, then the unimodal theorem fails. A searchable test is whether a formula valid on the reduced unimodal frame would force a first-order condition such as seriality or reflexivity on every Kripke frame validating it, making the reduced logic Kripke-incomplete while still full-possibility-sound.","tokens_in":67136,"feed_emoji":"♾️","tokens_out":10673,"duration_ms":106514,"temperature":0.7,"pith_summary":"The paper's central claim is that interpreting modal formulas over partial possibilities instead of total worlds yields a strictly more general frame semantics for normal modal logic. In the basic unimodal language, the paper asserts there are continuum many pairwise distinct normal modal logics that are characterized by full possibility frames but not by any Kripke frame. This matters because Kripke-frame incompleteness has often been treated as a defect of a logic; the result shows it is not a barrier to having a natural frame characterization. The paper also develops the three pillars of modal model theory for this semantics—duality, definability and correspondence, and completeness—anchored by a duality between full possibility frames and complete, completely additive Boolean algebras with operators.","feed_headline":"Continuum many logics escape Kripke frames","feed_subtitle":"Full possibility frames characterize continuum many unimodal logics that are incomplete over Kripke frames.","key_machinery":"The central object is a possibility frame $\\mathcal{F}=\\langle S,\\sqsubseteq,\\{R_i\\},P\\rangle$, where $S$ is a poset of partial states, each $R_i$ is an accessibility relation, and $P$ is a set of admissible propositions contained in the regular open sets $\\mathrm{RO}(S,\\sqsubseteq)$. An admissible proposition is persistent—true at a state implies true at all refinements—and refinable—if false at a state, some refinement excludes it in every further refinement; topologically this means $X=\\mathrm{int}(\\mathrm{cl}(X))$ in the Alexandrov downset topology. Full possibility frames take $P=\\mathrm{RO}(S,\\sqsubseteq)$, and the condition $R\\Leftrightarrow \\mathrm{win}$, which says that accessibility is equivalent to a winning strategy in a refinement game, characterizes exactly when this choice is closed under the modal operation $\\blacksquare_i$. The argument is carried by duality functors: the algebra of a frame is its regular open algebra with completely additive operators, and the frame of an algebra is its poset of proper filters (or the algebra minus its bottom element), so algebraic constructions translate into relation-on-poset constructions.","core_discovery":"The core discovery is that full possibility frames are to complete, completely additive Boolean algebras with operators (CV-BAOs) what Kripke frames are to the atomic ones: dropping atomicity is exactly what makes the frame semantics broader. On this basis the paper proves that there are continuum many full possibility frames for the polymodal language whose logics are pairwise distinct and Kripke-frame inconsistent, and it states the unimodal analogue: continuum many full possibility frames whose logics are pairwise distinct and Kripke-frame incomplete. The technical heart is a frame-theoretic rendering of an algebraic construction of complete, completely additive BAOs with no atomic members, using a splitting formula that is valid because a partial state can split a proposition into two incompatible refinements, something a single world cannot do. The paper further proves that every normal modal logic is complete with respect to its filter-descriptive possibility frame built from proper filters rather than ultrafilters, a choice-free construction.","pith_inferences":["Inference: If the polymodal-to-unimodal reduction used in the unimodal theorem is as robust as the paper expects, the splitting phenomenon offers a blueprint for turning other Kripke-incomplete logics into full-possibility-complete ones; one could test this by searching for a pure unimodal formula analogous to the polymodal splitting formula.","Inference: The hierarchy of completeness notions implicit in the paper suggests that the lattice of normal modal logics between the Kripke-complete ones and all normal modal logics may be stratified by which non-atomic algebraic constructions are admitted, giving a concrete order in which to look for separating logics.","Inference: Because the filter-descriptive representation avoids the ultrafilter axiom, the canonical completeness proof could in principle be formalized in weak set theories, a consequence the paper does not itself draw.","Inference: The original, more restrictive definition of possibility frames remains an open endpoint: if it is as general as the full frames studied here, the broader regular-open definition is harmless; if not, the choice of frame condition is itself a substantive semantic commitment."],"forward_implications":["Any logic complete with respect to Kripke frames is automatically complete with respect to full possibility frames, since every Kripke frame is a full possibility frame with a discrete refinement order.","There are continuum many pairwise distinct normal unimodal logics that are Kripke-frame incomplete yet characterized by full possibility frames, so Kripke incompleteness is not an obstacle to having a frame-based semantics.","All normal modal logics are sound and complete with respect to filter-descriptive possibility frames, and this completeness is obtained without relying on the ultrafilter axiom.","Every Sahlqvist logic has an atomless full possibility frame—a frame with no worlds—so the usual completeness guarantees for these logics can be witnessed entirely by partial possibilities.","The correspondence theory over full possibility frames has analogues of the classical first-order correspondence results, so modal formulas in the usual Sahlqvist form define first-order frame classes in this setting as well."],"supporting_citations":[{"why":"Originates the partial-possibility semantics that this paper generalizes, supplying the initial definition of frames based on possibilities rather than worlds.","marker":"Humberstone [1981]"},{"why":"Defines the world-based frame semantics that possibility frames extend and that the Kripke-incompleteness theorems measure against.","marker":"Kripke [1963]"},{"why":"Establishes the duality between Kripke frames and atomic complete completely additive BAOs that this paper generalizes by dropping atomicity.","marker":"Thomason [1975a]"},{"why":"Gives the descriptive world-frame duality for all BAOs, the model for the paper's filter-descriptive possibility-frame duality.","marker":"Goldblatt [1974]"},{"why":"Constructs complete completely additive BAOs with no atomic members, the algebraic construction whose frame version yields the Kripke-incomplete full possibility frames.","marker":"Litak [2005a]"},{"why":"Shows every syntactically consistent normal unimodal logic is Kripke-frame consistent, which is why the unimodal incompleteness result must be a genuine extension rather than an artifact of consistency.","marker":"Makinson [1971]"},{"why":"Characterizes modally definable classes of full Kripke frames, serving as the template for the paper's definability results over full possibility frames.","marker":"Goldblatt and Thomason [1975]"},{"why":"Supplies the correspondence method whose possibility-semantic version guarantees that Sahlqvist logics have atomless full possibility frames.","marker":"Sahlqvist [1975]"},{"why":"Provides the equality between completeness with respect to full possibility frames and completeness with respect to CV-BAOs, used to transfer the algebraic hierarchy into the frame hierarchy.","marker":"Holliday and Litak [2019]"}],"fun_headline_variants":["Partial possibilities outrun Kripke worlds","Kripke-incomplete logics find a home","Continuum many modal logics escape worlds","Beyond worlds: continuum of logics","Split states yield broader modal semantics"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the polymodal-to-unimodal reduction invoked for the unimodal theorem preserves both Kripke-frame incompleteness and characterizability by full possibility frames, a fact the supplied text cites but does not prove.","fun_headline_variants_meta":{"raw":{"variants":["Partial possibilities outrun Kripke worlds","Kripke-incomplete logics find a home","Continuum many modal logics escape worlds","Beyond worlds: continuum of logics","Split states yield broader modal semantics"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000137,"raw_usage":{"total_tokens":1110,"prompt_tokens":867,"completion_tokens":243,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":483,"completion_tokens_details":{"reasoning_tokens":177}},"tokens_in":483,"tokens_out":243,"duration_ms":3465,"temperature":1.0,"reasoning_tokens":177,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T17:53:52.241738+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Concretely, apply the cited polymodal-to-unimodal reduction to the polymodal frames of the paper's continuum construction and compute whether the resulting unimodal logics remain pairwise distinct and Kripke-incomplete; if any reduced logic is Kripke-complete, or if the continuum many frames collapse to only finitely many reduced logics, then the unimodal theorem fails. A searchable test is whether a formula valid on the reduced unimodal frame would force a first-order condition such as seriality or reflexivity on every Kripke frame validating it, making the reduced logic Kripke-incomplete while still full-possibility-sound.","supporting_citations":[{"cited_title":"From Worlds to Possibilities","cited_arxiv_id":null,"evidence_quote":"Originates the partial-possibility semantics that this paper generalizes, supplying the initial definition of frames based on possibilities rather than worlds."},{"cited_title":"Some Embedding Theorems for Modal Logic","cited_arxiv_id":null,"evidence_quote":"Shows every syntactically consistent normal unimodal logic is Kripke-frame consistent, which is why the unimodal incompleteness result must be a genuine extension rather than an artifact of consistency."},{"cited_title":"Completeness and Correspondence in the First and Second Order Semantics for Modal Logic","cited_arxiv_id":null,"evidence_quote":"Supplies the correspondence method whose possibility-semantic version guarantees that Sahlqvist logics have atomless full possibility frames."}],"review_version":1}