交互计算的次协调性
Paraconsistency of Interactive Computation
摘要：
计算逻辑的目标是使我们能够对计算进行建模和推理，我们认为计算逻辑必须能够对交互式计算进行建模。我们表明，一阶逻辑不能模拟交互式计算，由于交互的不完整性。我们表明，交互式计算必然是次协调的，能够模拟的事实和它的否定，由于世界（环境）的作用，在确定的过程中的计算。我们的结论是，次协调是一个必要的属性的逻辑，可以模拟交互式计算。
英文摘要：
The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that first-order logic cannot model interactive computation due to the incompleteness of interaction. We show that interactive computation is necessarily paraconsistent, able to model both a fact and its negation, due to the role of the world (environment) in determining the course of the computation. We conclude that paraconsistency is a necessary property for a logic that can model interactive computation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
