Studia Logica 99 (1-3):321-336 (2011)
This paper offers a brief analysis of the unification problem in modal transitive logics related to the logic S4 : S4 itself, K4, Grz and Gödel-Löb provability logic GL . As a result, new, but not the first, algorithms for the construction of ‘best’ unifiers in these logics are being proposed. The proposed algorithms are based on our earlier approach to solve in an algorithmic way the admissibility problem of inference rules for S4 and Grz . The first algorithms for the construction of ‘best’ unifiers in the above mentioned logics have been given by S. Ghilardi in [ 16 ]. Both the algorithms in [ 16 ] and ours are not much computationally efficient. They have, however, an obvious significant theoretical value a portion of which seems to be the fact that they stem from two different methodological approaches
|Keywords||Modal logics unification best unifiers admissible rules|
|Categories||categorize this paper)|
References found in this work BETA
Proof Theory for Admissible Rules.Rosalie Iemhoff & George Metcalfe - 2009 - Annals of Pure and Applied Logic 159 (1):171-186.
Unification in Modal and Description Logics.Franz Baader & Silvio Ghilardi - 2011 - Logic Journal of the IGPL 19 (6):705-730.
Unification in Intuitionistic Logic.Silvio Ghilardi - 1999 - Journal of Symbolic Logic 64 (2):859-880.
Best Solving Modal Equations.Silvio Ghilardi - 2000 - Annals of Pure and Applied Logic 102 (3):183-198.
Independent Bases of Admissible Rules.Emil Jerábek - 2008 - Logic Journal of the IGPL 16 (3):249-267.
Citations of this work BETA
No citations found.
Similar books and articles
Filtering Unification and Most General Unifiers in Modal Logic.Silvio Ghilardi & Lorenzo Sacchetti - 2004 - Journal of Symbolic Logic 69 (3):879-906.
Products of 'Transitive' Modal Logics.David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev - 2005 - Journal of Symbolic Logic 70 (3):993-1021.
An Overview of Tableau Algorithms for Description Logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Criteria for Admissibility of Inference Rules. Modal and Intermediate Logics with the Branching Property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
Logical Equations and Admissible Rules of Inference with Parameters in Modal Provability Logics.V. V. Rybakov - 1990 - Studia Logica 49 (2):215 - 239.
Kripke Semantics for Modal Substructural Logics.Norihiro Kamide - 2002 - Journal of Logic, Language and Information 11 (4):453-470.
Hereditarily Structurally Complete Modal Logics.V. V. Rybakov - 1995 - Journal of Symbolic Logic 60 (1):266-288.
Superintuitionistic Companions of Classical Modal Logics.Frank Wolter - 1997 - Studia Logica 58 (2):229-259.
An Algebraic Approach to Intuitionistic Modal Logics in Connection with Intermediate Predicate Logics.Nobu-Yuki Suzuki - 1989 - Studia Logica 48 (2):141 - 155.
Simulation and Transfer Results in Modal Logic – a Survey.Marcus Kracht & Frank Wolter - 1997 - Studia Logica 59 (2):149-177.
On the Completeness of First Degree Weakly Aggregative Modal Logics.Peter Apostoli - 1997 - Journal of Philosophical Logic 26 (2):169-180.
Added to index2011-09-22
Total downloads9 ( #466,484 of 2,178,178 )
Recent downloads (6 months)1 ( #316,504 of 2,178,178 )
How can I increase my downloads?