The following pages link to Complexity of admissible rules (Q868660):
Displaying 12 items.
- On rules (Q266650) (← links)
- A syntactic approach to unification in transitive reflexive modal logics (Q286704) (← links)
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) (Q385070) (← links)
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition (Q606997) (← links)
- Admissible rules in the implication-negation fragment of intuitionistic logic (Q638480) (← links)
- Unification in linear temporal logic LTL (Q716499) (← links)
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \) (Q831218) (← links)
- Proof theory for admissible rules (Q1023055) (← links)
- Rules with parameters in modal logic. II. (Q2004954) (← links)
- Inference rules in Nelson's logics, admissibility and weak admissibility (Q2342802) (← links)
- Rules with parameters in modal logic. I. (Q2346953) (← links)
- A Tableau Method for Checking Rule Admissibility in S4 (Q3185759) (← links)
