Some axioms for constructive analysis
DOI10.1007/S00153-012-0273-ZzbMath1262.03125OpenAlexW2057631483MaRDI QIDQ453178
Joan Rand Moschovakis, Garyfallia Vafeiadou
Publication date: 18 September 2012
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-012-0273-z
countable choicerecursive analysisweak König's lemmaintuitionistic analysisaxiomsclassical analysisconstructive analysisminimal formal theories of numbers and number sequences
Constructive and recursive analysis (03F60) Second- and higher-order arithmetic and fragments (03F35) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalents of the (weak) fan theorem
- Sequences of real functions on [0,1 in constructive reverse mathematics]
- Constructivism in mathematics. An introduction. Volume II
- Lifschitz' realizability
- Brouwer’s Approximate Fixed-Point Theorem is Equivalent to Brouwer’s Fan Theorem
- Some applications of Kripke models to formal systems of intuitionistic analysis
- Note on the fan theorem
- Brouwer's fan theorem and unique existence in constructive analysis
- Formalized recursive functionals and formalized realizability
- Can there be no nonrecursive functions?
This page was built for publication: Some axioms for constructive analysis