Abstraction Principles and the Classification of Second-Order Equivalence Relations

Notre Dame Journal of Formal Logic 60 (1):77-117 (2019)
  Copy   BIBTEX

Abstract

This article improves two existing theorems of interest to neologicist philosophers of mathematics. The first is a classification theorem due to Fine for equivalence relations between concepts definable in a well-behaved second-order logic. The improved theorem states that if an equivalence relation E is defined without nonlogical vocabulary, then the bicardinal slice of any equivalence class—those equinumerous elements of the equivalence class with equinumerous complements—can have one of only three profiles. The 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.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,607

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The Strength of Abstraction with Predicative Comprehension.Sean Walsh - 2016 - Bulletin of Symbolic Logic 22 (1):105–120.
Invertible definitions.Timothy Williamson - 1987 - Notre Dame Journal of Formal Logic 28 (2):244-258.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
On Bounded Type-Definable Equivalence Relations.Ludomir Newelski & Krzysztof Krupi?Ski - 2002 - Notre Dame Journal of Formal Logic 43 (4):231-242.
Popa superrigidity and countable Borel equivalence relations.Simon Thomas - 2009 - Annals of Pure and Applied Logic 158 (3):175-189.
On Elementary Equivalence for Equality-free Logic.E. Casanovas, P. Dellunde & R. Jansana - 1996 - Notre Dame Journal of Formal Logic 37 (3):506-522.
Fraenkel–Carnap Questions for Equivalence Relations.George Weaver & Irena Penev - 2011 - Australasian Journal of Logic 10:52-66.
On Abstraction in Mathematics and Indefiniteness in Quantum Mechanics.David Ellerman - 2021 - Journal of Philosophical Logic 50 (4):813-835.

Analytics

Added to PP
2019-01-25

Downloads
48 (#452,040)

6 months
9 (#455,691)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Sean Ebels-Duggan
Northwestern University

Citations of this work

Identifying finite cardinal abstracts.Sean C. Ebels-Duggan - 2020 - Philosophical Studies 178 (5):1603-1630.

Add more citations

References found in this work

What are logical notions?Alfred Tarski - 1986 - History and Philosophy of Logic 7 (2):143-154.
Philosophy of Logic (2nd Edition).W. V. Quine - 1986 - Cambridge, MA: Harvard University Press.
Logicality and Invariance.Denis Bonnay - 2006 - Bulletin of Symbolic Logic 14 (1):29-68.
Logical operations.Vann McGee - 1996 - Journal of Philosophical Logic 25 (6):567 - 580.

View all 16 references / Add more references