Derivability in certain subsystems of the Logic of Proofs is Π2p-complete

Annals of Pure and Applied Logic

Volumn 145, Issue 3, 2007, Pages 223-239

  Milnikel, Robert ^a  

^a KENYON COLLEGE   (United States)

Author keywords

Complexity; Logic of Belief; Logic of Proofs

Indexed keywords

EID: 33845866347     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2006.03.001     Document Type: Article

References (17)

1. Artemov S.N., and Strassen T. The basic logic of proofs. In: Borger E., Jager G., Buning H.K., Martini S., and Richter M. (Eds). Computer Science Logic, 6th Workshop, Selected Papers. San Miniato, Italy. Lecture Notes in Computer Science vol. 702 (1992) 14-28
2. Artemov S.N. Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7 1 (2001) 1-36
3. S.N. Artemov, Unified semantics for modality and lambda-terms via proof polynomials, in: K. Vermulen, A. Copestake (Eds.), Algebras, Diagrams and Decisions in Language, Logic and Computation, Stanford, CA, 2002
4. Artemov S.N. Back to the future: Explicit logic for computer science. In: Baaz M., and Makowsky J. (Eds). Computer Science Logic, Proceedings of the 12th annual workshop. Lecture Notes in Computer Science vol. 2803 (2003), Springer 43
5. S.N. Artemov, Evidence-based common knowledge, Tech. Rep. TR-2004018, City University of New York, 2004
6. V. Brezhnev, On the logic of proofs, in: Proceedings of the Sixth ESSLLI Student Session, Helsinki, 2001, pp. 35-46
7. Fitting M. The logic of proofs, semantically. Annals of Pure and Applied Logic 125 (2005) 1-25
8. Gödel K. Eine interpretation des intuitionistischen aussagenkalkuls. Ergebnisse eines Mathematische Kolloquium 4 (1933) 39-40
9. Gödel K. Vortrag bei zilsel, 1938. In: Feferman S. (Ed). Kurt Godel Collected Works vol. III (1995), Oxford University Press, Oxford 86-113
10. G.E. Hughes, M.J. Cresswell, A New Introduction to Modal Logic, Routledge, Oxford, 1996
11. Kuznets R. On the complexity of explicit modal logics. Proceedings of the 14th International Workshop on Computer Science Logic (2000), Springer-Verlag, Berlin 371-383
12. Kuznets R. On decidability of the logic of proofs with arbitrary constant specifications. Bulletin of the Association for Symbolic Logic 11 1 (2005) 114 Abstract only
13. Ladner R. The computational complexity of provability in systems of modal propositional logic. SIAM Journal of Computing 6 3 (1977) 467-480
14. Mkrtychev A. Models for the logic of proofs. In: Adain S., and Nerode A. (Eds). Logical Foundations of Computer Science'97. Lecture Notes in Computer Science vol. 1234 (1997), Springer-Verlag, Berlin 266-277
15. Papadimitriou C.H. Computational Complexity (1993), Addison-Wesley, Boston, MA
16. Pudlák P. The lengths of proofs. In: Buss S.R. (Ed). The Handbook of Proof Theory (1998), Elsevier, Amsterdam 547-637
17. Troelstra A., and Schwichtenburg H. Basic Proof Theory (1996), Cambridge University Press, Cambridge