Composition Over the Natural Number Ordering with an Extra Binary Relation
From MaRDI portal
Publication:2947182
DOI10.1007/978-3-319-23534-9_19zbMath1465.03073OpenAlexW2295306230MaRDI QIDQ2947182
Publication date: 22 September 2015
Published in: Fields of Logic and Computation II (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-23534-9_19
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Interpolation, preservation, definability (03C40) Models of other mathematical theories (03C65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical recursion theory. The theory of functions and sets of natural numbers
- The monadic theory of order
- Rabin's uniformization problem
- The decision problem for branching time logic
- Restricted Set-Theoretical Definitions in Arithmetic
- Modest theory of short chains. I
- Modest theory of short chains. II
- A combinatorial approach to the theory of ω-automata
- A note on undecidable extensions of monadic second order successor arithmetic
- Decidability of Second-Order Theories and Automata on Infinite Trees