Abstract
In previous chapters we have introduced several concepts related to the notion of undecidable theories (complete theories, 11.9; theories, 11.29; decidable and undecidable theories, 13.1; syntactical and weak syntactical definability, 14.1; recursive axiomatizability, 14.4; spectral representability, 14.22). Our purpose in this chapter is to establish various relationships known to exist between these notions and related ones. These general theorems will be applied in the next chapter, in which numerous examples of undecidable theories are given. We proceed in this chapter from the simpler concepts to the more complicated ones.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Dyson, V. H. On the decision problem for extensions of a decidable theory. Fund. Math., 64 (1969), 7–70.
Ershov, Yu., Lavrov, I., Taimanov, A., Taitslin, M. Elementary theories. Russian Mathematical Surveys, 20 (1965), 35–105.
Hanf, W. Model-theoretic methods in the study of elementary logic. In Model Theory. Amsterdam: North-Holland (1965).
Pour-El, M. Effectively extensible theories. J. Symb. Logic, 33 (1968), 56–58.
Tarski, A., Mostowski, A., Robinson, R. M. Undecidable Theories. Amsterdam: North-Holland (1953).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). General Theory of Undecidability. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_16
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_16
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-9454-9
Online ISBN: 978-1-4684-9452-5
eBook Packages: Springer Book Archive