Compactness in constructive analysis revisited

DOI10.1016/0168-0072(87)90010-8zbMath0639.03060OpenAlexW1967704436MaRDI QIDQ1100202

Christoph Kreitz, Weihrauch, Klaus

Publication date: 1987

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(87)90010-8

zbMATH Keywords

topologydiscontinuityconstructive analysisHeine-Borel theoremconstructive compactness

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Foundations: limits and generalizations, elementary topology of the line (26A03) Other constructive mathematics (03F65)

Related Items

Relative computability and uniform continuity of relations, Type 2 computational complexity of functions on Cantor's space, Computability on computable metric spaces, Computable invariance, Computability on continuous, lower semi-continuous and upper semi-continuous real functions, Computability on subsets of Euclidean space. I: Closed and compact subsets, Effectiveness of the global modulus of continuity on metric spaces, Weihrauch Complexity in Computable Analysis

Cites Work

• Type 2 recursion theory
• Theory of representations
• Representations of the real numbers and of the open subsets of the set of real numbers
• Discussion on: ``An optimal control approach for hybrid systems
• Unnamed Item
• Unnamed Item
• Unnamed Item