A Note on von Neumann Ordinals and Dependence

Philosophia Mathematica 31 (2):nkad007 (2023)
  Copy   BIBTEX

Abstract

This note defends the reduction of ordinals to pure sets against an argument put forward by Beau Madison Mount. In the first part I will defend the claim that dependence simpliciter can be reduced to immediate dependence and define a notion of predecessor dependence. In the second part I will provide and defend a way to model the dependence profile of ordinals akin to Mount’s proposal in terms of immediate dependence and predecessor dependence. I furthermore show that my alternative dependence profile allows us to single out the reduction of ordinals to von Neumann ordinals as the only viable set-theoretic reduction.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

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

Antireductionism and Ordinals.Beau Madison Mount - 2019 - Philosophia Mathematica 27 (1):105-124.
Why Numbers Are Sets.Eric Steinhart - 2002 - Synthese 133 (3):343-361.
Countable partition ordinals.Rene Schipperus - 2010 - Annals of Pure and Applied Logic 161 (10):1195-1215.
Proof theory for theories of ordinals—I: recursively Mahlo ordinals.Toshiyasu Arai - 2003 - Annals of Pure and Applied Logic 122 (1-3):1-85.
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
A Covering Lemma for HOD of K (ℝ).Daniel W. Cunningham - 2010 - Notre Dame Journal of Formal Logic 51 (4):427-442.
Extensions of the constructive ordinals.Wayne Richter - 1965 - Journal of Symbolic Logic 30 (2):193-211.
Operating on the universe.Narciso Garcia - 1988 - Archive for Mathematical Logic 27 (1):61-68.
Ordinal operations on graph representations of sets.Laurence Kirby - 2013 - Mathematical Logic Quarterly 59 (1-2):19-26.
Full classes and ordinals.Sherman K. Stein - 1960 - Journal of Symbolic Logic 25 (3):217-219.
A Theorem on Definitions of the Zermelo‐Neumann Ordinals.Hao Wang - 1967 - Mathematical Logic Quarterly 13 (16‐18):241-250.
A Theorem on Definitions of the Zermelo‐Neumann Ordinals.Hao Wang - 1967 - Mathematical Logic Quarterly 13 (16-18):241-250.
Proof theory for theories of ordinals II: Π3-reflection.Toshiyasu Arai - 2004 - Annals of Pure and Applied Logic 129 (1-3):39-92.
The universe constructed from a sequence of ordinals.W. Hugh Woodin - 1996 - Archive for Mathematical Logic 35 (5-6):371-383.
Trees and Ehrenfeucht–Fraı̈ssé games.Stevo Todorčević & Jouko Väänänen - 1999 - Annals of Pure and Applied Logic 100 (1-3):69-97.

Analytics

Added to PP
2023-03-26

Downloads
41 (#369,691)

6 months
17 (#132,430)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jonas Werner
Massachusetts Institute of Technology

Citations of this work

No citations found.

Add more citations

References found in this work

Guide to Ground.Kit Fine - 2012 - In Fabrice Correia & Benjamin Schnieder (eds.), Metaphysical Grounding. Cambridge University Press. pp. 37--80.
Ontological Dependence.Tuomas E. Tahko & E. J. Lowe - 2020 - Stanford Encyclopedia of Philosophy.
XIV*—Ontological Dependence.Kit Fine - 1995 - Proceedings of the Aristotelian Society 95 (1):269-290.
Ontological Dependency.E. J. Lowe - 1994 - Philosophical Papers 23 (1):31-48.

View all 7 references / Add more references