Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable
classification
🧮 math.LO
keywords
amenableautomorphismcategoricalcountablyextremelygroupslinearorders
read the original abstract
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite ordered structures with finitely many partial equivalence relations with convex classes.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.