scientific article; zbMATH DE number 6829362
From MaRDI portal
Publication:4601873
Recommendations
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
- Undecidability of a weak version of MSO+U
- The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable
- Logic for Programming, Artificial Intelligence, and Reasoning
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
- The theory of the degrees is undecidable
- scientific article; zbMATH DE number 1984520
- scientific article; zbMATH DE number 5497805
- Undecidability of the theory of the lattice \(L^ 0_{sm}\)
- scientific article; zbMATH DE number 3966058
Cited in
(15)- Recursion schemes and the WMSO+U logic
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
- Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
- Contribution of Warsaw logicians to computational logic
- scientific article; zbMATH DE number 7168148 (Why is no real title available?)
- Delay games with WMSO+U winning conditions
- Recognisable languages over monads
- The theory of the degrees is undecidable
- scientific article; zbMATH DE number 39360 (Why is no real title available?)
- Satisfiability of \(\mathrm{ECTL}^*\) with local tree constraints
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic
- Weak MSO+U with path quantifiers over infinite trees
- Weak \(\text{MSO}+U\) over infinite trees
- On the decidability of MSO+U on infinite trees
- Connecting decidability and complexity for MSO logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4601873)
