Derivability in certain subsystems of the Logic of Proofs is Pi2p-complete
暂无分享,去创建一个
[1] Melvin Fitting,et al. The logic of proofs, semantically , 2005, Ann. Pure Appl. Log..
[2] Sergei N. Artëmov. Evidence-Based Common Knowledge , 2005 .
[3] Roman Kuznets. On the Complexity of Explicit Modal Logics , 2000, CSL.
[4] Sergei N. Artëmov. Back to the Future: Explicit Logic for Computer Science (Invited Lecture) , 2003, CSL.
[5] Sergei N. Artëmov. Explicit provability and constructive semantics , 2001, Bull. Symb. Log..
[6] Helmut Schwichtenberg,et al. Basic proof theory , 1996, Cambridge tracts in theoretical computer science.
[7] Max J. Cresswell,et al. A New Introduction to Modal Logic , 1998 .
[8] Roman Kuznets. ON DECIDABILITY OF THE LOGIC OF PROOFS WITH ARBITRARY CONSTANT SPECIFICATIONS , 2001 .
[9] P. Pudlák. Chapter VIII - The Lengths of Proofs , 1998 .
[10] Sergei N. Artëmov,et al. The Basic Logic of Proofs , 1992, CSL.
[11] Flórián Lengyel,et al. More Existence Theorems for Recursion Categories , 2003, Ann. Pure Appl. Log..
[12] Sergei N. Artëmov. Unified Semantics for Modality and Lambda-terms via Proof Polynomials , 2002 .
[13] Alexey Mkrtychev,et al. Models for the Logic of Proofs , 1997, LFCS.
[14] K. Gödel,et al. Kurt Gödel : collected works , 1986 .
[15] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..