Lower complexity bounds in justification logic (Q408543): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.apal.2011.09.010 / rank
Normal rank
 
Property / cites work
 
Property / cites work: A Complexity Question in Justification Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Provability and Constructive Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justified common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LOGIC OF JUSTIFICATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Do We Need Justification Logic? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Omniscience Via Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introducing Justification into Epistemic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The deduction rule and linear and near-linear proof simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justifications for common knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Reflected Fragments of Justification Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of proofs, semantically / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justification logics and hybrid logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the reflected logic of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2004 Annual Meeting of the Association for Symbolic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-referential justifications in epistemic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4822945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.APAL.2011.09.010 / rank
 
Normal rank

Latest revision as of 16:42, 9 December 2024

scientific article
Language Label Description Also known as
English
Lower complexity bounds in justification logic
scientific article

    Statements

    Lower complexity bounds in justification logic (English)
    0 references
    0 references
    0 references
    10 April 2012
    0 references
    Exact lower complexity bounds are established for several justification logics.
    0 references
    justification logic
    0 references
    logic of proofs
    0 references
    computational complexity
    0 references
    \(\Pi^p_2\)-completeness
    0 references
    derivability problem
    0 references
    0 references

    Identifiers