The Church problem for expansions of (N,<) by unary predicates
DOI10.1016/J.IC.2012.06.001zbMATH Open1285.03005OpenAlexW2033265717MaRDI QIDQ690498FDOQ690498
Authors: Alexander Rabinovich
Publication date: 27 November 2012
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2012.06.001
Recommendations
monadic logic of orderChurch's synthesis problemcomposition mehodgame-theoretical techniquesparametrized versions of Church's synthesis problem
Decidability of theories and sets of sentences (03B25) Second- and higher-order model theory (03C85)
Cites Work
- The monadic theory of morphic infinite words and generalizations
- Title not available (Why is that?)
- Automata, logics, and infinite games. A guide to current research
- LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pushdown processes: Games and model-checking
- The first order properties of products of algebraic systems
- The monadic theory of order
- Title not available (Why is that?)
- Solving Sequential Conditions by Finite-State Strategies
- The recursive sets in certain monadic second order fragments of arithmetic
- Restricted Set-Theoretical Definitions in Arithmetic
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- On decidability of monadic logic of order over the naturals extended by monadic predicates
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- Decidable Extensions of Church’s Problem
- Finite automata and the logic of one-place predicates
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)