On the complexity of the reflected logic of proofs

DOI10.1016/j.tcs.2006.03.015zbMath1094.03046OpenAlexW2032493730MaRDI QIDQ2500485

Nikolai Krupski

Publication date: 16 August 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.03.015

zbMATH Keywords

complexitylogic of proofssymbolic modelsdisjunctive propertyproof polynomials

Mathematics Subject Classification ID

Provability logics and related algebras (e.g., diagonalizable algebras) (03F45) Complexity of proofs (03F20)

Related Items

NEXP-Completeness and Universal Hardness Results for Justification Logic ⋮ Logical omniscience as infeasibility ⋮ Tableaux and hypersequents for justification logics ⋮ Lower complexity bounds in justification logic ⋮ Towards NP-P via proof complexity and search ⋮ The Logic of Justification ⋮ The ontology of justifications in the logical setting ⋮ A complexity question in justification logic ⋮ THE LOGIC OF JUSTIFICATION ⋮ Tracking Evidence ⋮ Self-referential justifications in epistemic logic ⋮ The NP-Completeness of Reflected Fragments of Justification Logics ⋮ Symmetric Logic of Proofs

Cites Work

• Making knowledge explicit: how hard it is
• Explicit Provability and Constructive Semantics
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• Unnamed Item
• Unnamed Item