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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aczel, Peter, ’The type theoretic interpretation of constructive set theory‘, in A. Macintyre, L. Pacholski, and J. Paris (eds.), Logic Colloquium ‘77, North-Holland, Amsterdam, 1978, pp. 55–66.
Aczel, Peter, ’The type theoretic interpretation of constructive set theory: choice principles‘, in A.S. Troelstra, and D. van Dalen (eds.), The L.E.J. Brouwer Centenary Symposium, North-Holland, Amsterdam, 1982, pp. 1–40.
Aczel, Peter, ’The type theoretic interpretation of constructive set theory: inductive definitions‘, in R. Barcan Marcus, G.J.W. Dorn, and P. Weingartner (eds.), Logic, Methodology, and Philosophy of Science VII, North-Holland, Amsterdam, 1986, pp. 17–49.
Aczel, Peter, and Michael Rathjen, Notes on Constructive Set Theory, Institut Mittag-Le.er. Preprint 40, 2000/01.
Banaschewski, Bernhard, and Peter Schuster, ’The shrinking principle and the axiom of choice.‘ Preprint, University of Munich, 2006.
Bishop, Errett, ’Mathematics as a numerical language‘, in A. Kino, J. Myhill, and R.E. Vesley (eds.), Intuitionism and Proof Theory, North-Holland, Amsterdam, 1970, pp. 53–71.
Crosilla, Laura, Hajime Ishihara, and Peter Schuster, ’On constructing completions‘, J. Symbolic Logic 70 (2005), 969–978.
Gödel, KurtKurt, ‘Uber eine bisher noch nicht benützte Erweiterung des finiten Standpunkts’, Dialectica 12 (1958), 280–287.
Lubarsky, Robert, ’Independence results around constructive ZF‘, Ann. Pure Appl. Logic 132 (2005), 209–225.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aczel, P., Crosilla, L., Ishihara, H. et al. Binary Refinement Implies Discrete Exponentiation. Stud Logica 84, 361–368 (2006). https://doi.org/10.1007/s11225-006-9014-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-006-9014-9