A propositional logic with explicit fixed points
暂无分享,去创建一个
This paper studies a propositional logic which is obtained by interpreting implication as formal provability. It is also the logic of finite irreflexive Kripke Models.A Kripke Model completeness theorem is given and several completeness theorems for interpretations into Provability Logic and Peano Arithmetic.
[1] George Boolos,et al. Provability, truth, and modal logic , 1980, J. Philos. Log..
[2] Craig Smorynski,et al. Calculating self-referential statements, I: Explicit calculations , 1979 .
[3] R. Solovay. Provability interpretations of modal logic , 1976 .
[4] Michael Dummett,et al. A propositional calculus with denumerable matrix , 1959, Journal of Symbolic Logic (JSL).