# RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES

@article{Walsh2015RELATIVECA, title={RELATIVE CATEGORICITY AND ABSTRACTION PRINCIPLES}, author={Sean Walsh and Sean Ebels-Duggan}, journal={The Review of Symbolic Logic}, year={2015}, volume={8}, pages={572 - 606} }

Abstract Many recent writers in the philosophy of mathematics have put great weight on the relative categoricity of the traditional axiomatizations of our foundational theories of arithmetic and set theory (Parsons, 1990; Parsons, 2008, sec. 49; McGee, 1997; Lavine, 1999; Väänänen & Wang, 2014). Another great enterprise in contemporary philosophy of mathematics has been Wright’s and Hale’s project of founding mathematics on abstraction principles (Hale & Wright, 2001; Cook, 2007). In Walsh… Expand

#### Topics from this paper

#### 10 Citations

WHAT RUSSELL SHOULD HAVE SAID TO BURALI–FORTI

- Philosophy, Computer Science
- The Review of Symbolic Logic
- 2017

It is argued that the paradox of Burali–Forti is first and foremost a problem about concept formation by abstraction, not about sets, and that some hundred years after its discovery the paradox is still without any fully satisfactory resolution. Expand

What Russell Should Have Said to Burali -

- 2016

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not… Expand

Abstraction Principles and the Classification of Second-Order Equivalence Relations

- Mathematics, Computer Science
- Notre Dame J. Formal Log.
- 2019

Improvements to Fine's theorem allow for an analysis of the well-behaved models had by an abstraction principle, and this in turn leads to an improvement of Walsh and Ebels-Duggan's relative categoricity theorem. Expand

Asymptotic Quasi-completeness and ZFC

- Mathematics
- 2018

The axioms ZFC of first order set theory are one of the best and most widely accepted, if not perfect, foundations used in mathematics. Just as the axioms of first order Peano Arithmetic, ZFC axioms… Expand

Identifying finite cardinal abstracts

- Computer Science
- 2020

A novel cross-sortal identity principle is proposed, based on embeddings of the induced models of abstracts developed by Walsh (2012), but offers interestingly different answers to the more controversial identifications made by ECIA2. Expand

2018 NORTH AMERICAN ANNUAL MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC Western Illinois University, Macomb, IL, USA May 16–19, 2018

- The Bulletin of Symbolic Logic
- 2018

s of the invited talks and the contributed talks (given in person or by title) by members of the Association for Symbolic Logic follow. For the Program Committee David Marker Abstracts of invited… Expand

Is Hume’s Principle analytic?

- Computer Science
- Synthese
- 2018

It is shown that HP can be denied within non-standard analysis and argued that if HP is taken to depend on Frege’s definition of number, it isn’t analytic, and if HP was taken to be primitive there is only a very narrow range of circumstances where it might be taken to been analytic. Expand

The Nuisance Principle in Infinite Settings

- Mathematics, Computer Science
- 2015

It is shown that logically this situation persists if one looks at joint (second-order) consistency rather than satisfiability: under a modest assumption about infinite concepts, NP is also inconsistent with HP. Expand

#### References

SHOWING 1-10 OF 83 REFERENCES

The Arché Papers on the Mathematics of Abstraction

- Computer Science, Mathematics
- 2007

The author states that "Neo-Fregean Foundations for Real Analysis: Some Reflections on Frege's Constraint', Notre Dame Journal of Formal Logic 41: 317-334, and 'Prolegomenon to Any Future Neo-Logicist Set Theory: Abstraction and Indefinite Extensibility', British Journal for the Philosophy of Science 54: 59-91. Expand

Philosophy of mathematics : structure and ontology

- Mathematics
- 2004

Do numbers, sets, and so forth, exist? What do mathematical statements mean? Are they literally true or false, or do they lack truth values altogether? Addressing questions that have attracted lively… Expand

Ideas and Results in Model Theory: Reference, Realism, Structure and Categoricity

- Mathematics
- 2015

The topics of reference, realism, and structure have been discussed extensively in the philosophy of mathematics of the last decades. There have been some parallel discussions in certain parts of… Expand

Numerical Abstraction via the Frege Quantifier

- Computer Science
- Notre Dame J. Formal Log.
- 2010

A formalization of rst-order arith- metic characterizing the natural numbers as abstracta of the equinumerosity relation is presented, turning on the interac- tion of a non-standard (but still rSt-order) cardinality quantier with an abstraction operator assigning objects to predicates. Expand

Our Knowledge of Mathematical Objects

I have recently been attempting to provide a new approach to the philosophy of mathematics, which I call 'procedural postulationism'. It shares with the traditional form of postulationism, advocated… Expand

LOGICISM, INTERPRETABILITY, AND KNOWLEDGE OF ARITHMETIC

- Computer Science
- The Review of Symbolic Logic
- 2014

This discussion is significant because it gives a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. Expand

The Oxford Handbook of Philosophy of Mathematics and Logic

- Computer Science
- Oxford handbooks in philosophy
- 2007

This volume covers these disciplines in a comprehensive and accessible manner, giving the reader an overview of the major problems, positions, and battle lines, and is a ground-breaking reference like no other in its field. Expand

Comparing Peano arithmetic, Basic Law V, and Hume's Principle

- Mathematics, Computer Science
- Ann. Pure Appl. Log.
- 2012

There is a consistent extension of the hypear arithmetic fragment of Basic Law V which interprets the hyperarithmetic fragment of second-order Peano arithmetic, so that in this specific sense there is no predicative version of Frege’s Theorem. Expand

FRAGMENTS OF FREGE’S GRUNDGESETZE AND GÖDEL’S CONSTRUCTIBLE UNIVERSE

- Mathematics, Computer Science
- The Journal of Symbolic Logic
- 2016

It is shown that there is a model of a fragment of the Grundgesetze which defines a models of all the axioms of Zermelo–Fraenkel set theory with the exception of the power set axiom. Expand

Logic, Logic, and Logic

- Philosophy
- 1998

Part 1 Studies on set theory and the nature of logic: the iterative conception of set reply to Charles Parsons' "Sets and Classes" on second-order logic to be is to be a value of a variable (or to be… Expand