Studia Logica 84 (3):361-368 (2006)

Authors
Laura Crosilla
University of Oslo
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.
Keywords Philosophy   Computational Linguistics   Mathematical Logic and Foundations   Logic
Categories (categorize this paper)
Reprint years 2007
ISBN(s)
DOI 10.1007/s11225-006-9014-9
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,214
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

A Splitting Logic in NExt(KTB).Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381 - 394.
A Splitting Logic in NExt.Yutaka Miyazaki - 2007 - Studia Logica 85 (3):381-394.
Logic, Language, and Information.L. T. F. Gamut - 1999 - Studia Logica 63 (2):269-272.
Categorical Logic and Type Theory.B. Jacobs - 2001 - Studia Logica 69 (3):429-431.
Sentential Probability Logic.Theodore Hailperin - 2000 - Studia Logica 64 (3):405-408.
Vito F. Sinisi, Applied Logic.James Chase - 2002 - Studia Logica 70 (3):444-445.
Bernard Linsky, Russell's Metaphysical Logic.Judy Pelham - 2002 - Studia Logica 70 (3):441-444.

Analytics

Added to PP index
2009-01-28

Total views
126 ( #92,775 of 2,507,565 )

Recent downloads (6 months)
1 ( #416,983 of 2,507,565 )

How can I increase my downloads?

Downloads

My notes