Monadic Second Order Logic with Measure and Category Quantifiers

DOI10.23638/LMCS-14(2:2)2018MaRDI QIDQ4637695zbMATH OpenFDO

Authors Matteo Mio, Michał Skrzypczak, Henryk Michalewski

Publication date 25 April 2018

Full work available at URL https://arxiv.org/abs/1702.04769

Mathematics Subject Classification ID

Higher-order logic (03B16) Logic with extra quantifiers and operators (03C80) Second- and higher-order model theory (03C85) Automata and formal grammars in connection with logical questions (03D05) Descriptive set theory (03E15)

Abstract: We investigate the extension of Monadic Second Order logic, interpreted over infinite words and trees, with generalized "for almost all" quantifiers interpreted using the notions of Baire category and Lebesgue measure.

Recommendations

• Measure quantifier in monadic second order logic
• Baire category quantifier in monadic second order logic
• Quantitative Monadic Second-Order Logic
• scientific article; zbMATH DE number 2038747
• First order quantifiers in monadic second order logic
• Monadic Second Order Logic And Its Fragments
• Asymptotic Monadic Second-Order Logic
• scientific article; zbMATH DE number 2079025

Cites work

• Baire category quantifier in monadic second order logic
• Banach-Mazur games on graphs
• Cardinality Quantifiers in MLO over Trees
• Computer Science Logic
• Counting branches in trees using games
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Defining fairness in reactive and concurrent systems
• Emptiness of zero automata is decidable
• How good is a strategy in a game with Nature?
• How unprovable is Rabin's decidability theorem?
• scientific article; zbMATH DE number 1223638 (Why is no real title available?)
• Measure properties of regular sets of trees
• Measure quantifier in monadic second order logic
• On a generalization of quantifiers
• On the problem of computing the probability of regular sets of trees
• Probabilistic ω-automata
• Quantitative stochastic parity games
• Randomization in automata on infinite trees
• The topological complexity of MSO+U and related automata models
• Topology and descriptive set theory

Cited in

(14)

• On measure quantifiers in first-order arithmetic
• Model theory of monadic predicate logic with the infinity quantifier
• On second-order monadic monoidal and groupoidal quantifiers
• Expressing cardinality quantifiers in monadic second-order logic over chains
• Expressing cardinality quantifiers in monadic second-order logic over trees
• Baire category quantifier in monadic second order logic
• On Second-Order Monadic Groupoidal Quantifiers
• Quantitative Monadic Second-Order Logic
• Magnitude monadic logic over words and the use of relative internal set theory
• Measure quantifier in monadic second order logic
• Polishness of some topologies related to word or tree automata
• Two Effective Properties of ω-Rational Functions
• Towards logical foundations for probabilistic computation
• Curry and Howard meet Borel

This page was built for publication: Monadic Second Order Logic with Measure and Category Quantifiers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637695)