Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Binary Refinement Implies Discrete Exponentiation

Peter Aczel, Laura Crosilla, Hajime Ishihara, Erik Palmgren and Peter Schuster
Studia Logica: An International Journal for Symbolic Logic
Vol. 84, No. 3 (Dec., 2006), pp. 361-368
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016839
Page Count: 8
  • Download ($43.95)
  • Cite this Item
Binary Refinement Implies Discrete Exponentiation
Preview not available

Abstract

Working in the weakening of constructive Zermelo-Fraenkel set theory in which the subset collection scheme is omitted, we show that the binary refinement principle implies all the instances of the exponentiation axiom in which the basis is a discrete set. In particular binary refinement implies that the class of detachable subsets of a set form a set. Binary refinement was originally extracted from the fullness axiom, an equivalent of subset collection, as a principle that was sufficient 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.

Page Thumbnails

  • Thumbnail: Page 
[361]
    [361]
  • Thumbnail: Page 
362
    362
  • Thumbnail: Page 
363
    363
  • Thumbnail: Page 
364
    364
  • Thumbnail: Page 
365
    365
  • Thumbnail: Page 
366
    366
  • Thumbnail: Page 
367
    367
  • Thumbnail: Page 
368
    368