Publisher
Springer Science and Business Media LLC
Reference8 articles.
1. Carstens, H. G.: Über die Kompliziertheit numerischer Modelle. Dissertation, Münster, 1972.
2. Carstens, H. G.: Reducing hyperarithmetic sequences. Fundamenta Mathematicae LXXXIX, 5–11. (1975).
3. Jockusch, C. G.:Π 1 0 classes and boolean combinations of recursively enumerable sets. JSL39, 95–96 (1974).
4. Müller, G. H.: Nicht-Standardmodelle der Zahlentheorie. Math. Zeitschrift77, 414–438 (1961).
5. Rogers, H.: Theory of recursive functions and effective computability. New York, 1967.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献