About the Unification Type of Modal Logics Between

Studia Logica 108 (5):941-966 (2020)
  Copy   BIBTEX

Abstract

The unification problem in a normal modal logic is to determine, given a formula

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,885

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2019-11-12

Downloads
38 (#648,444)

6 months
5 (#832,399)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Best solving modal equations.Silvio Ghilardi - 2000 - Annals of Pure and Applied Logic 102 (3):183-198.
Unification in modal and description logics.Franz Baader & Silvio Ghilardi - 2011 - Logic Journal of the IGPL 19 (6):705-730.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Unification in epistemic logics.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):91-105.
KD is nullary.Philippe Balbiani & Çiğdem Gencer - 2017 - Journal of Applied Non-Classical Logics 27 (3-4):196-205.

View all 8 references / Add more references