Recognition: unknown
Carnapian Frameworks and Categoricity of Arithmetic via Inferential ω-logics
Pith reviewed 2026-05-07 17:06 UTC · model grok-4.3
The pith
Inferential versions of the omega-rule make first-order arithmetic categorical in a unique countable model without presupposing its own concepts.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Inferential omega-logics are obtained by adding modified inferential definitions of the classical omega-rule in one or two sorts. These logics are categorical in the inferential sense, so first-order Peano arithmetic has a unique countable model in each case. The two-sorted version interprets L omega one comma omega. The categoricity theorems hold without the logics appealing to the arithmetical concepts whose uniqueness they establish.
What carries the argument
The inferential definition of the omega-rule in one or two sorts, which enforces that every natural number is reached by finite successor steps and thereby forces a unique countable model for arithmetic.
If this is right
- Arithmetic possesses a unique countable model once the inferential omega-rule is added.
- The problem of referential determinacy for number terms receives a determinate answer inside the appropriate framework.
- Weaker extensions of first-order logic suffice to secure categoricity without invoking the full strength of second-order logic.
- Classical mathematics proceeds by constructing and refining concepts rather than by fixing references to models.
Where Pith is reading between the lines
- The same inferential-rule technique might be applied to other first-order theories to produce categoricity results in weak extensions.
- Relocating foundational questions to a suitable linguistic framework could clarify parallel determinacy issues in other areas of mathematics.
- Distinguishing cognitive construction of concepts from model reference offers a way to evaluate modelist positions without dismissing them outright.
Load-bearing premise
That the proofs of categoricity in these logics do not rely on the arithmetical concepts they secure and that referential determinacy questions become meaningful or meaningless according to the linguistic framework in which they are placed.
What would settle it
A reconstruction of the categoricity proof that reveals an unavoidable dependence on arithmetical notions inside the definition or application of the inferential rule, or a concrete example showing that the chosen linguistic framework leaves the determinacy question still open.
read the original abstract
We provided in \cite{BaldwinBrincusI} extensions of first order logic by modified inferential definitions of the classical $\omega$-rule in $1$ or $2$ sorts. These logics are categorical in the inferential sense. Arithmetic has a unique countable model in each case, e.g. first order PA is categorical in our first logic. The 2-sorted case interprets $L_{\omega_1,\omega}$. In this paper, we discuss two philosophical problems raised by Button and Walsh \cite{ButtonWalshbook} concerting the identification of a unique isomorphism class. First, we argue that the doxological challenge (on referential determinacy) gets a clear answer if placed in an appropriate (Carnapian) linguistic framework and is meaningless otherwise. To clarify this approach, we address Button-Walsh's dismissal of concepts-modelism by developing the notion of {\em cognitive modelism}, according to which classical mathematics is a complex process of constructing and developing a distinctive class of concepts. Second, we argue that the inferential $\omega$-logics, that are much weaker than second order logic, do not appeal to the arithmetical concepts that the categoricity theorems proved within these logics aim to secure.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that the doxological challenge concerning referential determinacy receives a clear answer when situated in an appropriate Carnapian linguistic framework (and is otherwise meaningless). It develops the notion of cognitive modelism to respond to Button and Walsh's dismissal of concepts-modelism. It further argues that the inferential ω-logics (extensions of FOL by modified inferential ω-rules in 1 or 2 sorts, as introduced in prior work) are weaker than second-order logic and do not appeal to the arithmetical concepts secured by their categoricity results, such as the unique countable model of first-order PA.
Significance. If the arguments hold, the work offers a philosophical resolution to determinacy issues in categoricity theorems for arithmetic using logics weaker than SOL, by distinguishing meaningful frameworks and introducing cognitive modelism as a view of mathematical concept construction. This could advance debates in the philosophy of logic on how categoricity avoids circularity.
major comments (2)
- [Abstract] Abstract: The central claim that 'the inferential ω-logics... do not appeal to the arithmetical concepts that the categoricity theorems proved within these logics aim to secure' is load-bearing for the second main argument. However, even in modified inferential form, the ω-rule is formulated as an inference requiring one premise for each natural number n (from ⊢ φ(n) for all n infer ⊢ ∀x φ(x)). Stating or applying this rule in the meta-theory requires a determinate enumeration of the naturals, which risks presupposing the referential determinacy and standard model that the categoricity result (unique countable model for PA) is meant to establish. No explicit discussion resolves this apparent circularity.
- [Discussion of the doxological challenge] Discussion of the doxological challenge and Carnapian framework: The argument that the challenge 'gets a clear answer if placed in an appropriate (Carnapian) linguistic framework and is meaningless otherwise' is central to the first philosophical problem. However, the manuscript does not provide a precise criterion for what renders a framework 'appropriate' or why Button-Walsh's approach falls outside it, leaving the claim that the challenge is meaningless otherwise under-supported.
minor comments (2)
- [Abstract] The abstract contains 'concerting' which appears to be a typographical error for 'concerning'.
- The manuscript relies on the prior paper [BaldwinBrincusI] for the definitions of the inferential ω-logics; a brief recap of the key modified rules would improve accessibility for readers.
Simulated Author's Rebuttal
We thank the referee for the careful reading and constructive comments on our manuscript. The points raised help us strengthen the clarity of our arguments regarding meta-theoretic assumptions and the notion of appropriate Carnapian frameworks. We respond point by point below and will revise the manuscript to incorporate clarifications.
read point-by-point responses
-
Referee: [Abstract] Abstract: The central claim that 'the inferential ω-logics... do not appeal to the arithmetical concepts that the categoricity theorems proved within these logics aim to secure' is load-bearing for the second main argument. However, even in modified inferential form, the ω-rule is formulated as an inference requiring one premise for each natural number n (from ⊢ φ(n) for all n infer ⊢ ∀x φ(x)). Stating or applying this rule in the meta-theory requires a determinate enumeration of the naturals, which risks presupposing the referential determinacy and standard model that the categoricity result (unique countable model for PA) is meant to establish. No explicit discussion resolves this apparent circularity.
Authors: We agree that care is needed to avoid any appearance of circularity in the meta-theoretic formulation of the inferential ω-rule. Our position is that the meta-theory is a weak informal or first-order theory permitting syntactic enumeration of premises (via the rule schema) without presupposing the full referential determinacy or standard model of arithmetic; the categoricity theorems then establish uniqueness within the object language using only the inferential rules. This distinction is implicit in our prior work on these logics but not spelled out explicitly here. We will revise by adding a dedicated paragraph (or short subsection) in the introduction clarifying the meta-theoretic assumptions and why they do not appeal to the arithmetical concepts secured by the categoricity results. revision: yes
-
Referee: [Discussion of the doxological challenge] Discussion of the doxological challenge and Carnapian framework: The argument that the challenge 'gets a clear answer if placed in an appropriate (Carnapian) linguistic framework and is meaningless otherwise' is central to the first philosophical problem. However, the manuscript does not provide a precise criterion for what renders a framework 'appropriate' or why Button-Walsh's approach falls outside it, leaving the claim that the challenge is meaningless otherwise under-supported.
Authors: An appropriate Carnapian linguistic framework is one in which the meanings of the non-logical symbols (including those of arithmetic) are fixed internally by the specified inferential rules and conventions of the framework itself, rather than by an external, framework-independent notion of reference. Button and Walsh's approach falls outside this because it treats referential determinacy as a challenge that can be posed from a neutral meta-perspective without commitment to any particular set of inferential rules. To make this precise, we will revise the relevant discussion section to include an explicit characterization: a framework counts as appropriate precisely when the doxological challenge cannot be coherently formulated without already presupposing the framework's inferential rules (such as the modified ω-rules). This will better support the claim that the challenge is meaningless outside such frameworks while connecting it to our development of cognitive modelism. revision: yes
Circularity Check
Minor self-citation for technical background; philosophical claims developed independently
full rationale
The paper cites its prior work for the definition of the inferential ω-logics and the categoricity results (e.g., unique countable model for PA). This is standard for building on established technical foundations and does not reduce the current paper's central philosophical arguments—about Carnapian linguistic frameworks rendering the doxological challenge meaningful or meaningless, and the development of cognitive modelism—to a self-referential loop. No derivation, equation, or claim in the provided text reduces by construction to its own inputs, nor does any load-bearing step rely on an unverified self-citation chain. The non-appeal to arithmetical concepts is asserted as part of the independent philosophical analysis rather than a fitted or self-defined prediction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Categoricity of arithmetic in the inferential ω-logics as established in the cited prior work
invented entities (1)
-
cognitive modelism
no independent evidence
Reference graph
Works this paper leans on
-
[1]
Categoricity for an inferential $\omega$-logic and in $L_{\omega_1,\omega}$
[BB26] John T. Baldwin and Constantin C. Br ˆıncus ¸. Categoricity by inferentialω-logic andL ω1,ω. 2026.https://arxiv.org/pdf/2602.02854. [Brˆı24] Constantin C. Br ˆıncus ¸. Categorical quantification.The Bulletin of Symbolic Logic, 30:227–252,
work page internal anchor Pith review Pith/arXiv arXiv 2026
-
[2]
22 [Car09] Susan Carey.The origin of concepts
Reprinted in the Supplement toMeaning and Ne- cessity: A Study in Semantics and Modal Logic, enlarged edition (University of Chicago Press, 1956). 22 [Car09] Susan Carey.The origin of concepts. Oxford University Press, Oxford,
1956
-
[3]
Trench, Trubner and Co Ltdr, London, 1934/37
[Car37] Rudolf Carnap.Logical Syntax of Language. Trench, Trubner and Co Ltdr, London, 1934/37. [Chu44] Alonzo Church. Review of Carnap 1943.The Philosophical Review 53:5, pages 493–8,
1934
-
[4]
https://doi.org/10.1007/s11098-025-02432-7. [Kes13] Lauri Keskinen. Characterizing all models in infinite cardinalities.Annals of Pure and Applied Logic, 164:230–250,
-
[5]
Carnap on the foundations of logic and mathe- matics.https://bpb-us-e1.wpmucdn.com/websites.harvard
[Koe09] Peter Koellner. Carnap on the foundations of logic and mathe- matics.https://bpb-us-e1.wpmucdn.com/websites.harvard. edu/dist/f/94/files/2022/07/CFLM.pdf,
2022
-
[6]
Concepts
23 [ML23] Eric Margolis and Stephen Laurence. Concepts. In Edward N. Zalta and Uri Nodelman, editors,The Stanford Encyclopedia of Philosophy. Metaphysics Re- search Lab, Stanford University, Fall 2023 edition,
2023
-
[7]
[Mor68] M. Morley. Partitions and models. In M.H. L ¨ob, editor,Proceedings of the Summer School in Logic Leeds, 1967, pages 109–158. Springer-Verlag,
1967
-
[8]
On the concept of logical consequence
[Tar83] Alfred Tarski. On the concept of logical consequence. InLogic, Semantics and Metamathematics: Papers from 1936/1983, pages 409–420. Hackett, Indianapo- lis,
1936
-
[9]
[War20] Jared Warren.Shadows of Syntax
https://doi.org/10.1093/pq/pqaf059. [War20] Jared Warren.Shadows of Syntax. Revitalizing Logical and Mathematical Con- ventionalism. Oxford Unversity Press, Oxford,
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.