The strength of compactness for countable complete linear orders

COMPUTABILITY-THE JOURNAL OF THE ASSOCIATION CIE(2019)

引用 3|浏览3
暂无评分
摘要
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 $\mathsf{WKL}_0$ over $\mathsf{RCA}_0$. If open covers need not be uniformly expressible as unions of basic open sets, then the compactness of complete linear orders is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$. This answers a question of Fran\c{c}ois Dorais.
更多
查看译文
关键词
Reverse mathematics, linear orders, order topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要