KD is nullary
From MaRDI portal
Publication:4586229
Recommendations
Cites work
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- A tableau method for checking rule admissibility in S4
- Admissibility of logical inference rules
- Admissible rules in the implication-negation fragment of intuitionistic logic
- Bases of admissible rules of the logics S4 and Int
- Best solving modal equations
- Blending margins: the modal logic K has nullary unification type
- Complexity of admissible rules
- Construction of an explicit basis for rules admissible in modal system S4
- Filtering unification and most general unifiers in modal logic
- scientific article; zbMATH DE number 2015264 (Why is no real title available?)
- scientific article; zbMATH DE number 2015273 (Why is no real title available?)
- scientific article; zbMATH DE number 1471983 (Why is no real title available?)
- Logical consecutions in discrete linear temporal logic
- Multi-modal and Temporal Logics with Universal Formula--Reduction of Admissibility to Validity and Unification
- On the admissible rules of intuitionistic propositional logic
- One hundred and two problems in mathematical logic
- Remarks on projective unifiers
- SAT Encoding of Unification in $\mathcal{EL}$
- Undecidability of the unification and admissibility problems for modal and description logics
- Unifiability in extensions of K4
- Unification in a description logic with transitive closure of roles
- Unification in epistemic logics
- Unification in intuitionistic logic
- Unification in linear temporal logic LTL
- Unification in modal and description logics
- Unification in modal logic \(\mathrm{Alt}_1\)
- Unification in the Description Logic $\mathcal{EL}$
- Unification of concept terms in description logics
- Unification types in logic
Cited in
(6)- About the unification type of \(\mathbf{K}+\square \square \bot\)
- Finitary unification in locally tabular modal logics characterized
- Contact logic is finitary for unification with constants
- About the unification types of modal logics
- Computing most general unifiers in Euclidean modal logics
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
This page was built for publication: KD is nullary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4586229)