Pages that link to "Item:Q3194706"
From MaRDI portal
The following pages link to NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706):
Displaying 5 items.
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- A completeness result for implicit justification stit logic (Q5197392) (← links)
- Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
- Decidability for some justification logics with negative introspection (Q5300069) (← links)