An $\aleph _{0}$-categorical theory whose language is countably infinite
HTML articles powered by AMS MathViewer
- by Rohit Parikh PDF
- Proc. Amer. Math. Soc. 49 (1975), 216-218 Request permission
Abstract:
In the following, we describe an ${\aleph _0}$-categorical, complete, decidable theory $T$ whose language is countably infinite.References
- Joseph R. Shoenfield, Mathematical logic, Addison-Wesley Publishing Co., Reading, Mass.-London-Don Mills, Ont., 1967. MR 0225631
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 49 (1975), 216-218
- MSC: Primary 02G20
- DOI: https://doi.org/10.1090/S0002-9939-1975-0381979-9
- MathSciNet review: 0381979