Number of the records: 1  

Blending margins: The modal logic K has nullary unification type

  1. 1.
    SYSNO ASEP0453140
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleBlending margins: The modal logic K has nullary unification type
    Author(s) Jeřábek, Emil (MU-W) RID, SAI, ORCID
    Source TitleJournal of Logic and Computation - ISSN 0955-792X
    Roč. 25, č. 5 (2015), s. 1231-1240
    Number of pages10 s.
    Languageeng - English
    CountryGB - United Kingdom
    Keywordsmodal logic ; unification type ; rule of margins
    Subject RIVBA - General Mathematics
    R&D ProjectsIAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
    1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
    Institutional supportMU-W - RVO:67985840
    UT WOS000363212100004
    DOI10.1093/logcom/ext055
    AnnotationWe investigate properties of the formula p->[]p in the basic modal logic K. We show that K satisfies an infinitary weaker variant of the rule of margins A->[]A / A,~A, and as a consequence, we obtain various negative results about admissibility and unification in K. We describe a complete set of unifiers (i.e., substitutions making the formula provable) of p->[]p, and use it to establish that K has the worst possible unification type: nullary. In well-behaved transitive modal logics, admissibility and unification can be analyzed in terms of projective formulas, introduced by Ghilardi; in particular, projective formulas coincide for these logics with formulas that are admissibly saturated (i.e., derive all their multiple-conclusion admissible consequences) or exact (i.e., axiomatize a theory of a substitution). In contrast, we show that in K, the formula p->[]p is admissibly saturated, but neither projective nor exact. All our results for K also apply to the basic description logic ALC.
    WorkplaceMathematical Institute
    ContactJarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
    Year of Publishing2016
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.