Binary refinement implies discrete exponentiation

DOI10.1007/s11225-006-9014-9zbMath1112.03048OpenAlexW2100453004WikidataQ61835220 ScholiaQ61835220MaRDI QIDQ861570

Erik Palmgren, Peter Aczel, Hajime Ishihara, Laura Crosilla, Peter M. Schuster

Publication date: 29 January 2007

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-006-9014-9

zbMATH Keywords

Cauchy realsCZFConstructive set theoryExponentiation axiom

Mathematics Subject Classification ID

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

Related Items

Are there enough injective sets? ⋮ The Jacobson radical for an inconsistency predicate ⋮ The shrinking principle and the axiom of choice ⋮ Refinement is equivalent to Fullness ⋮ The Hahn-Banach theorem by disjunction elimination ⋮ Problems, solutions, and completions

Cites Work

• The shrinking principle and the axiom of choice
• Independence results around constructive ZF
• ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
• On constructing completions
• Unnamed Item
• Unnamed Item
• Unnamed Item