实数不可数性的构造性Knaster-Tarski证明
A constructive Knaster-Tarski proof of the uncountability of the reals
摘要：
我们给出了实数的不可数性证明，它依赖于实数的序完备性而不是序列完备。我们既不使用选择公理的形式，也不使用排中律排中律，因此证明适用于任何构造性数学中的麦克尼尔实数。证明严重依赖利维的不寻常的证明的不可数的实数。
英文摘要：
We give an uncountability proof of the reals which relies on their order completeness instead of their sequential completeness. We use neither a form of the axiom of choice nor the law of excluded middle, therefore the proof applies to the MacNeille reals in any flavor of constructive mathematics. The proof leans heavily on Levy's unusual proof of the uncountability of the reals.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
