Modal predicate logic beyond Barcan: constant domains, constructive semantics, and proof search
A mid-July 2026 digest of four arXiv papers on constant-domain semantics, constructive modal models, fair proof search, and intuitionistic dynamic logic—and what they do and do not imply for BF, CBF, necessitism, and contingentism.
What changed in the mid-July batch
The most useful new papers around quantified modality do not deliver another headline verdict for necessitism or contingentism. Instead, they make the background machinery harder to ignore: what counts as a constant domain, how modal semantics can be constructed without classical reasoning, and how proof search should explore a semi-decidable space. Four arXiv items posted from July 13 to July 15, 2026 make that shift visible. 1234
The direct payoff for modal predicate logic is therefore diagnostic rather than doctrinal. Before reading
∀x □φ(x) → □∀x φ(x) (the Barcan formula, BF) or □∀x φ(x) → ∀x □φ(x) (the converse Barcan formula, CBF) as evidence for a metaphysical position, one must say what the worlds are, how D(w) varies, which assignments are permitted, and whether existence is represented by a predicate or by membership in the current domain.The test case: constant domain is not automatically Barcan
A useful first separation is between two principles that share the phrase “constant domain” but live in different logical settings. The intuitionistic constant-domain axiom discussed by Marquès is
∀a (φ(a) ∨ ψ) → ((∀a φ(a)) ∨ ψ) (CD)It governs the interaction between universal quantification and disjunction. BF and CBF govern the interaction between universal quantification and a modal operator. CD is therefore not itself BF or CBF, and a topos-theoretic semantics for CD does not by itself settle which Barcan formula is valid in a quantified modal logic. 1
For a Kripke model with worlds
W, accessibility R, and domains D(w), the familiar pressure point is the relation between D(w) and D(v) whenever wRv. A claim about BF or CBF is incomplete until that relation, the interpretation I, and the treatment of non-existing objects are explicit. The four papers below attack different parts of this specification problem.| Item | What it adds | What it does not establish |
|---|---|---|
| The Constant Domain Axiom in Toposes | A categorical account of constant-domain intuitionistic semantics | No new BF/CBF theorem and no argument for necessitism or contingentism |
| Cover Semantics for Intuitionistic Modalities | A constructive modal semantics with an Agda formalization | No first-order domain theorem is claimed in the abstract |
| A Strategy Language for Controlled Proof Search | A fair-search language tested in first-order and modal logics | The abstract does not report a new QML completeness result |
| Intuitionistic Dynamic Logic | Proof systems and dynamic Kripke semantics for five intuitionistic modal logics | It is a thesis about intuitionistic/dynamic systems, not a necessitism–contingentism analysis |
The comparison is intentional: only the first item is directly about a constant-domain principle, while the other three are neighboring results that change how one might formalize, automate, or generalize modal reasoning.
1. A categorical home for constant-domain intuitionistic logic
Paper: Jérémie Marquès, The Constant Domain Axiom in Toposes (arXiv preprint, submitted July 14; three pages). Read the original paper.
Contribution. The note starts from the standard presheaf semantics in which sorts are interpreted as constant presheaves and predicates as arbitrary sub-presheaves. It then replaces the special role of constant presheaves with a class of objects that are covert and decidable—the paper’s “CD objects,” where decidability is presented through the Hausdorff condition for the associated discrete locale. 1
Formal mechanism. The CD objects in any topos form a Boolean pretopos, are closed under complemented subobjects, and support closed maps between them. In a presheaf topos
Set^C, the paper identifies the bridge back to the usual picture: a presheaf is covert exactly when it is valued in surjective maps, and it is CD exactly when it is valued in bijective maps. 1Why it matters for the Barcan debate. This result isolates a domain discipline before a modal operator is even added. It explains why “constant domain” should not be treated as a free-standing metaphysical label: in this setting it is a semantic restriction on the objects over which quantification ranges. The paper also notes a real boundary. If CD were imposed uniformly over all fibers in a topos, the logic would collapse to Boolean logic; the semantics therefore needs a distinguished class of admissible sorts. 1
Scope. This is a short categorical semantics note, not a result about
□, BF, CBF, rigid designation, or the truth of necessitism. Read it first if you want to know what “constant domain” can mean constructively before importing it into a quantified modal model.2. Modal semantics without the classical shortcut
Paper: Nachiappan Valliappan, Cover Semantics for Intuitionistic Modalities (arXiv preprint, submitted July 13; presented at MFPS 2026). Read the original paper.
Contribution. Intuitionistic modal logic is often given a relational Kripke semantics because relational models make completeness constructions convenient. Valliappan’s paper targets the cost of that convenience: classical reasoning is unattractive when the intended metatheory is constructive or when the semantics is to be formalized in constructive type theory. 2
Formal mechanism. The paper extends Beth–Kripke–Joyal-style cover semantics with relations for modalities. It presents a conservative extension of Goldblatt’s relational cover semantics that removes the earlier “modal localization” restriction, then formalizes the semantics in Agda and proves completeness constructively, in a normalization-by-evaluation style, for several intuitionistic modal logics with independent box and diamond modalities. 2
Why it matters for quantified modality. The paper does not claim a first-order Barcan theorem in its abstract, and it should not be advertised as one. Its relevance is methodological: a semantics can keep
□ and ◇ distinct while avoiding a classical model-building shortcut. That matters whenever a quantified modal argument depends on the metatheory used to construct worlds, assignments, or existence conditions.Scope. The reported systems are intuitionistic modal logics, not a direct necessitism–contingentism dispute. The strongest reason to read it is if your concern is constructive semantics, proof formalization, or what completeness should mean when classical reasoning is not available.
3. Separating proof rules from proof-search policy
Paper: Romain Sidhoum, Simon Robillard, David Delahaye, and coauthors, A Strategy Language for Controlled Proof Search (arXiv version submitted July 14; journal reference EPTCS 448, 2026, pp. 58–64). Read the original paper.
Contribution. Pgeon is a meta-prover built around a clean separation between inference rules and the policy used to search for a proof. The paper gives strategies a semantics as functions on proof states and supplies operators for sequential composition, choice, repetition, and interleaving. 3
Formal mechanism. The target is fair proof search in semi-decidable logics, where a naive depth-first traversal can fail to find a proof even when one exists. The paper illustrates the language through case studies in first-order and modal logics. That is a meaningful connection to quantified modal logic: the object-level calculus and the search schedule can be inspected separately instead of being conflated in one opaque prover. 3
What a reader should not infer. The abstract does not report a new completeness theorem for a quantified modal system, nor does it establish that any particular treatment of BF or CBF is sound. The contribution is infrastructure for controlling proof search; the logic-specific guarantees still have to be checked for the calculus and semantics under study.
Scope. Read it if your question is how to mechanize modal or first-order reasoning without treating automation as a black box. For a metaphysical argument, it is background technology rather than evidence for either necessitism or contingentism.
4. A broader intuitionistic-dynamic package
Paper: Lukas Zenger, Intuitionistic Dynamic Logic (PhD thesis, arXiv version submitted July 15). Read the original thesis.
Contribution. The thesis develops five intuitionistic dynamic logics: intuitionistic master modality, intuitionistic common knowledge logic, intuitionistic linear temporal logic, bi-intuitionistic modal logic, and bi-intuitionistic linear temporal logic. It studies both proof theory and semantics over birelational Kripke models satisfying confluence and other frame conditions. 4
Formal mechanism and results. The reported package includes sound and complete Hilbert axiomatizations, non-wellfounded and cyclic sequent calculi, expressivity results, the finite model property, decidability, and complexity bounds. The thesis highlights analytic cyclic calculi for the master modality and common knowledge, finite-model and decidability results for bi-intuitionistic modal logic, and a finite axiomatization for intuitionistic linear temporal logic with the temporal operators next, eventually, and henceforth. 4
Why it belongs at the edge of this tracker. Dynamic modalities make the world structure explicit: an update, temporal step, or information increase changes which states are available for evaluation. That is not the same as varying first-order domains, but it is a useful warning against treating the accessibility relation as a neutral backdrop. In a quantified modal argument, domain growth, information growth, and temporal progression must not be silently identified.
Scope. This is a PhD thesis and a broad intuitionistic/dynamic development, not a direct treatment of BF, CBF, or the Williamson-style metaphysics of unrestricted quantification. Read it for proof systems and dynamic semantics, not as a new verdict on what exists necessarily.
What these papers change—and what they leave open
Taken together, the mid-July results shift attention from the slogan “constant or varying domains?” to three more precise questions:
- Which objects are admissible as domains? Marquès makes the constant-domain principle categorical by restricting the sorts over which it applies; the restriction is not equivalent to adding a modal axiom.
- Which metatheory builds the models? Valliappan shows how modal completeness can be pursued constructively, while Zenger studies intuitionistic systems whose frames carry additional dynamic structure.
- Which search policy turns a calculus into usable evidence? Sidhoum and coauthors separate inference from fair exploration, a prerequisite for trusting automated checks of quantified modal derivations.
None of the four papers, on the evidence stated in their abstracts, argues directly that necessitism or contingentism is true. Their combined lesson is narrower and more useful: a formula such as
∀x □φ(x) → □∀x φ(x) does not carry a metaphysical conclusion by itself. Its force depends on the domains D(w), the assignment and existence conventions, the modal frame, the proof system, and the metatheory in which soundness or completeness is established.Suggested reading order
- Start with Marquès if “constant domain” is doing unexamined work in your argument.
- Move to Valliappan if the issue is constructive semantics or formalization of
□and◇. - Read Sidhoum et al. if you want a controlled route from a calculus to an automated proof search.
- Use Zenger as the broader proof-theoretic and dynamic-semantic map.
The next step in any necessitist–contingentist argument is not to choose BF or CBF by intuition. It is to write down the model in which the choice is supposed to have force.
References
- 1The Constant Domain Axiom in Toposes
arxiv.org
- 2
- 3
- 4Intuitionistic Dynamic Logic
arxiv.org
This story was produced automatically by a channel. One sentence is all it takes for Neodrop to keep producing for you.