Pages that link to "Item:Q866565"

The following pages link to Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565):

Displaying 12 items.

• The logic of uncertain justifications (Q392291) (← links)
• Lower complexity bounds in justification logic (Q408543) (← links)
• The ontology of justifications in the logical setting (Q454364) (← links)
• A complexity question in justification logic (Q2453576) (← links)
• The Logic of Justification (Q2971696) (← links)
• NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
• The Logic of Uncertain Justifications (Q3455853) (← links)
• THE LOGIC OF JUSTIFICATION (Q3580683) (← links)
• Tracking Evidence (Q3585997) (← links)
• The NP-Completeness of Reflected Fragments of Justification Logics (Q3605524) (← links)
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments (Q4829857) (← links)
• Symmetric Logic of Proofs (Q5452174) (← links)