Abstract
Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeucht-Fraïssé game on A and B. We extend earlier results about n-equivalence classes for finite coloured linear orders, describing an algorithm for reducing to canonical form under 2-equivalence, and concentrating on the cases of 2 and 3 moves.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Mwesigye, F., Truss, J.K.: Classification of finite coloured linear orderings. Order 28, 387–397 (2011)
Mwesigye, F., Truss, J.K.: Ehrenfeucht-Fraïssé games on ordinals, to appear in the Annals of Pure and Applied Logic
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by a London Mathematical Society scheme 5 grant
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Mwesigye, F., Truss, J.K. On Optimal Representatives of Finite Coloured Linear Orders. Order 36, 107–117 (2019). https://doi.org/10.1007/s11083-018-9458-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-018-9458-3