- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A Theory of Particular Sets
Abstract
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this problem by speaking only about particular sets.Author's Profile
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Only published works are available at libraries.
My notes
Similar books and articles
Register computations on ordinals.Peter Koepke & Ryan Siders - 2008 - Archive for Mathematical Logic 47 (6):529-548.
Natural deduction based set theories: a new resolution of the old paradoxes.Paul C. Gilmore - 1986 - Journal of Symbolic Logic 51 (2):393-411.
Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
On plural reference and elementary set theory.Helen Morris Cartwright - 1993 - Synthese 96 (2):201 - 254.
Natural Deduction for Three-Valued Regular Logics.Yaroslav Petrukhin - 2017 - Logic and Logical Philosophy 26 (2):197–206.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers.Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.
Sets, properties, and unrestricted quantification.Øystein Linnebo - 2006 - In Gabriel Uzquiano & Agustin Rayo (eds.), Absolute Generality. Oxford University Press. pp. 149--178.
Review: Piergiorgio Odifreddi, Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers. [REVIEW]Peter G. Hinman - 1990 - Journal of Symbolic Logic 55 (3):1307-1308.
Tabular degrees in \Ga-recursion theory.Colin Bailey & Rod Downey - 1992 - Annals of Pure and Applied Logic 55 (3):205-236.
A consistent theory of attributes in a logic without contraction.Richard B. White - 1993 - Studia Logica 52 (1):113 - 142.
Analytics
Added to PP
2019-06-14
Downloads
34 (#467,440)
6 months
7 (#419,182)
2019-06-14
Downloads
34 (#467,440)
6 months
7 (#419,182)
Historical graph of downloads
Author's Profile
References found in this work
The modal logic of set-theoretic potentialism and the potentialist maximality principles.Joel David Hamkins & Øystein Linnebo - 2022 - Review of Symbolic Logic 15 (1):1-35.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-zf4z4 uwo