On the complexity of the reflected logic of proofs

DOI10.1016/J.TCS.2006.03.015MaRDI QIDQ2500485zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4195902
• scientific article; zbMATH DE number 3313427
• The Complexity of Propositional Proofs
• The Complexity of Propositional Proofs
• scientific article; zbMATH DE number 1156870
• scientific article; zbMATH DE number 1860672
• scientific article; zbMATH DE number 2185723
• Reflection principles in computational logic
• Logical foundations of proof complexity
• Logical Foundations of Proof Complexity

Cites work

• scientific article; zbMATH DE number 1670490 (Why is no real title available?)
• scientific article; zbMATH DE number 1114348 (Why is no real title available?)
• Explicit provability and constructive semantics
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• Making knowledge explicit: how hard it is

Cited in

(19)

• Logical omniscience as infeasibility
• scientific article; zbMATH DE number 2185723 (Why is no real title available?)
• Lower complexity bounds in justification logic
• Towards NP-P via proof complexity and search
• Derivability in certain subsystems of the logic of proofs is _2p-complete
• Self-referential justifications in epistemic logic
• The ontology of justifications in the logical setting
• A complexity question in justification logic
• Referential logic of proofs
• The Logic of Justification
• Tracking evidence
• Minimal models and the complexity of fragments of the logic of proofs
• Symmetric Logic of Proofs
• NEXP-completeness and universal hardness results for justification logic
• Tableaux and hypersequents for justification logics
• The logic of justification
• Computational reflection via mechanized logical deduction
• The NP-Completeness of Reflected Fragments of Justification Logics
• Normalization of terms in sharp models of logic of proofs LP

This page was built for publication: On the complexity of the reflected logic of proofs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500485)