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 Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
Reprint years 2007
DOI 10.1007/s11225-006-9014-9
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history
Request removal from index
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 28,233
Through your library
References found in this work BETA
Independence Results Around Constructive ZF.Robert S. Lubarsky - 2005 - Annals of Pure and Applied Logic 132 (2-3):209-225.
On Constructing Completions.Laura Crosilla, Hajime Ishihara & Peter Schuster - 2005 - Journal of Symbolic Logic 70 (3):969-978.

Add more references

Citations of this work BETA
Refinement is Equivalent to Fullness.Albert Ziegler - 2010 - Mathematical Logic Quarterly 56 (6):666-669.

Add more citations

Similar books and articles
Problem Representation for Refinement.Halil A. Guvenir & Varol Akman - 1992 - Minds and Machines 2 (3):267-282.
Strong Analogues of Martin's Axiom Imply Axiom R.Robert E. Beaudoin - 1987 - Journal of Symbolic Logic 52 (1):216-218.
Rabin's Uniformization Problem.Yuri Gurevich & Saharon Shelah - 1983 - Journal of Symbolic Logic 48 (4):1105-1119.
On the Reducibility of Questions.Andrzej Wiśniewski - 1994 - Erkenntnis 40 (2):265-284.
On Constructing Completions.Laura Crosilla, Hajime Ishihara & Peter Schuster - 2005 - Journal of Symbolic Logic 70 (3):969-978.
On the Constructive Dedekind Reals.Robert S. Lubarsky & Michael Rathjen - 2008 - Logic and Analysis 1 (2):131-152.

Monthly downloads

Added to index

2009-01-28

Total downloads

44 ( #118,800 of 2,172,871 )

Recent downloads (6 months)

1 ( #324,901 of 2,172,871 )

How can I increase my downloads?

My notes
Sign in to use this feature


Discussion
Order:
There  are no threads in this forum
Nothing in this forum yet.

Other forums