Ihrig Ann H.. The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability. Notre Dame journal of formal logic, vol. 6 no. 1 , pp. 54–72 [Book Review]

Journal of Symbolic Logic 32 (4):529-529 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270207

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: Ann H. Ihrig, The Post-Lineal Theorems for Arbitrary Recursively Enumerable Degrees of Unsolvability. [REVIEW]Gerald E. Sacks - 1967 - Journal of Symbolic Logic 32 (4):529-529.
The Post-Lineal theorems for arbitrary recursively enumerable degrees of unsolvability.Ann H. Ihrig - 1965 - Notre Dame Journal of Formal Logic 6 (1):54-72.
The Post-Lineal Theorems for Arbitrary Recursively Enumerable Degrees of Unsolvability.Ann H. Ihrig - 1967 - Journal of Symbolic Logic 32 (4):529-529.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):294-295.
Cooper S. B.. Degrees of unsolvability complementary between recursively enumerable degrees, Part I. Annals of mathematical logic, vol. 4 no. 1 , pp. 31–73. [REVIEW]Dick Epstein - 1975 - Journal of Symbolic Logic 40 (1):86-86.
Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.
Gerald E. Sacks. On suborderings of degrees of recursive unsolvability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 46–56. [REVIEW]Gustav B. Hensel - 1964 - Journal of Symbolic Logic 29 (4):203.
Review: Gerald E. Sacks, Degrees of Unsolvability. [REVIEW]Gustav B. Hensel - 1964 - Journal of Symbolic Logic 29 (4):202-203.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.

Analytics

Added to PP
2016-06-30

Downloads
21 (#729,395)

6 months
2 (#1,448,741)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references