Complete index sets of recursively enumerable families
Compositio Mathematica (1972)
- Volume: 24, Issue: 1, page 83-91
- ISSN: 0010-437X
Access Full Article
top
How to cite
topMcLaughlin, T. G.. "Complete index sets of recursively enumerable families." Compositio Mathematica 24.1 (1972): 83-91. <http://eudml.org/doc/89114>.
@article{McLaughlin1972,
author = {McLaughlin, T. G.},
journal = {Compositio Mathematica},
language = {eng},
number = {1},
pages = {83-91},
publisher = {Wolters-Noordhoff Publishing},
title = {Complete index sets of recursively enumerable families},
url = {http://eudml.org/doc/89114},
volume = {24},
year = {1972},
}
TY - JOUR
AU - McLaughlin, T. G.
TI - Complete index sets of recursively enumerable families
JO - Compositio Mathematica
PY - 1972
PB - Wolters-Noordhoff Publishing
VL - 24
IS - 1
SP - 83
EP - 91
LA - eng
UR - http://eudml.org/doc/89114
ER -
References
top- J.C.E. Dekker AND J. Myhill [1] Some theorems on classes of recursively enumerable sets, Trans. Amer. Math. Soc.89(1) (1958) 25-59. Zbl0083.00302MR97310
- T.G. Mclaughlin [2] The family of all recursively enumerable classes of finite sets, Trans. Amer. Math. Soc., 155 (1) (1971) 127-136. Zbl0221.02022MR276084
- H.G. Rice [3 ] Classes of recursively enumerable sets and their decision problems, Trans. Amer. Math. Soc.74(2) (1953) 358-366. Zbl0053.00301MR53041
- Hartley Rogers [4] Computing degrees of unsolvability, Math. Annalen, 138(2) (1959) 125-140. Zbl0086.01101MR114752
- Hartley Rogers [5] Theory of recursive functions and effective computability, McGraw-Hill Book Co., 1967. Zbl0183.01401MR224462
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.