The following pages link to (Q4364506):
Displaying 14 items.
- Cut elimination in coalgebraic logics (Q618171) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
- Correction to: ``A modal view on resource-bounded propositional logics'' (Q2106882) (← links)
- A subset-matching size-bounded cache for testing satisfiability in modal logics (Q2349812) (← links)
- (Q2721199) (← links)
- On the relative complexity of labelled modal tableaux (Q2843911) (← links)
- Admissibility of cut in coalgebraic logics (Q2873670) (← links)
- On the size of shortest modal descriptions (Q2904050) (← links)
- How to optimize proof-search in modal logics (Q3184509) (← links)
- A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4 (Q3406694) (← links)
- (Q3476787) (← links)
- (Q4941911) (← links)
- Sequent Calculi and Interpolation for Non-Normal Modal and Deontic Logics (Q5013620) (← links)
