Binary refinement implies discrete exponentiation
Studia Logica 84 (3):361 - 368 (2006)
| Abstract | Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary re.nement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary re.nement implies that the class of detachable subsets of a set form a set. Binary re.nement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was su.cient to prove that the Dedekind reals form a set. Here we show that the Cauchy reals also form a set. More generally, binary refinement ensures that one remains in the realm of sets when one starts from discrete sets and one applies the operations of exponentiation and binary product a finite number of times. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJohannes Heidema (1990). An Axiom Schema of Comprehension of Zermelo–Fraenkel–Skolem Set Theory. History and Philosophy of Logic 11 (1):59-65.
Halil A. Guvenir & Varol Akman (1992). Problem Representation for Refinement. Minds and Machines 2 (3):267-282.
Robert E. Beaudoin (1987). Strong Analogues of Martin's Axiom Imply Axiom R. Journal of Symbolic Logic 52 (1):216-218.
Masaru Shirahata (1996). A Linear Conservative Extension of Zermelo-Fraenkel Set Theory. Studia Logica 56 (3):361 - 392.
Alexander S. Kechris (1978). The Perfect Set Theorem and Definable Wellorderings of the Continuum. Journal of Symbolic Logic 43 (4):630-634.
Yuri Gurevich & Saharon Shelah (1983). Rabin's Uniformization Problem. Journal of Symbolic Logic 48 (4):1105-1119.
Andrzej Wisniewski (1994). On the Reducibility of Questions. Erkenntnis 40 (2):265 - 284.
Andrzej Wiśniewski (1994). On the Reducibility of Questions. Erkenntnis 40 (2):265-284.
Laura Crosilla, Hajime Ishihara & Peter Schuster (2005). On Constructing Completions. Journal of Symbolic Logic 70 (3):969 - 978.
Robert S. Lubarsky & Michael Rathjen (2008). On the Constructive Dedekind Reals. Logic and Analysis 1 (2):131-152.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads8 ( #123,218 of 549,359 )Recent downloads (6 months)1 ( #63,397 of 549,359 )How can I increase my downloads? |
My notes
Discussion
