Best solving modal equations

Annals of Pure and Applied Logic 102 (3):183-198 (2000)
  Copy   BIBTEX

Abstract

We show that some common varieties of modal K4-algebras have finitary unification type, thus providing effective best solutions for equations in free algebras. Applications to admissible inference rules are immediate

Categories

Keywords

Reprint years

DOI

10.1016/s0168-0072(99)00032-9

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: 106,126

External links

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

Through your library

My notes

Similar books and articles

Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Unifiability and Structural Completeness in Relation Algebras and in Products of Modal Logic S5.Wojciech Dzik & Beniamin Wróbel - 2015 - Bulletin of the Section of Logic 44 (1/2):1-14.
On unification and admissible rules in Gabbay–de Jongh logics.Jeroen P. Goudsmit & Rosalie Iemhoff - 2014 - Annals of Pure and Applied Logic 165 (2):652-672.
Admissible Bases Via Stable Canonical Rules.Nick Bezhanishvili, David Gabelaia, Silvio Ghilardi & Mamuka Jibladze - 2016 - Studia Logica 104 (2):317-341.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
Varieties of positive modal algebras and structural completeness.Tommaso Moraschini - 2019 - Review of Symbolic Logic 12 (3):557-588.
Pretabular varieties of modal algebras.W. J. Blok - 1980 - Studia Logica 39 (2-3):101 - 124.
A Resolution/tableaux Algorithm For Projective Approximations In Ipc.Silvio Ghilardi - 2002 - Logic Journal of the IGPL 10 (3):229-243.
Model completions and r-Heyting categories.Silvio Ghilardi & Marek Zawadowski - 1997 - Annals of Pure and Applied Logic 88 (1):27-46.
The data type variety of stack algebras.J. A. Bergstra & J. V. Tucker - 1995 - Annals of Pure and Applied Logic 73 (1):11-36.

Analytics

Added to PP
2014-01-16

Downloads
17 (#1,252,266)

6 months
1 (#1,598,278)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof theory for admissible rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1-2):171-186.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.
Almost structural completeness; an algebraic approach.Wojciech Dzik & Michał M. Stronkowski - 2016 - Annals of Pure and Applied Logic 167 (7):525-556.

View all 49 citations / Add more citations

References found in this work

Unification in intuitionistic logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Logics containing k4. part I.Kit Fine - 1974 - Journal of Symbolic Logic 39 (1):31-42.
Logics containing k4. part II.Kit Fine - 1985 - Journal of Symbolic Logic 50 (3):619-651.

Add more references