The following pages link to (Q2753686):
Displaying 37 items.
- The logic of uncertain justifications (Q392291) (← links)
- Conservativity for logics of justified belief: two approaches (Q408535) (← links)
- Lower complexity bounds in justification logic (Q408543) (← links)
- The logic of proofs, semantically (Q703832) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Derivability in certain subsystems of the logic of proofs is \(\Pi_2^p\)-complete (Q866565) (← links)
- Interacting explicit evidence systems (Q929292) (← links)
- Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals (Q1740653) (← links)
- The complexity of satisfiability in non-iterated and iterated probabilistic logics (Q1783740) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- On the complexity of graded modal logics with converse (Q2296751) (← links)
- Non-circular proofs and proof realization in modal logic (Q2349104) (← links)
- A complexity question in justification logic (Q2453576) (← links)
- On the complexity of the reflected logic of proofs (Q2500485) (← links)
- Referential logic of proofs (Q2500486) (← links)
- On the relative complexity of labelled modal tableaux (Q2843911) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- On the size of shortest modal descriptions (Q2904050) (← links)
- The Logic of Justification (Q2971696) (← links)
- Exemplaric Expressivity of Modal Logics (Q3056297) (← links)
- NEXP-Completeness and Universal Hardness Results for Justification Logic (Q3194706) (← links)
- Justification Logic (Q3532452) (← links)
- Inf-datalog, Modal Logic and Complexities (Q3549285) (← links)
- Tracking Evidence (Q3585997) (← links)
- Complexity Results for Modal Dependence Logic (Q3586056) (← links)
- The NP-Completeness of Reflected Fragments of Justification Logics (Q3605524) (← links)
- Conservativity for Logics of Justified Belief (Q3605540) (← links)
- (Q4364506) (← links)
- NP trees and Carnap's modal logic (Q4369870) (← links)
- The Succinctness of First-order Logic over Modal Logic via a Formula Size Game (Q4636046) (← links)
- (Q4866986) (← links)
- Justification Logics with Probability Operators (Q5024719) (← links)
- Probabilistic Justification Logic (Q5283426) (← links)
- Computer Science Logic (Q5292653) (← links)
- Symmetric Logic of Proofs (Q5452174) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- Tableaux and interpolation for propositional justification logics (Q6564678) (← links)
