Recursive equivalence types and combinatorial functions
HTML articles powered by AMS MathViewer
References
-
1. J. C. E. Dekker, A nonconstructive extension of the number system, J. Symbolic Logic vol. 20 (1955) pp. 204-205.
2. J. C. E. Dekker, On certain equations in isols, J. Symbolic Logic vol. 22 (1957) pp. 105-106 and Bull. Amer. Math. Soc. vol. 63 (1957) p. 313.
- J. C. E. Dekker and J. Myhill, Recursive equivalence types, Univ. California Publ. Math. 3 (1960), 67–213. MR 0117155 4. A. Nerode, Some remarks on isolic arithmetic, Notices Amer. Math. Soc. vol. 6 (1958) p. 216.
- H. G. Rice, On completely recursively enumerable classes and their key arrays, J. Symbolic Logic 21 (1956), 304–308. MR 81243, DOI 10.2307/2269105
Additional Information
- Journal: Bull. Amer. Math. Soc. 64 (1958), 373-376
- DOI: https://doi.org/10.1090/S0002-9904-1958-10241-4
- MathSciNet review: 0101194