scientific article; zbMATH DE number 6829362

DOI10.4230/LIPICS.STACS.2016.21zbMATH Open1388.03016arXiv1502.04578MaRDI QIDQ4601873FDOQ4601873

Authors: Mikołaj Bojańczyk, Paweł Parys, Szymon Toruńczyk 

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1502.04578

Title of this publication is not available (Why is that?)

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 \(\alpha \) 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

zbMATH Keywords

boundsautomatalogicundecidabilityunbounding quantifier

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Cited In (15)

• Recursion schemes and the WMSO+U logic
• Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
• Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts
• Contribution of Warsaw logicians to computational logic
• Title not available (Why is that?)
• Delay games with WMSO+U winning conditions
• Recognisable languages over monads
• The theory of the \(\alpha \) degrees is undecidable
• Title not available (Why is that?)
• 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)