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

page 1

page 2

page 3

page 4

research
01/21/2019

MSO+nabla is undecidable

This paper is about an extension of monadic second-order logic over infi...
research
02/10/2020

Alternating Tree Automata with Qualitative Semantics

We study alternating automata with qualitative semantics over infinite b...
research
04/24/2023

The Probabilistic Rabin Tree Theorem

The Rabin tree theorem yields an algorithm to solve the satisfiability p...
research
09/28/2011

The Planning Spectrum - One, Two, Three, Infinity

Linear Temporal Logic (LTL) is widely used for defining conditions on th...
research
03/14/2019

A Functional (Monadic) Second-Order Theory of Infinite Trees

This paper presents a complete axiomatization of Monadic Second-Order Lo...
research
04/23/2023

Quantifying over Trees in Monadic Second-Order Logic

Monadic Second-Order Logic (MSO) extends First-Order Logic (FO) with var...
research
04/25/2021

On Measure Quantifiers in First-Order Arithmetic (Long Version)

We study the logic obtained by endowing the language of first-order arit...

Please sign up or login with your details

Forgot password? Click here to reset