Some axioms for constructive analysis
From MaRDI portal
Publication:453178
DOI10.1007/s00153-012-0273-zzbMath1262.03125MaRDI 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 choice; recursive analysis; weak König's lemma; intuitionistic analysis; axioms; classical analysis; constructive analysis; minimal formal theories of numbers and number sequences
03F60: Constructive and recursive analysis
03F35: Second- and higher-order arithmetic and fragments
03F50: Metamathematics of constructive systems
03F55: Intuitionistic mathematics
Related Items
MARKOV’S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS, Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative, Solovay's relative consistency proof for FIM and BI
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?
