命题作为博弈的求真表示

Representations of Computing Truths of Propositions as Games

在Giorgi Japaridze引入的可计算性逻辑中,提出了将命题作为博弈,命题的真值由博弈结果得到的基本思想。本文通过引入环境状态概念,给出了命题求真过程的形式化表示方法。基于这样的处理,利用从命题逻辑到模态命题逻辑的研究方法,我们可以研究模态可计算性逻辑、线性时序可计算性逻辑、以及行为时序可计算性逻辑。

The basic idea taking propositions as games and truths of propositions from results of gaming was presented in computability logic introduced by Giorgi Japaridze. In this paper, the formal method of computing truths of propositions as games was investigated by introducing the concept of environment states. Based on the processing method from propositional logic to modal logic, one can research modal computability logic, linear temporal computability logic, temporal computability logic of actions, and so on.