Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- 1 June 1966
- journal article
- Published by Cambridge University Press (CUP) in The Journal of Symbolic Logic
- Vol. 31 (2), 169-181
- https://doi.org/10.2307/2269808
Abstract
Decidability and undecidability of extensions of second (first) order theory of (generalized) successor1 - Volume 31 Issue 2 - Calvin C. Elgot, Michael O. RabinKeywords
This publication has 5 references indexed in Scilit:
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Finite Automata and Their Decision ProblemsIBM Journal of Research and Development, 1959
- Restricted set-theoretical definitions in arithmeticProceedings of the American Mathematical Society, 1958
- General recursive functionsProceedings of the American Mathematical Society, 1950