2014/11/03 by Manfred Kufleitner, Jan Philipp Wächter, Kufleitner, Manfred +1
Computer Science · #F.4.1 #F.4.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #cs.FL #cs.LO
paper · pdf · doi:10.48550/arxiv.1411.0593
arxiv created 2014/11/03 · arxiv updated 2014/11/04
Fragments of first-order logic over words can often be characterized in terms of finite monoids, and identities of omega-terms are an effective mechanism for specifying classes of monoids. Huschenbett and the first author have shown how to use infinite Ehrenfeucht-Fraisse games on linear orders for showing that some given fragment satisfies an identity of omega-terms (STACS 2014). After revisiting this result, we show that for two-variable logic one can use simpler linear orders.