A complexity question in justification logic (Q2453576): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Kolmogorov and Gödel's approach to intuitionistic logic: current developments / 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: The NP-Completeness of Reflected Fragments of Justification Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4463930 / 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: Referential 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: 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

Revision as of 14:09, 8 July 2024

scientific article
Language Label Description Also known as
English
A complexity question in justification logic
scientific article

    Statements

    Identifiers