Bishop-Style Constructive Reverse Mathematics
From MaRDI portal
Publication:5024576
DOI10.1007/978-3-030-59234-9_10OpenAlexW3168815509MaRDI QIDQ5024576
Hajime Ishihara, Hannes Diener
Publication date: 26 January 2022
Published in: Theory and Applications of Computability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-59234-9_10
Related Items (2)
The Monotone Completeness Theorem in Constructive Reverse Mathematics ⋮ Lawvere-Tierney topologies for computability theorists
Cites Work
- Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative
- The uniform boundedness theorem and a boundedness principle
- Realizability models refuting Ishihara's boundedness principle
- Linear mappings are fairly well-behaved
- Classifying Dini's theorem
- Some principles weaker than Markov's principle
- On the disjunctive Markov principle
- Sequences of real functions on [0,1 in constructive reverse mathematics]
- Realizability. An introduction to its categorical side
- A uniformly continuous function on [0,1 that is everywhere different from its infimum]
- Constructivism in mathematics. An introduction. Volume II
- Markov's principle, Church's thesis and Lindelöf's theorem
- The binary expansion and the intermediate value theorem in constructive reverse mathematics
- On Brouwer's continuity principle
- Reclassifying the antithesis of Specker's theorem
- Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
- Some intuitionistic equivalents of classical principles for degree 2 formulas
- A fan-theoretic equivalent of the antithesis of Specker's theorem
- Intuitionism. An introduction. 3rd revised ed
- Weak König’s Lemma Implies the Uniform Continuity Theorem
- The Vitali Covering Theorem in the Weihrauch Lattice
- SEPARATING FRAGMENTS OF WLEM, LPO, AND MP
- Constructively Complete Finite Sets
- Weihrauch degrees, omniscience principles and weak computability
- Effective Choice and Boundedness Principles in Computable Analysis
- http://logicandanalysis.org/index.php/jla/article/viewFile/114/41
- The Vitali covering theorem in constructive mathematics
- Fixed point theorems in constructive mathematics
- Constructive continuity
- A Bizarre Property Equivalent to the -Fan Theorem
- Limited Omniscience and the Bolzano-Weierstrass Principle
- Continuity and nondiscontinuity in constructive mathematics
- Continuity properties in constructive mathematics
- Constructive set theory
- A Definitive Constructive Open Mapping Theorem?
- A constructive look at the completeness of the space (ℝ)
- An omniscience principle, the König Lemma and the Hahn‐Banach theorem
- Arguments for the Continuity Principle
- On Weak Markov's Principle
- On the failure of BD-ℕ and BD, and an application to the anti-specker property
- The pseudocompactness of [0.1 is equivalent to the uniform continuity theorem]
- Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
- Brouwer's fan theorem and unique existence in constructive analysis
- Intuitionistic notions of boundedness in ℕ
- New Computational Paradigms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Bishop-Style Constructive Reverse Mathematics
