Baire category quantifier in monadic second order logic
DOI10.1007/978-3-662-47666-6_29zbMATH Open1443.03007OpenAlexW2397555467MaRDI QIDQ3449489FDOQ3449489
Authors: Henryk Michalewski, Matteo Mio 
Publication date: 4 November 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-47666-6_29
Recommendations
Probability and inductive logic (03B48) Logic with extra quantifiers and operators (03C80) Higher-order logic (03B16) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decidability of Second-Order Theories and Automata on Infinite Trees
- A logic for reasoning about time and reliability
- Bounded satisfiability for PCTL
- Probabilistic and Topological Semantics for Timed Automata
- Topology and descriptive set theory
- Invariant sets in topology and logic
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Randomization in automata on infinite trees
- How good is a strategy in a game with Nature?
- Defining fairness in reactive and concurrent systems
- Measure Properties of Game Tree Languages
- R-Sets and Category
- Cardinality Quantifiers in MLO over Trees
Cited In (4)
This page was built for publication: Baire category 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 Q3449489)
