ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
暂无分享,去创建一个
In this paper the problems of expressibility and decidability are studied for elementary theories obtained by extending the arithmetic of order and the arithmetic of addition of natural numbers. Results are obtained on the decidability and undecidability of elementary theories of concrete structures of the form , where is a fixed monadic predicate, as well as results on the class of sets definable in the theory . Bibliography: 6 titles.
[1] Calvin C. Elgot,et al. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor , 1966, Journal of Symbolic Logic.
[2] K. Jacobs. Turing-Maschinen und zufällige 0–1-Folgen , 1970 .
[3] J. Büchi. Weak Second‐Order Arithmetic and Finite Automata , 1960 .
[4] R. Tijdeman,et al. On integers with many small prime factors , 1973 .
[5] Derek C. Oppen,et al. Elementary bounds for presburger arithmetic , 1973, STOC.