On the complexity of the reflected logic of proofs

Theoretical Computer Science

Volumn 357, Issue 1-3, 2006, Pages 136-142

  Krupski, Nikolai V ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

Author keywords

Complexity; Disjunctive property; Logic of proofs; Proof polynomials; Symbolic models

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

DISJUNCTIVE PROPERTY; LOGIC OF PROOFS; PROOF POLYNOMIALS; SYMBOLIC MODELS;

FORMAL LOGIC;

EID: 33745381221     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.03.015     Document Type: Article

References (7)

1. S. Artemov, Operational Modal Logic, Technical Report MSI 95-29, Cornell University, 1995.
2. Artemov S. Explicit provability and constructive semantics. Bulletin of Symbolic Logic 7 1 (2001) 1-36
3. Artemov S. Kolmogorov and Gödel's approach to intuitionistic logic: current developments. Russian Math. Surveys 59 2 (2004) 203-229
4. Bidoit M., and Corbin J. A Rehabilitation of Robinson's Unification Algorithm. Inform. Process. 83 (1983) 909-914
5. V. Brezhnev, R. Kuznets, Making proofs explicit; how hard it is? Theoret. Comput. Sci., this volume.
6. Kuznets R. On the complexity of explicit modal logics. in: Computer Science Logic 2000, Lecture Notes in Computer Science Vol. 1862 (2000), Springer, Berlin 371-383
7. Mkrtychev A. Models for the logic of proofs. in: Logical Foundations of Computer Science' 97, Yaroslavl', Lecture Notes in Computer Science Vol. 1234 (1997), Springer, Berlin 266-275