Pages that link to "Item:Q2500485"
From MaRDI portal
The following pages link to On the complexity of the reflected logic of proofs (Q2500485):
Displaying 18 items.
- Logical omniscience as infeasibility (Q392271) (← links)
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- The ontology of justifications in the logical setting (Q454364) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Self-referential justifications in epistemic logic (Q987374) (← links)
- A complexity question in justification logic (Q2453576) (← links)
- Referential logic of proofs (Q2500486) (← links)
- The Logic of Justification (Q2971696) (← links)
- (Q3024916) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- THE LOGIC OF JUSTIFICATION (Q3580683) (← links)
- Tracking Evidence (Q3585997) (← links)
- The NP-Completeness of Reflected Fragments of Justification Logics (Q3605524) (← links)
- Computational reflection via mechanized logical deduction (Q4884066) (← links)
- Symmetric Logic of Proofs (Q5452174) (← links)
- Normalization of terms in sharp models of logic of proofs LP (Q6545378) (← links)