Completeness: when enough is enough

DOI10.25537/DM.2019V24.899-914zbMath1448.03051MaRDI QIDQ2003502

Matthew Hendtlass, Hannes Diener

Publication date: 9 July 2019

Published in: Documenta Mathematica (Search for Journal in Brave)

zbMATH Keywords

completenessconstructive mathematicscomputable analysis

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Constructive and recursive analysis (03F60) Intuitionistic mathematics (03F55) Computation over the reals, computable analysis (03D78)

Related Items (2)

Differentiating convex functions constructively ⋮ Unnamed Item

Cites Work

• Linear mappings are fairly well-behaved
• Techniques of constructive analysis
• Constructively Complete Finite Sets
• Constructive continuity
• Continuity and nondiscontinuity in constructive mathematics
• Continuity properties in constructive mathematics
• A weak countable choice principle
• On the failure of BD-ℕ and BD, and an application to the anti-specker property
• Bishop's Lemma
• Applied Proof Theory: Proof Interpretations and Their Use in Mathematics
• Intuitionistic notions of boundedness in ℕ
• Variations on a theme by Ishihara
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness: when enough is enough