2017/05/12 by Mwesigye, Feresiano, Truss, John K
#03C64 #06A05 #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.1705.04632
Two structures A and B are n-equivalent if player II has a winning strategy in the n-move Ehrenfeucht-Fraisse game on A and B. We extend earlier results about n-equivalence 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.