Abstract
Corresponding to our list in Chapter 13 of decidable theories we begin this section with a list of undecidable theories. As we have previously indicated, most undecidable theories satisfy one of the two stronger properties of inseparability or finite inseparability, and we shall indicate these properties in the table below.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Collins, G. E. and Halpern, J. D. On the interpretability of arithmetic in set theory. Notre Dame J. Formal Logic, 11 (1970), 477–483.
Ershov, Yu., Lavrov, I., Taimanov, A., Taitslin, M. Elementary theories. Russian Mathematical Surveys, 20 (1965), 35–105.
Rabin, M. A simple method for undecidability proofs and some applications. In Logic, Methodology, Philosophy of Science. Amsterdam: North-Holland (1965), 58–68.
Rabin, M. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141 (1969), 1–35.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Inc.
About this chapter
Cite this chapter
Monk, J.D. (1976). Some Undecidable Theories. In: Mathematical Logic. Graduate Texts in Mathematics, vol 37. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9452-5_17
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9452-5_17
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