Search arXivSearch

arXiv · 2204.13754

Philosophical Uses of Categoricity Arguments

Abstract

Mathematicians and philosophers have appealed to categoricity arguments in a surprisingly varied range of contexts. One familiar example calls on second-order categoricity in an attempt to show that the Continuum Hypothesis, despite its formal independence, has a determinate truth value, but this does not exhaust the uses of categoricity even in set theory, not to mention its appearance in various roles in discussions of arithmetic. Here we compare and contrast a sampling of these deployments to get a sense of when these arguments tend to succeed and when they tend to fail. Our story begins with two historical landmarks, Dedekind and Zermelo, on arithmetic and set theory, respectively, and ends with two leading contemporary writers, Charles Parsons and the co-authors Tim Button and Sean Walsh, again on arithmetic and set theory, respectively. In between, we pause over the well-known contribution of Georg Kreisel. In each case we ask: what does the author set out to accomplish, philosophically?; what do they actually do (or what can be done), mathematically?; and does what is done (or can be done) accomplish what they set out to do? We find this focus on context illuminating: these authors have qualitatively different philosophical goals, and what works for one might not work for another.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Penelope Maddy, Jouko Väänänen. 2023-03-12. Philosophical Uses of Categoricity Arguments. https://arxiv.org/abs/2204.13754

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO