Four translations, and what each keeps or breaks: conditionals under Kratzer's restrictor, modal logic inside a probability space, consistency strength inside a reflection calculus, and Gödel's second theorem under a change of numbering
Four papers from 12–16 October 2026 that each move a formal system into a second structure — conditionals into Kratzer's restrictor, modal logic into a probability space, consistency strength into a reflection calculus, arithmetic syntax into a Gödel numbering — with what each translation keeps or breaks, and what the week's citation counts can and cannot show.
Four papers published between 12 and 16 October 2026 take a formal system and move it into a second structure. Paul Égré, Lorenzo Rossi and Jan Sprenger place trivalent conditionals inside Kratzer's restrictor analysis of if-clauses 1. Loïc Cosyns places modal logic inside a Kolmogorov probability space 2. Fedor Pakhomov and Vlad Lazar place subtheories of second-order arithmetic inside a modal reflection calculus 3. Léon Probst places the syntax of arithmetic inside a Gödel numbering 4.
The host structure does the deciding in each paper, and it decides something different. Restriction settles how trivalence behaves under might and must. A measure settles which formulas count as necessary and which as possible. A reflection calculus settles the order in which theories of growing strength sit. A numbering settles whether Gödel's second incompleteness theorem holds at all.
Probst's abstract states the last point plainly: the theorem fails under certain numberings, and the article asks what makes a numbering reasonable 5. The other three report what a translation preserves. Probst reports a failure, then asks what the failure should cost.
Four records, one translation each
Each paper below first appeared in the week of 12–16 October 2026, and each is one step from its DOI or arXiv identifier.
| Paper and first-publication date | Authors and formal setting | Main result | Evidence status | Best fit |
|---|---|---|---|---|
| Trivalent conditionals, Kratzer style, published online 14 October 2026, DOI 10.1093/jos/ffag005 | Paul Égré, Lorenzo Rossi and Jan Sprenger; trivalent indicative conditionals with the modals might and must 6 | Cooper's trivalent conditional combined with Kratzer's restriction operation, both hard-wired into the truth conditions of conditional-modal expressions 7 | Refereed article in the Journal of Semantics, advance access, theoretical, no data, 74 references | Conditionals, modality, formal semantics |
| On the foundations of logic and probability, II. Modal probability spaces, submitted 12 October 2026, arXiv:2610.17049 | Loïc Cosyns; modal sentential calculi read against Kolmogorov probability | Probability zero holds exactly when a sentence's truth set is nowhere dense, which reads necessity as probability 1 and possibility as probability above zero 8 | Preprint, not refereed, 16 pages, proofs throughout, no data; proofs draw on Part I | Logic and probability, modal semantics |
| A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering, submitted 14 October 2026, arXiv:2610.20115 | Fedor Pakhomov and Vlad Lazar, Ghent University and the Steklov Institute; strictly positive modal calculus over extensions of ACA0 | The ∇-free formulas are linearly and well-foundedly ordered by reflection strength, and the order yields an ordinal notation system for the Bachmann–Howard ordinal 9 | Preprint, not refereed, 65 pages, proofs throughout, no data | Provability logic, ordinal analysis |
| On the choice of Gödel numberings, published online 14 October 2026, DOI 10.1017/S1755020326101312 | Léon Probst, Università della Svizzera italiana; the arithmetisation of syntax | A framework for asking which metamathematical theorems hold for which numberings, built from the fact that the second incompleteness theorem fails under some of them 4 | Refereed article in The Review of Symbolic Logic, First View, 30 pages, 50 references, no data | Philosophy of logic, incompleteness |
Trivalent conditionals under the restrictor
Paper and date
Trivalent conditionals, Kratzer style is an advance article in the Journal of Semantics, published online on 14 October 2026 7. Paul Égré is at IRL Crossing, CNRS and ENS-PSL; Lorenzo Rossi and Jan Sprenger are at the University of Turin 7. The article is open access under CC BY-NC and carries 74 references 7.
Formal object
The object is the indicative conditional read as a three-valued connective, Cooper's truth-functional analysis. Onto that base the paper puts Kratzer's idea that if-clauses do not denote propositions but restrict the domain of a modal operator. The language is extended with might and must 7.
What it does
The paper states that it hard-wires both trivalence and the restriction operation into the truth conditions of conditional-modal expressions 7. Three payoffs are claimed: plausible predictions for the interaction of conditionals and modals, an explanation of why the Restrictor View has intuitive appeal, and avoidance of the typical problems of Kratzer-style accounts.
The third payoff names its own battleground. The problems named are those concerning the probability of conditional-modal expressions 7. The three authors' Probability for Trivalent Conditionals appeared in Mind on 9 October and takes the same trivalent base to probability 10; this paper takes that base to modals.
Evidence and scope
A refereed journal article, theoretical throughout, with no data and 74 references. The scope is indicative conditionals together with two modals, so the claims stand or fall with the fragments the paper treats.
The abstract states no completeness theorem and no experimental result. The support is a semantic construction plus its predictions for conditionals inside modal environments, which makes coverage of the interaction data the thing to check.
Why open it
Open it if you work on conditionals, on modals, or on the seam between logic and linguistic semantics. The section to read first is the one that fixes truth conditions for might and must around a conditional, because the probability payoff is downstream of it.
Modal logic inside a probability space
Paper and date
On the foundations of logic and probability, II. Modal probability spaces was submitted to arXiv on 12 October 2026 and runs to 16 pages in math.LO and math.PR 11. It is the second paper of a series; Part I, Modal sentential calculi, appeared on 23 September 2026 12. The author describes the paper as an abridged version of a chapter of his 2026 Durham doctorate 8.
Formal object
The model is a probability space over a Lindenbaum–Tarski algebra of classical sentential logic, read together with the Stone space of that algebra. The question is not which probability a sentence receives but what modal structure the calculus of probability already carries 8.
What it does
Strict positivity is the obstacle. Talagrand's theorem supplies an almost measurable Lindenbaum–Tarski algebra that carries no strictly positive, countably additive probability measure, which answers von Neumann's question negatively in this setting 8. Kelley's criterion then gives the exact condition under which such a measure exists 8.
The construction itself is a representation result. Every Lindenbaum–Tarski probability algebra is isomorphic to the probability algebra of its Stone space 8.
The modal payoff is a set of four equivalences. Probability zero holds exactly when the open-closed representative is nowhere dense, and that is what the paper calls impossible; probability one holds exactly when it is non-boundary, which is necessary 8. Probability above zero is somewhere dense, read as possibly true, and probability below one is somewhere codense, read as possibly false 8.
The conclusion states a cost rather than a victory. The integration excludes, in the author's words, all probability spaces that are not hyperstonean or do not have a hyperstonean cover 8. What remains is named formal agnoiology, the study of non-normal measures in hyperstonean spaces.
Evidence and scope
A preprint that has not been peer-reviewed; 16 pages of definitions and proofs, no data. The paper states that several proofs lean on theorems established in Part I, so the results are conditional on that framework 8.
The scope is classical sentential calculi. The modal vocabulary is read off the topology of the Stone space rather than added to the object language, which is what keeps Kolmogorov's axiomatisation untouched and also what limits the claim.
Why open it
Open it if you work on the logic–probability interface, on modal semantics, or on the foundations of the probability calculus. Two things repay attention: whether Kelley's criterion really settles the existence question the paper poses, and whether the modal reading is a theorem about logic or a redescription of standard measure theory.
A modal calculus for consistency strength
Paper and date
A Reflection Calculus for Bar Induction and the Linearity of Consistency Strength Ordering was submitted to arXiv on 14 October 2026 and runs to 65 pages, classified 03F45 13. Fedor Pakhomov is at Ghent University and the Steklov Mathematical Institute; Vlad Lazar is at Ghent. Both authors' work was funded by FWO grant G0F8421N 9.
Formal object
The calculus RC_BI is built from ⊤, atoms, conjunction, two families of diamonds ⟨1⟩n and ⟨2⟩n, and two further operators, ↓ and ∇ 9. The arithmetical reading assigns ⊤ to ACA0, reads ⟨1⟩n as uniform syntactic Π1n reflection, ⟨2⟩n as ω-model Π1n reflection, ↓ as an ω-model projection, and ∇ as the addition of a theory's true Π11 theorems.
By Friedman's result the union of the ω-model reflection steps is bar induction, so closed formulas of the calculus name a family of subtheories of BI whose union is BI itself 9.
What it does
The load-bearing result is Theorem 1.1: the relation ≤11 is a linear, well-founded pre-order on the ∇-free closed formulas, so the quotient is well-ordered 9. The authors state that their proof of linearity does not proceed through the general linearity theorem they establish for a wider class of theories. They replace that step with an analysis of finite Kripke models, and prove a conservative extension of the calculus sound and complete for a class of Kripke models 9.
Ordinal analysis follows. For each formula the paper defines the ordinal o(A) occupying A's place in the order, and Corollary 6.6 identifies the Π11 proof-theoretic ordinal of the corresponding theory as ε raised to o(A) 9. Worked values pin the order to known systems: ⊤ is 0, ↓⊤ is ε0, ⟨2⟩3⊤ is φω(0) because that theory is Σ11-DC0, ⟨2⟩2⟨2⟩3⊤ is Γ0 because that theory is ATR0, and the supremum over the whole set is ψ(εΩ+1), the Bachmann–Howard ordinal 9.
Because the order is computable, it doubles as an ordinal notation system. The authors say the resulting system for the Bachmann–Howard ordinal differs substantially from existing representations 9.
Evidence and scope
A preprint that has not been peer-reviewed; 65 pages, proofs throughout, no data. Everything after Theorem 1.1 rests on it, so that proof is the one to audit first. The scope is fixed by the theories the calculus names: ACA0, ACA, ATR0, Σ11-DC0 and the Π1n bar-induction systems.
Why open it
Open it if you work on provability logic, on ordinal analysis, or on how natural theories are ordered by strength. The part to check is the step where linearity is proved for this calculus rather than derived from the general theorem, since the ordinal notation system depends on it.
Which metamathematics survives a change of numbering
Paper and date
On the choice of Gödel numberings appeared as a First View article in The Review of Symbolic Logic on 14 October 2026, pp. 1–30 5. Léon Probst is at the Istituto di Studi Filosofici, Università della Svizzera italiana, Lugano 5. OpenAlex counts 50 references 14.
Formal object
A Gödel numbering is the assignment of numbers to syntax that lets arithmetic talk about proofs. The paper treats the assignment itself as the object of study rather than as a convention settled once and forgotten.
The classification marks where the paper sits: philosophical aspects of logic and foundations, first-order arithmetic, and Gödel numberings and issues of incompleteness 5.
What it does
The abstract opens with the indeterminacy: the choice of Gödel numberings is a source of indeterminacy in metamathematics, and Gödel's second incompleteness theorem fails under certain numberings 5.
It then names the belief the failure threatens. Standard metamathematical theorems are widely held to hold for all reasonable numberings, and the article investigates what makes a numbering reasonable 5.
The stated contribution is a general framework for philosophical questions about Gödel numberings and, more generally, about the arithmetisation of syntax. The keywords are arithmetisation, Gödel numbering, indeterminacy in metamathematics and syntax 5.
Evidence and scope
A refereed article in a logic journal, released First View, 30 pages, 50 references, no data. The abstract states the aim but not the criteria that make a numbering reasonable, and those criteria sit in the subscription-only body.
What the abstract does settle is the shape of the claim. The failure of the second theorem is the motivating case, not the conclusion; the conclusion is a criterion that sorts numberings.
Why open it
Open it if you work on incompleteness, on the arithmetisation of syntax, or on the philosophy of logic more broadly. The criterion of reasonableness is the thing to test, because every metamathematical theorem the paper discusses is claimed to survive or fail by that criterion.
What the four papers share
The four host structures differ, and each translation costs something specific. Restriction fixes which truth value a conditional-modal sentence takes. Kolmogorov measure plus Stone duality fixes necessity as probability one, and excludes probability spaces that are not hyperstonean. The reflection calculus fixes the order of the ∇-free theories, and that order is proved linear rather than assumed. A numbering fixes what counts as an arithmetisation of syntax at all.
What binds the week is one move rather than one topic: a structure that used to sit in the background becomes an object with demands of its own. Kratzer's restriction operation, the Stone space of a probability algebra, the strength ordering of second-order theories, and the encoding of syntax each stop being scaffolding and start deciding results.
Seven further records in the same window belong to the same enquiry without sharing the host structure. Thomas Holden reads Hume against Carroll's Tortoise: induction cannot be justified to someone not already willing to accept it, while demonstration, the Humean analogue of deduction, may have a basis that induction lacks 15.
Samuel González-Castillo models structural type theory in Tarski–Grothendieck set theory, lifts some of the syntactic restrictions that keep the system consistent, and proves a result analogous to Farmer's morphism theorem 16. Tim Lyon and Lukas Zenger give non-wellfounded and cyclic linear nested sequent calculi for linear temporal logic, with procedures for recognising cycles and for unravelling cyclic proofs into non-wellfounded ones 17.
Khashayar Irani argues that natural deduction is nonlocal, in the sense that assumptions can be introduced at a stage after the point where they would ordinarily have entered, and ties that to left-weakening in the sequent calculus 18. Ali Enayat studies a Lévy scheme asserting an n-Mahlo cardinal for each n, and argues that ZFC plus that scheme is an inevitable extension of ZFC if certain metamathematical results about finite sets are generalised to all sets 19.
Two further preprints close the week's logic list. Vera Koponen characterises when a complete ω-categorical theory has the finite model property 20, and Paolo Agliano and Mitar Nedeljkovic develop Girard algebras as the algebraic semantics of multiplicative additive linear logic, obtaining 2^ℵ0 Post-complete extensions as part of the picture 21.
The week's journal record was thin. The Journal of Philosophical Logic carried one article, Kai Hauser's What Philosophy Can Do for Set Theory – a Case Study, on 12 October 22. Linguistics and Philosophy carried Charlie Siu on pragmatic halos and optimality theory on 16 October 23. The Bulletin of Symbolic Logic carried two: Buriola and Weiermann on proof-theoretic relations between Higman's and Kruskal's theorem on 15 October, and Berenstein, Cuervo Ovalle and Goldbring on the model theory of Hilbert spaces with normal operators on 16 October 2425.
Citation movement: what the counts can and cannot show
Every count below was read on 18 October 2026.
None of the four featured papers has a citing work on OpenAlex. The counts are zero for Probst's Review of Symbolic Logic article, for Cosyns's preprint, for the Pakhomov–Lazar preprint and for the Journal of Semantics article 62627.
Crossref reports zero citing works for the Journal of Semantics article against 74 references 7. Semantic Scholar holds no record for that DOI at all, so it contributes nothing on this paper 28.
Google Scholar is the only route that returned a non-zero figure this week, and it returned it for preprints. The Kratzer-style record, the 2025 draft, shows one citing work 29. In the Cosyns series the doctorate shows two citing works, Part I shows one and Part II shows none yet 30. The Pakhomov–Lazar preprint has a record without a cited-by line 31.
Where the numbers do say something is the literature each paper attaches to. Solovay's 1976 Provability interpretations of modal logic, the completeness theorem the reflection calculus descends from, carries 452 citing works 32. Beklemishev's Reflection calculus and conservativity spectra carries 9 33. The three conditional papers' own De Finettian Logics of Indicative Conditionals preprint record carries 6 34.
A zero in the week of publication says very little. Cosyns's preprint was submitted on 12 October, Pakhomov and Lazar's on 14 October, and the two journal articles went online on 14 October. Nothing in these counts separates a result nobody will build on from one that has not yet been read.
How to pick among the four
If you work on conditionals, modals or formal semantics, read Égré, Rossi and Sprenger first. The claim to test is the prediction set for conditionals inside modal environments, because the probability payoff follows from it rather than standing beside it.
If you work on logic and probability, read Cosyns first. Kelley's criterion is the hinge: if it holds, the existence question is settled and the modal reading has a foundation. The second thing to check is what the hyperstonean requirement excludes.
If you work on provability logic or ordinal analysis, read Pakhomov and Lazar first. Theorem 1.1 carries the ordinal assignment and the notation system, and the authors flag that their proof does not go through their general linearity theorem.
If you work on the philosophy of logic or the arithmetisation of syntax, read Probst first. The criterion of reasonableness decides everything downstream, and it is the part a reader must reconstruct from the body rather than from the abstract.
One question cuts across all four: what does a formal system have to accept before it can be translated. Restriction has to be written into truth conditions, a probability space has to be hyperstonean, a strength order has to be proved linear, and a numbering has to be reasonable. Each paper states the price, and each price is where the next argument will start.
References
- 1
- 2
- 3
- 4
- 5
- 6OpenAlex record, Trivalent conditionals, Kratzer style
api.openalex.org
- 7Crossref record, Trivalent conditionals, Kratzer style
api.crossref.org
- 8Modal probability spaces, full text
arxiv.org
- 9
- 10
- 11DataCite record, Modal probability spaces
api.datacite.org
- 12
- 13DataCite record, Reflection calculus
api.datacite.org
- 14OpenAlex record, On the choice of Gödel numberings
api.openalex.org
- 15
- 16
- 17
- 18
- 19What David Teaches Goliath
arxiv.org
- 20
- 21
- 22
- 23
- 24
- 25
- 26OpenAlex record, Modal probability spaces
api.openalex.org
- 27OpenAlex record, Reflection calculus
api.openalex.org
- 28Semantic Scholar graph, DOI lookup
api.semanticscholar.org
- 29Google Scholar, Trivalent conditionals, Kratzer style
scholar.google.com
- 30Google Scholar, Cosyns series
scholar.google.com
- 31Google Scholar, Reflection calculus
scholar.google.com
- 32
- 33
- 34
This story was produced automatically by a channel. One sentence is all it takes for Neodrop to keep producing for you.