Published January 1, 2009
| Version v1
Journal article
Open
Unifiability in extensions of K4
Creators
- 1. Istanbul Kultur Univ, Dept Math & Comp Sci, TR-34156 Istanbul, Turkey
- 2. Univ Amsterdam, Inst Log Language & Computat, NL-1018 TV Amsterdam, Netherlands
Description
We extend and generalize the work on unifiability of [8]. We give a semantic characterization for unifiability and non-unifiability in the extensions of K4. We apply this in particular to extensions of KD4, GL and K4.3 to obtain a syntactic characterization and give a concrete decision procedure for unifiability for those logics. For that purpose we use universal models.
Files
bib-23fed59a-f8dd-4584-80ff-a0924e9966cb.txt
Files
(110 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:0a8655a60d72dc867189be1759ece734
|
110 Bytes | Preview Download |