Measure quantifier in monadic second order logic
From MaRDI portal
Publication:5283434
DOI10.1007/978-3-319-27683-0_19zbMATH Open1476.03049OpenAlexW2295213764MaRDI QIDQ5283434FDOQ5283434
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
Recommendations
Logic with extra quantifiers and operators (03C80) Higher-order logic (03B16) Undecidability and degrees of sets of sentences (03D35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Probabilistic automata on finite words: decidable and undecidable problems
- Probabilistic ω-automata
- The algebra of topology
- Topology and descriptive set theory
- Completeness of \(\mathrm S4\) for the Lebesgue measure algebra
- Restricted Set-Theoretical Definitions in Arithmetic
- Randomization in automata on infinite trees
- Baire category quantifier in monadic second order logic
- Measure Properties of Game Tree Languages
- On the decidability of MSO+U on infinite trees
Cited In (10)
- Towards logical foundations for probabilistic computation
- Title not available (Why is that?)
- Capturing MSO with one quantifier
- Thin MSO with a probabilistic path quantifier
- Baire category quantifier in monadic second order logic
- Monadic Second Order Logic with Measure and Category Quantifiers
- Curry and Howard meet Borel
- Alternating nonzero automata
- 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)
