NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1565822158 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.00362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complexity question in justification logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Two-Agent Justification Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEXP-Completeness and Universal Hardness Results for Justification Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit Provability and Constructive Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Justification Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE LOGIC OF JUSTIFICATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower complexity bounds in justification logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The logic of proofs, semantically / 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: Self-referentiality of Justified Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for classes of quantificational formulas / 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: Q4833777 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interacting explicit evidence systems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:13, 10 July 2024

scientific article
Language Label Description Also known as
English
NEXP-Completeness and Universal Hardness Results for Justification Logic
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references