The Church problem for expansions of (N,<) by unary predicates
From MaRDI portal
Publication:690498
Recommendations
Cites work
- scientific article; zbMATH DE number 1086492 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- Automata, logics, and infinite games. A guide to current research
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Decidable Extensions of Church’s Problem
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- Finite automata and the logic of one-place predicates
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Pushdown processes: Games and model-checking
- Restricted Set-Theoretical Definitions in Arithmetic
- Solving Sequential Conditions by Finite-State Strategies
- The first order properties of products of algebraic systems
- The monadic theory of morphic infinite words and generalizations
- The monadic theory of order
- The recursive sets in certain monadic second order fragments of arithmetic
Cited in
(5)
This page was built for publication: The Church problem for expansions of \((\mathbb{N},<)\) by unary predicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690498)