Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/28314
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSano, Katsuhiko-
dc.contributor.authorVIRTEMA, Jonni-
dc.date.accessioned2019-05-28T13:19:16Z-
dc.date.available2019-05-28T13:19:16Z-
dc.date.issued2019-
dc.identifier.citationANNALS OF PURE AND APPLIED LOGIC, 170 (9), p. 110-1127-
dc.identifier.issn0168-0072-
dc.identifier.urihttp://hdl.handle.net/1942/28314-
dc.description.abstractWe study model and frame definability of various modal logics. Let denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models is definable in if and only if the class is elementary and closed under disjoint unions and surjective bisimulations. We also characterise the definability of in the spirit of the well-known Goldblatt–Thomason theorem. We show that an elementary class of Kripke frames is definable in if and only if is closed under taking generated subframes and bounded morphic images, and reflects ultrafilter extensions and finitely generated subframes. In addition we study frame definability relative to finite transitive frames and give an analogous characterisation of -definability relative to finite transitive frames. Finally, we initiate the study of model and frame definability in team-based logics. We study (extended) modal dependence logic, (extended) modal inclusion logic, and modal team logic. We establish strict linear hierarchies with respect to model definability and frame definability, respectively. We show that, with respect to model and frame definability, the before mentioned team-based logics, except modal dependence logic, either coincide with or plain modal logic . Thus as a corollary we obtain model theoretic characterisation of model and frame definability for the team-based logics. This article subsumes and extends the conference articles [30] and [31].-
dc.description.sponsorshipThe work of the first author was partially supported by JSPS KAKENHI Grant-in-Aid for Young Scientists (B) Grant Number 15K21025, JSPS KAKENHI Grant-in-Aid for Scientific Research (B) Grant Number 17H02255, JSPS KAKENHI Grant-in-Aid for Scientific Research (C) Grant Number 19K12113, and JSPS Core-to-Core Program (A. Advanced Research Networks). The work of the second author was supported by grant 292767 of the Academy of Finland, and by Jenny and Antti Wihuri Foundation.-
dc.language.isoen-
dc.publisherELSEVIER-
dc.rights© 2019 Elsevier B.V. All rights reserved.-
dc.subject.otherModel definability-
dc.subject.otherFrame definability-
dc.subject.otherTeam semantics-
dc.subject.otherUniversal modality-
dc.subject.otherModal logic-
dc.titleCharacterising Modal Definability of Team-Based Logics via the Universal Modality-
dc.typeJournal Contribution-
dc.identifier.epage1127-
dc.identifier.issue9-
dc.identifier.spage110-
dc.identifier.volume170-
local.bibliographicCitation.jcatA1-
dc.description.notesVirtema, J (reprint author), Hasselt Univ, Hasselt, Belgium. katsuhiko.sano@gmail.com; jonni.virtema@gmail.com-
local.publisher.placeRADARWEG 29,1043 NX AMSTERDAM, NETHERLANDS-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1016/j.apal.2019.04.009-
dc.identifier.isi000474317400008-
dc.identifier.eissn1873-2461-
local.uhasselt.internationalyes-
item.fulltextWith Fulltext-
item.contributorSano, Katsuhiko-
item.contributorVIRTEMA, Jonni-
item.fullcitationSano, Katsuhiko & VIRTEMA, Jonni (2019) Characterising Modal Definability of Team-Based Logics via the Universal Modality. In: ANNALS OF PURE AND APPLIED LOGIC, 170 (9), p. 110-1127.-
item.accessRightsRestricted Access-
crisitem.journal.issn0168-0072-
crisitem.journal.eissn1873-2461-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
Characterising modal definability of team-based logics via the universal modality.pdf
  Restricted Access
Published version582.75 kBAdobe PDFView/Open    Request a copy
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.