arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1509.08003cs.LO
收藏

避免悖论中的矛盾,停止问题和对角化

Avoiding Contradictions in the Paradoxes, the Halting Problem, and Diagonalization

Timothy J. Armstrong

摘要:

本文的基本命题是:(f ~f)形式的逻辑公式<->不是矛盾式,(t t)形式的公式<->不是重言式。这样的公式,无论它们在数学中出现在哪里,都是得出f和t有第三个真值的理由,不同于真和假。这些公式是f和t的循环定义。我们可以将蕴涵公式(f <->~f)解释为一个规则,一个过程,以找到f在左侧的真值:我们只需要找到f在右侧的真值。当我们用规则来问f和t是真还是假时,我们需要一遍又一遍地问它们是真还是假,直到永远。罗素悖论和说谎者悖论都有(f <->~f)的形式。真值提供了一种直接的方法来避免这些问题中的矛盾。一个广泛的后果是,涉及形式(f ~f)的公式的矛盾证明技术<->变得无效。一个这样的反证是证明停机问题是不可计算的一种形式。真值也出现在康托的对角线论证、贝瑞悖论和格林-纳尔逊悖论中。

英文摘要:

The fundamental proposal in this article is that logical formulas of the form (f <-> ~f) are not contradictions, and that formulas of the form (t <-> t) are not tautologies. Such formulas, wherever they appear in mathematics, are instead reason to conclude that f and t have a third truth value, different from true and false. These formulas are circular definitions of f and t. We can interpret the implication formula (f <-> ~f) as a rule, a procedure, to find the truth value of f on the left side: we just need to find the truth value of f on the right side. When we use the rules to ask if f and t are true or false, we need to keep asking if they are true or false over and over, forever. Russell's paradox and the liar paradox have the form (f <-> ~f). The truth value provides a straightforward means of avoiding contradictions in these problems. One broad consequence is that the technique of proof by contradiction involving formulas of the form (f <-> ~f) becomes invalid. One such proof by contradiction is one form of proof that the halting problem is uncomputable. The truth value also appears in Cantor's diagonal argument, Berry's paradox, and the Grelling-Nelson paradox.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑