Abstract
We prove (non)convergence laws for random expansions of product structures. More precisely, we ask which structures \({\mathfrak A}\) admit a limit law, saying that the probability that a randomly chosen expansion of \({\mathfrak A}^n\) satisfies a fixed first-order sentence always converges when n approaches infinity. For the groups \({\mathbb Z}_p\), where p is prime, we do indeed have such a limit law, even for the infinitary logic \(L^\omega _{\infty \omega }\), and these probabilities always converge to dyadic rational numbers, whose denominator only depends on the expansion vocabulary. This can be used to prove that the Abelian group summation problem is not definable in \(L^\omega _{\infty \omega }\). Further examples for structures with such a limit law are permutation structures and structures whose vocabulary only consists of monadic relations. As a negative example, we prove that the very simple structure \((\{0,1\}, \le )\) does not have a limit law. Furthermore, we develop a method based on positive primitive interpretations that allows transferring (non)convergence results to other structures. Using this method, we are able to prove that structures with binary function symbols or unary functions that are not interpreted by permutations do not have a limit law in general.
For Yuri Gurevich on the occasion of his 80th birthday
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
Please recall that m is still the number of atomic \((\tau \cup \sigma _{\mathfrak A})\)-types that are realisable in \((\sigma \cup \sigma _{\mathfrak A}\cup \tau )\)-expansions of \({\mathfrak A}'\). These types \(\delta _1,\dotsc ,\delta _m\) have been defined in Sect. 4.1.
References
Abu Zaid, F., Dawar, A., Grädel, E., Pakusa, W.: Definability of summation problems for Abelian groups and semigroups. In: Proceedings of 32th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (2017)
Blass, A., Gurevich, Y., Kozen, D.: A zero-one law for logic with a fixed point operator. Inf. Control 67, 70–90 (1985)
Compton, K.: 0–1 laws in logic and combinatorics. In: Rival, I. (ed.) NATO Advanced Study Institute on Algorithms and Order, pp. 353–383. Kluwer, Alphen aan den Rijn (1989)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. SMM. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-28788-4
Fagin, R.: Probabilities on finite models. J. Symb. Logic 41, 50–58 (1976)
Glebskii, Y., Kogan, D., Liogon’kii, M., Talanov, V.: Range and degree of realizability of formulas in the restricted predicate calculus. Kibernetika 2, 17–28 (1969)
Gurevich, Y.: Zero-one laws. Logic Comput. Sci. Column EATCS Bull. 46, 90–106 (1992)
Hodges, W.: Model Theory. Cambridge University Press, Cambridge (1993)
Kaufmann, M.: A counterexample to the 0-1 law for existential monadic second-order logic. In: Internal Note. Computational Logic Inc. (1988)
Kolaitis, P., Vardi, M.: Infinitary logics and 0-1 laws. Inf. Comput. 98, 258–294 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Dawar, A., Grädel, E., Hoelzel, M. (2020). Convergence and Nonconvergence Laws for Random Expansions of Product Structures. In: Blass, A., Cégielski, P., Dershowitz, N., Droste, M., Finkbeiner, B. (eds) Fields of Logic and Computation III. Lecture Notes in Computer Science(), vol 12180. Springer, Cham. https://doi.org/10.1007/978-3-030-48006-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-48006-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48005-9
Online ISBN: 978-3-030-48006-6
eBook Packages: Computer ScienceComputer Science (R0)