Refinement is equivalent to fullness

DOI10.1002/MALQ.200910115MaRDI QIDQ3066297zbMATH OpenOpenAlexFDO

Authors Albert Ziegler

Publication date 10 January 2011

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200910115

zbMATH Keywords

constructive set theoryconstructivismCSTCZFfullnesssubset collection

Mathematics Subject Classification ID

Nonclassical and second-order set theories (03E70) Other constructive mathematics (03F65)

Recommendations

• Binary refinement implies discrete exponentiation
• A generalized cut characterization of the fullness axiom in CZF
• On constructing completions
• scientific article; zbMATH DE number 1929312
• The shrinking principle and the axiom of choice

Cites work

• Binary refinement implies discrete exponentiation
• Constructive set theory
• On constructing completions
• On the constructive Dedekind reals
• The disjunction and related properties for constructive Zermelo-Fraenkel set theory

This page was built for publication: Refinement is equivalent to fullness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066297)