Measure Quantifier in Monadic Second Order Logic
From MaRDI portal
Publication:5283434
DOI10.1007/978-3-319-27683-0_19zbMATH Open1476.03049OpenAlexW2295213764MaRDI QIDQ5283434FDOQ5283434
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
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 (6)
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)