Derivability in certain subsystems of the logic of proofs is _2p-complete

DOI10.1016/J.APAL.2006.03.001zbMATH Open1112.03054OpenAlexW2138312950MaRDI QIDQ866565FDOQ866565

Authors: Robert Saxon Milnikel 

Publication date: 14 February 2007

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2006.03.001

Recommendations

• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• On the complexity of the reflected logic of proofs
• scientific article; zbMATH DE number 1670490
• Making knowledge explicit: how hard it is
• Logic of proofs and provability

zbMATH Keywords

complexitylogic of proofslogic of belief

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Cites Work

• Title not available (Why is that?)
• Explicit provability and constructive semantics
• Title not available (Why is that?)
• Title not available (Why is that?)
• The logic of proofs, semantically
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer Science Logic

Cited In (14)

• The logic of uncertain justifications
• Lower complexity bounds in justification logic
• The ontology of justifications in the logical setting
• A complexity question in justification logic
• The Logic of Justification
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• Tracking evidence
• The Logic of Uncertain Justifications
• Minimal models and the complexity of fragments of the logic of proofs
• Symmetric Logic of Proofs
• The logic of justification
• The NP-Completeness of Reflected Fragments of Justification Logics
• NEXP-Completeness and Universal Hardness Results for Justification Logic
• Title not available (Why is that?)

This page was built for publication: Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete

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