References
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congr. Logic, Method. and Philos. Sci. 1960, 1–11. Stanford University Press 1962
Büchi, J.R., Landweber, L.H.: Definability in the monadic second-order theory of successor. J. Symb. Logic34, 166–170 (1969)
Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theories of (generalized) successor. J. Symb. Logic31, 169–181 (1966)
Flum, J.: First order logic and its extensions. In: Logic Conference Kiel 1974, 248–310. Lecture Notes in Mathematics 499. Berlin, Heidelberg, New York: Springer 1975
Hanf, W.P.: Model-theoretic methods in the study of elementary logic. In: The theory of models, 132–145. Amsterdam: North-Holland 1965
Rogers, H., Jr.: Theory of recursive functions and effective computability. New York: McGraw-Hill 1967
Siefkes, D.: Decidable extensions of monadic second order successor arithmetic. In: Automatentheorie und formale Sprachen, 441–472. Mannheim: Bibliogr. Inst. 1969
Siefkes, D.: Undecidable extensions of monadic second order successor arithmetic. Z. f. Math. Logik und Grundlagen d. Math.17, 385–394 (1971)
Thomas, W.: Das Entscheidungsproblem für einige Erweiterungen der Nachfolger-Arithmetik. Dissertation. Universität Freiburg 1975
Thomas, W.: A note on undecidable extensions of monadic second order successor arithmetic. Arch. math. Logik17, 43–44 (1975)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Thomas, W. The theory of successor with an extra predicate. Math. Ann. 237, 121–132 (1978). https://doi.org/10.1007/BF01351676
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01351676