Problems, solutions, and completions
From MaRDI portal
Publication:1044674
DOI10.1016/j.jlap.2009.02.007zbMath1184.03059OpenAlexW2090163016MaRDI QIDQ1044674
Publication date: 18 December 2009
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2009.02.007
Complete metric spaces (54E50) Constructive and recursive analysis (03F60) Axiom of choice and related propositions (03E25)
Related Items
Cites Work
- 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
- Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation
- Equivalents of the (weak) fan theorem
- Techniques of constructive analysis
- Binary refinement implies discrete exponentiation
- Classifying Dini's theorem
- A constructive and functorial embedding of locally compact metric spaces into locales
- Borel complexity and computability of the Hahn-Banach theorem
- Unique existence, approximate solutions, and countable choice.
- Spreads and choice in constructive mathematics.
- Investigation of constructive functions by the method of fillings
- Intuitionism As Generalization
- The Dedekind reals in abstract Stone duality
- Unique solutions
- Countable Choice as a Questionable Uniformity Principle
- Unique Existence and Computability in Constructive Reverse Mathematics
- Problems as Solutions
- Real numbers and other completions
- The fan theorem and unique existence of maxima
- New Computational Paradigms
- On constructing completions
- Logical Approaches to Computational Barriers
- The fundamental theorem of algebra: a constructive development without choice.
