Pages that link to "Item:Q1977576"
From MaRDI portal
The following pages link to Single step tableaux for modal logics. Computational properties, complexity and methodology (Q1977576):
Displaying 21 items.
- Tableaux and hypersequents for justification logics (Q408538) (← links)
- Prefixed tableaus and nested sequents (Q409323) (← links)
- Modal interpolation via nested sequents (Q487689) (← links)
- PSPACE complexity of modal logic KD45\(_{n}\) (Q946142) (← links)
- A new methodology for developing deduction methods (Q1037405) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- EXPtime tableaux for ALC (Q1589576) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- One-step modal logics, intuitionistic and classical. I (Q2240542) (← links)
- Proofs and countermodels in non-classical logics (Q2254557) (← links)
- Blocking and other enhancements for bottom-up model generation methods (Q2303239) (← links)
- Approximations of modal logics: \(\mathbf K\) and beyond (Q2478556) (← links)
- Deciding regular grammar logics with converse through first-order logic (Q2567343) (← links)
- On the relative complexity of labelled modal tableaux (Q2843911) (← links)
- Implementing a relational theorem prover for modal logic (Q3008387) (← links)
- 2005 Annual Conference of the Australasian Association for Logic (Q3412465) (← links)
- (Q3838815) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Decision Procedures for a Deontic Logic Modeling Temporal Inheritance of Obligations (Q4982115) (← links)
