A Duality Theoretic View on Limits of Finite Structures

0525284 - ÚI 2021 RIV CH eng C - Konferenční příspěvek (zahraniční konf.)
Gehrke, M. - Jakl, T. - Reggio, Luca
A Duality Theoretic View on Limits of Finite Structures.
Foundations of Software Science and Computation Structures. Cham: Springer, 2020 - (Goubault-Larrecq, J.; König, B.), s. 299-318. Lecture Notes in Computer Science, 12077. ISBN 978-3-030-45230-8. ISSN 0302-9743.
[FOSSACS 2020: Foundations of Software Science and Computation Structures /23./ Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020. Dublin (IE), 25.04.2020-30.04.2020]
Grant CEP: GA ČR GA17-04630S
Institucionální podpora: RVO:67985807
Klíčová slova: Stone duality * finitely additive measures * structural limits * finite model theory * formal languages * logic on words
Obor OECD: Pure mathematics

A 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 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 operator”. 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.
Trvalý link: http://hdl.handle.net/11104/0309459