Computing most general unifiers in Euclidean modal logics

DOI10.1093/LOGCOM/EXAE084MaRDI QIDQ6909832zbMATH OpenFDO

Authors

Publication date 29 October 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAE084

zbMATH Keywords

duality theoryEuclidean relationsunification

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• KD is nullary
• A Resolution/Tableaux Algorithm for Projective Approximations in IPC
• About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
• Best solving modal equations
• Blending margins: the modal logic K has nullary unification type
• Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic
• Filtering unification and most general unifiers in modal logic
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 966894 (Why is no real title available?)
• scientific article; zbMATH DE number 7668094 (Why is no real title available?)
• Modal logic
• Projective unification in transitive modal logics
• Remarks about the unification type of several non-symmetric non-transitive modal logics
• The extensions of the modal logic K5
• Unification in intuitionistic logic
• Unification in modal and description logics
• Unification through projectivity
• Unification types in Euclidean modal logics
• Unification, finite duality and projectivity in varieties of Heyting algebras

This page was built for publication: Computing most general unifiers in Euclidean modal logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909832)