Almost recursively enumerable sets
HTML articles powered by AMS MathViewer
- by John W. Berry PDF
- Trans. Amer. Math. Soc. 164 (1972), 241-253 Request permission
Abstract:
An injective function on N, the nonnegative integers, taking values in N, is called almost recursive (abbreviated a.r.) if its inverse has a partial recursive extension. The range of an a.r. function f is called an almost recursively enumerable set in general; an almost recursive set if in addition f is strictly increasing. These are natural generalizations of regressive and retraceable sets respectively. We show that an infinite set is almost recursively enumerable iff it is point decomposable in the sense of McLaughlin. This leads us to new characterizations of certain classes of immune sets. Finally, in contrast to the regressive case, we show that a.r. functions and sets are rather badly behaved with respect to recursive equivalence.References
- K. I. Appel and T. G. McLaughlin, On properties of regressive sets, Trans. Amer. Math. Soc. 115 (1965), 83–93. MR 230616, DOI 10.1090/S0002-9947-1965-0230616-0
- J. C. E. Dekker, Infinite series of isols, Proc. Sympos. Pure Math., Vol. V, American Mathematical Society, Providence, R.I., 1962, pp. 77–96. MR 0142447
- J. C. E. Dekker and J. Myhill, Retraceable sets, Canadian J. Math. 10 (1958), 357–373. MR 99292, DOI 10.4153/CJM-1958-035-x
- J. C. E. Dekker and J. Myhill, Recursive equivalence types, Univ. California Publ. Math. 3 (1960), 67–213. MR 0117155
- T. G. McLaughlin, Strong reducibility on hypersimple sets, Notre Dame J. Formal Logic 6 (1965), 229–234. MR 193012, DOI 10.1305/ndjfl/1093958262
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
- V. D. Vučković, Almost recursive sets, Proc. Amer. Math. Soc. 23 (1969), 114–119. MR 260593, DOI 10.1090/S0002-9939-1969-0260593-7
- C. E. M. Yates, Recursively enumerable sets and retracing functions, Z. Math. Logik Grundlagen Math. 8 (1962), 331–345. MR 146072, DOI 10.1002/malq.19620080313
- Paul R. Young, Linear orderings under one-one reducibility, J. Symbolic Logic 31 (1966), 70–85. MR 231720, DOI 10.2307/2270621
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Trans. Amer. Math. Soc. 164 (1972), 241-253
- MSC: Primary 02F25
- DOI: https://doi.org/10.1090/S0002-9947-1972-0363839-4
- MathSciNet review: 0363839