Abstract
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group S ∞ of a countable set. In this paper we investigate a link between the symmetries associated with Ramsey Fraïssé order classes and algorithmic randomness.
Mathematics Subject Classification (2000): 03C20, 03C57, 03D80, 05D10, 06D07, 20B27, 68Q30.
The research is based upon work supported by the National Research Foundation (NRF) of South Africa. Any opinion, findings and conclusions or recommendations expressed in this material are those of the author and therefore the NRF does not accept any liability in regard thereto.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity, Theory and Applications of Computability. Springer (2010)
Ellis, R.: Universal minimal sets. Proc. Amer. Math. Soc. 11, 272–281 (1949)
Fouché, W.L.: Symmetry and the Ramsey degree of posets. Discrete Math. 167/168, 309–315 (1997)
Fouché, W.L., Potgieter, P.H.: Kolmogorov complexity and symmetrical relational structures. J. Symbolic Logic 63, 1083–1094 (1998)
Fouché, W.L.: Martin-Löf randomness, invariant measures and countable homogeneous structures. Theory of Computing Systems (to appear), arXiv:1205:0386v1
Glasner, E., Weiss, B.: Minimal actions of the group S(ℤ) of permutations of the integers. Geometric and Functional Analysis 5, 964–988 (2002)
Hodges, W.: A shorter model theory. Cambridge University Press (1993)
Hrushovski, E.: Extending partial isomorphisms of graphs. Combinatorica 12, 411–416 (1992)
Kechris, A.S.: The dynamics of automorphism groups of homogeneous structures. Lecture at LMS Northern Regional Meeting (July 2011)
Kechris, A.S., Pestov, V.G., Todorcevic, S.: Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups. Geometric And Functional Analysis 15, 106–189 (2005)
Kechris, A.S., Rosendal, C.: Turbulence, amalgamation and generic automorphisms of homogeneous structures. Proc. London Math. Soc. 94(3), 302–350 (2007)
Kechris, A.S., Sokič, M.: Dynamical properties of the automorphism groups of the random poset and random distributive lattice (2011), http://www.math.caltech.edu/people/kechris.html
Petrov, F., Vershik, A.: Uncountable graphs and invariant means on the set of universal countable graphs. Random Structures and Algorithms 126, 389–405 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fouché, W.L. (2012). Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures. In: Ong, L., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2012. Lecture Notes in Computer Science, vol 7456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32621-9_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-32621-9_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32620-2
Online ISBN: 978-3-642-32621-9
eBook Packages: Computer ScienceComputer Science (R0)