Vis enkel innførsel

dc.contributor.authorGalimullin, Rustam
dc.date.accessioned2022-04-29T11:04:13Z
dc.date.available2022-04-29T11:04:13Z
dc.date.created2021-05-12T11:34:52Z
dc.date.issued2021
dc.identifier.issn0925-8531
dc.identifier.urihttps://hdl.handle.net/11250/2993396
dc.description.abstractThere are several ways to quantify over public announcements. The most notable are reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL correspondingly), with the latter being the least studied so far. In the present work, we consider coalition announcements through the lens of group announcements, and provide a complete axiomatisation of a logic with coalition announcements. To achieve this, we employ a generalisation of group announcements. Moreover, we study some logical properties of both coalition and group announcements that have not been studied before.en_US
dc.language.isoengen_US
dc.publisherSpringeren_US
dc.relation.urihttps://rgalimullin.gitlab.io/JOLLI21/paper.pdf
dc.subjectModallogikken_US
dc.subjectModal logicen_US
dc.titleCoalition and Relativised Group Announcement Logicen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionacceptedVersionen_US
dc.rights.holderCopyright The Author(s), under exclusive licence to Springer Nature B.V. part of Springer Nature 2021en_US
cristin.ispublishedtrue
cristin.fulltextpostprint
cristin.qualitycode1
dc.identifier.doi10.1007/s10849-020-09327-2
dc.identifier.cristin1909654
dc.source.journalJournal of Logic, Language and Informationen_US
dc.source.pagenumber451-489en_US
dc.subject.nsiVDP::Teoretisk databehandling, programmeringsspråk og -teori: 421en_US
dc.subject.nsiVDP::Theoretical computer science, programming science and theory: 421en_US
dc.identifier.citationJournal of Logic, Language and Information. 2021, 30 (3), 451-489.en_US
dc.source.volume30en_US
dc.source.issue3en_US


Tilhørende fil(er)

Thumbnail

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel