Monadic Second Order Logic with Path-Measure Quantifier is Undecidable

01/14/2019
by   Raphaël Berthon, et al.
0

We prove that the theory of monadic second order logic (MSO) of the infinite binary tree extended with qualitative path-measure quantifier is undecidable. This quantifier says that the set of infinite paths in the tree that satisfies some formula has Lebesgue-measure one. To do this we prove that the emptiness problem of qualitative universal parity tree automata is undecidable. Qualitative means that a run of a tree automaton is accepting if the set of paths in the run that satisfy the acceptance condition has Lebesgue-measure one.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset