Definability in the monadic second-order theory of successor
暂无分享,去创建一个
[1] S. C. Kleene,et al. Introduction to Metamathematics , 1952 .
[2] S. Kleene. Hierarchies of number-theoretic predicates , 1955 .
[3] R. Robinson. Restricted set-theoretical definitions in arithmetic , 1958 .
[4] Morton Davis,et al. 7. Infinite Games of Perfect Information , 1964 .
[5] Calvin C. Elgot,et al. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.
[6] Robert McNaughton,et al. Testing and Generating Infinite Sequences by a Finite Automaton , 1966, Inf. Control..
[7] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .