MSO on the Infinite Binary Tree: Choice and Order

We give a new proof showing that it is not possible to define in monadic second-order logic (MSO) a choice function on the infinite binary tree. This result was first obtained by Gurevich and Shelah using set theoretical arguments. Our proof is much simpler and only uses basic tools from automata theory. We discuss some applications of the result concerning unambiguous tree automata and definability of winning strategies in infinite games. In a second part we strengthen the result of the non-existence of an MSO-definable well-founded order on the infinite binary tree by showing that every infinite binary tree with a well-founded order has an undecidable MSO-theory.

• Type: Conference
• Year: 2007
• Where: CSL
• Authors: Arnaud Carayol, Christof Löding
• Keywords: Automated Reasoning, CSL 2007, Infinite Binary Tree, Monadic Second-order Logic, Unambiguous Tree Automata