The strength of compactness for countable complete linear orders

2019/04/02 by Shafer, Paul · 1 citation
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.1904.01482

Abstract

We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If we require that open covers must be uniformly expressible as unions of basic open sets, then the compactness of complete linear orders is equivalent to WKL₀ over RCA₀. If open covers need not be uniformly expressible as unions of basic open sets, then the compactness of complete linear orders is equivalent to ACA₀ over RCA₀. This answers a question of François Dorais.

Cited by

• Computability of Separation Axioms in Countable Second Countable Spaces

Related

• Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces. IV
• Combinatorial and model-theoretical principles related to regularity of ultrafilters and compactness of topological spaces. III
• Order convergence and compactness
• Initial λ-compactness in linearly ordered spaces
• Simple way to prove compactness of closed intervals in simply ordered set with order topology