Subreflexive consequence, forcing, lambda proofs, and adverb tableaux: four late-July logic papers
Four papers published or submitted between 27 and 31 July make different inferential mechanisms explicit—from identity-free consequence and Boolean compatibility to lambda proof terms and adverb tableaux—while citation counts remain too young to rank them.
The four records added between 27 and 31 July 2026 do not point to one new school of philosophical logic. They do share a more precise move: each makes an inferential mechanism explicit, then tests it with a semantic or proof-theoretic result. The mechanisms are different—identity-free consequence, Boolean compatibility, typed lambda terms, and tableaux for scoped adverbs—but the citation signal is the same: too young to rank.
Four papers, four ways to expose inference
| Paper | What it makes explicit | Formal payoff | Citation snapshot |
|---|---|---|---|
| Subreflexive Logic: Completeness without Identity | Consequence without the identity principle A → A | Sound and complete semantics, cut elimination, and decidability | Semantic Scholar: 0 citations; 0 influential citations 1 |
| The Internal Modal Logic of Forcing | Modal access as Boolean compatibility between local perspectives | Modal validities plus a soundness-and-completeness theorem for translated co-consistency models | Semantic Scholar: 0 citations; 0 influential citations 2 |
| Justification Logic of the Lambda Calculus | Proof terms as typed λ-terms rather than abstract proof labels | Axiomatisation, natural deduction, Curry–Howard correspondence, cut elimination, and normalization | Semantic Scholar: 0 citations; 0 influential citations 3 |
| Proof Theory for a Recently-Proposed Logic of Adverbs | Proof search for first-order logic with scoped adverbs | A semantic-tableaux system with soundness and completeness | Crossref: 0 references to the article 4 |
The dates are also worth separating. The first and third papers were submitted to arXiv on 27 July, the forcing paper on 28 July, and the adverb paper appeared online in the Journal of Philosophical Logic on 31 July. The first three are preprints; the fourth is an open-access journal article. 5 6 7 8
Removing identity without losing a semantics
Noah Abou El Wafa and André Platzer begin with a deliberately uncomfortable subtraction: subreflexive logic omits the identity principle
A → A. The paper interprets implication as robust consequence and asks whether a logic that refuses reflexivity can still support the usual technical checks. Its abstract reports a decidable logic with syntactic cut elimination, complete algebraic semantics based on Heyting and Boolean semialgebras, and complete semi-categorical semantics based on semi-adjunctions. 5The important point is that the missing identity rule is not replaced by a loose metaphor about relevance or robustness. The authors explicitly construct semantics that do not quietly reintroduce reflexivity. In the classical case, they also prove completeness for denotational set semantics in which implication is read as robust material implication. That gives a reader a concrete test for the proposal: the system is not merely weaker by omission; its consequence relation is given a semantic account and a proof-theoretic normalization property.
For researchers in non-classical logic, this is the paper to open when the question is structural weakening: what remains of consequence when even self-entailment is not built in? The answer is technical rather than philosophical in the broad sense, but that is precisely its value at this stage. It supplies a place to inspect the cost of removing a principle that ordinary propositional practice usually leaves invisible.
Forcing as an internal modal space
Santiago Jockwich, Sourav Tarafder, and Giorgio Venturi take a different route to making modality explicit. Given a complete Boolean algebra
B, they treat its elements as local perspectives on truth inside the Boolean-valued universe V^(B). Accessibility is defined by co-consistency—equivalently, Boolean compatibility—so a R b holds exactly when a ∧ b ≠ 0. 6The paper's distinctive claim concerns the internal reading of possibility. For a set-theoretic sentence
p, ◇p holds at b when an ultrafilter containing b yields a classical quotient V^(B)/U in which p is true. The authors then compute general and Boolean-algebra-dependent modal validities, analyze complete atomic Boolean algebras, and prove that normal logic KTB is exactly the set of formulas valid in all translated co-consistency models with parameters. 6That result gives modal logic a local model of forcing rather than treating forcing as external background machinery. It also prevents an overstatement:
KTB is the completeness result for the translated co-consistency models described in the paper, not a claim that every interesting property of every Boolean-valued model collapses to one universal modal logic. The paper keeps both levels visible—general validities and behavior that depends on the Boolean algebra.When proof terms are computations
Silvia Ghilezan and Paaras Padhiar put the proof object itself inside the modality. In standard justification logic, an explicit proof term replaces the ordinary box. Their
J_λ instead uses typed lambda terms from the simply typed lambda calculus as the proof terms of the logic. Under Curry–Howard, the same object can be read as a computation and as a proof of intuitionistic propositional logic. 9The paper develops the system in layers. It first gives an axiomatisation and discusses internalisation: the logic can reason about its own proofs. It then gives untyped and typed natural-deduction calculi and proves their equivalence with the axiomatic system. Finally, it introduces a Gentzen-style sequent calculus; the cut-elimination argument supplies a normalization result for the negative fragment. 9
The technical distinction from ordinary justification logic matters more than the novelty of a new notation. The introduction says that earlier systems repeatedly face a mismatch because the lambda calculus is more expressive than the proof terms available in standard systems.
J_λ is built directly from the lambda calculus, so the formal connection is not added after the fact. The paper's contribution is therefore a tighter proof-computation interface: the modality tracks the very terms that compute under the Curry–Howard reading.Giving scoped adverbs a proof theory
Tamalyn Jade Davies and Tristan Grøtvedt Haze address a gap in a newer formal treatment of adverbial inference. Haze's first-order logic with scoped adverbs, or FOL-SA, models expressions such as “slowly” using a hierarchy of models: the level records the number of nestings of adverb formulas inside other adverb formulas. The new paper supplies the proof-theoretic side of that model theory through a semantic-tableaux system. It proves the system sound and complete. 4
The motivating inference is concrete: if Socrates is running slowly, he must be running; if he is not running, he must not be running slowly. The point is not that adverbs have suddenly become a new branch of modal logic. It is that a formal semantics for a linguistic phenomenon now has a proof procedure against which derivability can be checked. The paper's four-page reference list and its immediate online publication also make the citation count unsurprising: Crossref currently reports zero citations to the article. 4
This is the closest item in the cluster to formal semantics, but the connection is exact rather than decorative. The paper is about the proof theory of a logic whose syntax is motivated by natural-language adverbial scope. It belongs beside the other three because it makes inference operationally inspectable, not because all four study the same linguistic or set-theoretic object.
The shared method is real; a field trend is not yet established
Placed on one dimension, the papers ask where inferential force should live. Subreflexive logic puts the burden in identity-free algebraic and semi-categorical semantics. The forcing paper puts it in a compatibility relation over Boolean-valued perspectives and in ultrafilter quotients. The lambda paper puts it in explicit proof terms and their computation rules. The adverb paper puts it in tableaux that connect the proposed semantics to derivability.
The intersection yields a useful reading judgment: these authors are not proposing one shared logic, but they are turning hidden infrastructure into objects that can be checked. A principle can be removed and its semantic replacement tested. A forcing relation can be recast as accessibility and compared with modal validities. Proof and computation can be made to share terms. A model-theoretic account can be paired with proof search. The common move is therefore methodological, and the source texts do not establish a direct response or mutual citation among the four papers.
That distinction matters for how to read the citation data. Semantic Scholar lists zero citations and zero influential citations for each of the three arXiv records retrieved here. Crossref lists zero references to the Journal of Philosophical Logic article. Google Scholar contributed no usable cited-by count for this edition: its lookup pages did not expose a reliable result, so no Google Scholar number is reported. 10
Zero is not a negative result after three to five days, and the Crossref count is a different indexing signal from a scholarly influence measure. The evidence supports only a conservative conclusion: the cluster is technically coherent enough to guide reading, while bibliometrics cannot yet tell readers which paper is gaining traction.
What to follow next
The four papers answer different follow-up questions:
- If your problem is the cost of weakening ordinary consequence, start with Subreflexive Logic and inspect how its identity-free semantics avoids restoring
A → Aby another route. - If your problem is the relation between forcing and modality, start with The Internal Modal Logic of Forcing and compare the Boolean-algebra-dependent validities with the
KTBcompleteness theorem. - If your problem is proof objects that remain computationally meaningful, start with Justification Logic of the Lambda Calculus and follow the route from axiomatisation to natural deduction, then to cut elimination.
- If your problem is formal semantics for scope-sensitive natural-language expressions, start with Proof Theory for a Recently-Proposed Logic of Adverbs and ask what tableaux adds to the earlier hierarchy of models.
None of those paths is a citation ranking. They are four different ways to decide what kind of formal machinery your own question needs. For now, that is the stronger signal: not who is already being cited, but which inference mechanism each paper makes available for inspection.
References
- 1Semantic Scholar record
- 2Semantic Scholar record
- 3Semantic Scholar record
- 4Crossref record
- 5Subreflexive Logic
- 6Internal Modal Logic of Forcing
- 7Justification Logic of the Lambda Calculus
- 8Journal of Philosophical Logic article
- 9Justification Logic of the Lambda Calculus
- 10Google Scholar lookup for the arXiv records
Related content
- Sign in to comment.
More from this channel
- Post Completeness and Preconditionals: Three July Papers on Conditional Logic
- Inferentialist games, component modalities, and intuitionistic dynamics: four July logic works
- Belief contraction, inquisitive action, and quantum bases: AiML 2026 pulls modal logic toward update problems
- Neutrality, admissibility, and normality: philosophy of logic tightens its own constraints