Show simple item record

dc.contributor.authorGehrke, M
dc.contributor.authorJakl, T
dc.contributor.authorReggio, L
dc.date.accessioned2022-02-15T00:30:11Z
dc.date.available2022-02-15T00:30:11Z
dc.date.issued2022-01-01
dc.identifier.issn1860-5974
dc.identifier.urihttps://www.repository.cam.ac.uk/handle/1810/334020
dc.description.abstractA systematic theory of structural limits for finite models has been developed by Nešetřil and Ossona de Mendez. It is based on the insight that the collection of finite structures can be embedded, via a map they call the Stone pairing, in a space of measures, where the desired limits can be computed. We show that a closely related but finer grained space of (finitely additive) measures arises—via Stone-Priestley duality and the notion of types from model theory—by enriching the expressive power of first-order logic with certain “probabilistic operators”. We provide a sound and complete calculus for this extended logic and expose the functorial nature of this construction. The consequences are two-fold. On the one hand, we identify the logical gist of the theory of structural limits. On the other hand, our construction shows that the duality theoretic variant of the Stone pairing captures the adding of a layer of quantifiers, thus making a strong link to recent work on semiring quantifiers in logic on words. In the process, we identify the model theoretic notion of types as the unifying concept behind this link. These results contribute to bridging the strands of logic in computer science which focus on semantics and on more algorithmic and complexity related areas, respectively.
dc.publisherCentre pour la Communication Scientifique Directe (CCSD)
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectStone duality
dc.subjectfinitely additive measures
dc.subjectstructural limits
dc.subjectfinite model theory
dc.subjectformal languages
dc.subjectlogic on words
dc.titleA DUALITY THEORETIC VIEW ON LIMITS OF FINITE STRUCTURES
dc.typeArticle
dc.publisher.departmentDepartment of Computer Science And Technology
dc.date.updated2022-02-11T15:24:22Z
prism.issueIdentifier1
prism.publicationDate2022
prism.publicationNameLogical Methods in Computer Science
prism.startingPage16:1-16:38
prism.volume18
dc.identifier.doi10.17863/CAM.81432
dcterms.dateAccepted2021-12-10
rioxxterms.versionofrecord10.46298/LMCS-18(1:16)2022
rioxxterms.versionVoR
dc.contributor.orcidJakl, Tomas [0000-0003-1930-4904]
dc.identifier.eissn1860-5974
dc.publisher.urlhttp://dx.doi.org/10.46298/lmcs-18(1:16)2022
rioxxterms.typeJournal Article/Review
pubs.funder-project-idEPSRC (EP/T007257/1)
cam.issuedOnline2022-01-19
cam.depositDate2022-02-11
pubs.licence-identifierapollo-deposit-licence-2-1
pubs.licence-display-nameApollo Repository Deposit Licence Agreement


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's licence is described as Attribution 4.0 International