
A system of pair sentential calculus that has a representation of the Liar sentenceA system of pair sentential calculus that has a representation of the Liar sentenceAA11231962 A system of pair sentential calculus that has a representation of the Liar sentence 
"/石井,忠夫/"石井,忠夫
1pp.1

10 , 20150401 , 新潟国際情報大学情報文化学部
ISSN:1343490X
NCID:AA11231962
Description
In this paper we will introduce a referential relation between pairsentences similar to the identity connective in SCI. Here pairsentence statements of the form (A,B) read as “A is referential to B”. Then by interpreting the pairsentence (A,B) as a sequence of referential relation such that the referential recursive pattern A B0 B1 B2 . . .B0 B1 B2 . . .holds, we will formalize a pair sentential calculus and represent the behavior of Liar sentence.To formalize the pair sentential calculus, we firstly introduce the stage numbers i, j in which each of pairsentence holds, i.e., (Ai,Bj) and which means a situation of A at a stage i is referential to the situation of B at a stage j. We also introduce a referential cycle number of (Ai,Bj) and by using of this cycle number, we may classify pairsentences into two categories, that is, categorical and paradoxical. Then each Liar sentence has a referential cycle number of n such that n 2 and is paradoxical.
FullText
http://lbir.nuis.ac.jp/infolib/user_contents/lbir/kiyo/kiyo_2015.01.03.pdf