On constructing completions

Journal of Symbolic Logic 70 (3):969-978 (2005)
The Dedekind cuts in an ordered set form a set in the sense of constructive Zermelo—Fraenkel set theory. We deduce this statement from the principle of refinement, which we distill before from the axiom of fullness. Together with exponentiation, refinement is equivalent to fullness. None of the defining properties of an ordering is needed, and only refinement for two—element coverings is used. In particular, the Dedekind reals form a set; whence we have also refined an earlier result by Aczel and Rathjen, who invoked the full form of fullness. To further generalise this, we look at Richman's method to complete an arbitrary metric space without sequences, which he designed to avoid countable choice. The completion of a separable metric space turns out to be a set even if the original space is a proper class; in particular, every complete separable metric space automatically is a set
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2178/jsl/1122038923
 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
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,209
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Robert S. Lubarsky (2005). Independence Results Around Constructive ZF. Annals of Pure and Applied Logic 132 (2-3):209-225.
Sara Negri & Daniele Soravia (1999). The Continuum as a Formal Space. Archive for Mathematical Logic 38 (7):423-447.

Add more references

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

Add more citations

Similar books and articles
David Pincus (1997). The Dense Linear Ordering Principle. Journal of Symbolic Logic 62 (2):438-456.

Monthly downloads

Added to index


Total downloads

7 ( #507,588 of 1,941,072 )

Recent downloads (6 months)

1 ( #458,101 of 1,941,072 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.