论文信息 - Logic of Proofs with the Strong Provability Operator

Logic of Proofs with the Strong Provability Operator

Logics with the strong provability operator \: : : is true and provable" together with the proof operators \p is a proof of : : :" are axiomatized. Kripke-style completeness, decidability and arithmetical completeness of these logics are established.

Elena Nogina

[1] J.F.A.K. van Benthem,et al. Modal logic and classical logic , 1983 .

[2] Sergei N. Artëmov. Kolmogorov's Logic of Problems and a Provability Interpretation of Intuitionistic Logic , 1990, TARK.

[3] ScienceDirect. Annals of mathematical logic , 1969, Journal of Symbolic Logic.

[4] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .

[5] Sergei N. Artëmov. Logic of Proofs , 1994, Ann. Pure Appl. Log..

[6] Alexei Yu. Muravitsky,et al. On superintuitionistic logics as fragments of proof logic extensions , 1986, Stud Logica.