Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable
Logic
2014-02-17 v1
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.
Cite
@article{arxiv.1202.4092,
title = {Automorphism Groups of Countably Categorical Linear Orders are Extremely Amenable},
author = {François G. Dorais and Steven Gubkin and Daniel McDonald and Manuel Rivera},
journal= {arXiv preprint arXiv:1202.4092},
year = {2014}
}