On Constructing Completions
Journal of Symbolic Logic 70 (3):969 - 978 (2005)
| Abstract | 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 | ||||||||||
| 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 |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesPeter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren & Peter Schuster (2006). Binary Refinement Implies Discrete Exponentiation. Studia Logica 84 (3):361 - 368.
Robert S. Lubarsky & Michael Rathjen (2008). On the Constructive Dedekind Reals. Logic and Analysis 1 (2):131-152.
Carl Mummert & Stephen G. Simpson (2005). Reverse Mathematics and Π21 Comprehension. Bulletin of Symbolic Logic 11 (4):526-533.
Juris Steprāns (1999). Unions of Rectifiable Curves in Euclidean Space and the Covering Number of the Meagre Ideal. Journal of Symbolic Logic 64 (2):701-726.
Ferenc Beleznay (1999). The Complexity of the Collection of Countable Linear Orders of the Form I + I. Journal of Symbolic Logic 64 (4):1519-1526.
Kenneth Schilling & Boško Živaljević (1997). Louveau's Theorem for the Descriptive Set Theory of Internal Sets. Journal of Symbolic Logic 62 (2):595-607.
David Pincus (1997). The Dense Linear Ordering Principle. Journal of Symbolic Logic 62 (2):438-456.
Neil Immerman, Jonathan F. Buss & David A. Mix Barrington (2001). Number of Variables is Equivalent to Space. Journal of Symbolic Logic 66 (3):1217-1230.
Andreas Blass (1981). The Model of Set Theory Generated by Countably Many Generic Reals. Journal of Symbolic Logic 46 (4):732-752.
Michael Rathjen (2005). The Disjunction and Related Properties for Constructive Zermelo-Fraenkel Set Theory. Journal of Symbolic Logic 70 (4):1233 - 1254.
Paul Bankston & Wim Ruitenburg (1990). Notions of Relative Ubiquity for Invariant Sets of Relational Structures. Journal of Symbolic Logic 55 (3):948-986.
Mariagnese Giusto & Stephen G. Simpson (2000). Located Sets and Reverse Mathematics. Journal of Symbolic Logic 65 (3):1451-1480.
Joshua B. Tenenbaum & Thomas L. Griffiths (2001). Generalization, Similarity, and Bayesian Inference. Behavioral and Brain Sciences 24 (4):629-640.
Johannes Heidema (1990). An Axiom Schema of Comprehension of Zermelo–Fraenkel–Skolem Set Theory. History and Philosophy of Logic 11 (1):59-65.
Analytics
Monthly downloads |
Added to index2010-08-24Total downloads2 ( #232,628 of 549,198 )Recent downloads (6 months)1 ( #63,397 of 549,198 )How can I increase my downloads? |
My notes
Discussion
