Measure quantifier in monadic second order logic

DOI10.1007/978-3-319-27683-0_19MaRDI QIDQ5283434zbMATH OpenOpenAlexFDO

Authors Henryk Michalewski, Matteo Mio

Publication date 21 July 2017

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-27683-0_19

zbMATH Keywords

Lebesgue measuremonadic second-order logic

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Higher-order logic (03B16) Undecidability and degrees of sets of sentences (03D35)

Recommendations

• Monadic Second Order Logic with Measure and Category Quantifiers
• Baire category quantifier in monadic second order logic
• Capturing MSO with one quantifier
• An Extension of Muchnik's Theorem
• Thin MSO with a probabilistic path quantifier

Cites work

• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Baire category quantifier in monadic second order logic
• Completeness of S4 for the Lebesgue measure algebra
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Measure Properties of Game Tree Languages
• On the decidability of MSO+U on infinite trees
• Probabilistic automata on finite words: decidable and undecidable problems
• Probabilistic ω-automata
• Randomization in automata on infinite trees
• Restricted Set-Theoretical Definitions in Arithmetic
• The algebra of topology
• Topology and descriptive set theory

Cited in

(11)

• Towards logical foundations for probabilistic computation
• Capturing MSO with one quantifier
• scientific article; zbMATH DE number 7168148 (Why is no real title available?)
• Thin MSO with a probabilistic path quantifier
• Enumerating error bounded polytime algorithms through arithmetical theories
• Baire category quantifier in monadic second order logic
• Monadic Second Order Logic with Measure and Category Quantifiers
• Alternating nonzero automata
• Curry and Howard meet Borel
• MSO+\( \nabla \) is undecidable
• Quantitative Monadic Second-Order Logic

This page was built for publication: Measure quantifier in monadic second order logic

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