Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
From MaRDI portal
Publication:3613363
DOI10.1007/11874683_37zbMath1225.03013OpenAlexW1545660605MaRDI QIDQ3613363
Wolfgang Thomas, Alexander Rabinovich
Publication date: 12 March 2009
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11874683_37
Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)
Related Items (10)
On Boolean closed full trios and rational Kripke frames ⋮ On decidability of monadic logic of order over the naturals extended by monadic predicates ⋮ A Hierarchy of Automaticω-Words having a Decidable MSO Theory ⋮ Model Transformations in Decidability Proofs for Monadic Theories ⋮ The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates ⋮ On Monadic Theories of Monadic Predicates ⋮ Unnamed Item ⋮ Decidable Expansions of Labelled Linear Orderings ⋮ Unnamed Item ⋮ Decidable Extensions of Church’s Problem
This page was built for publication: Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
