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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

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

Through your library

Similar books and articles

Proof of some theorems on recursively enumerable sets.Thoralf Skolem - 1962 - Notre Dame Journal of Formal Logic 3 (2):65-74.
Infima of recursively enumerable truth table degrees.Peter A. Fejer & Richard A. Shore - 1988 - Notre Dame Journal of Formal Logic 29 (3):420-437.
The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
Mass problems and almost everywhere domination.Stephen G. Simpson - 2007 - Mathematical Logic Quarterly 53 (4):483-492.
Recursive and recursively enumerable manifolds. II.Vladeta Vučković - 1977 - Notre Dame Journal of Formal Logic 18 (3):383-405.
Recursive and recursively enumerable manifolds. I.Vladeta Vučković - 1977 - Notre Dame Journal of Formal Logic 18 (2):265-291.

Analytics

Added to PP
2016-06-30

Downloads
20 (#744,405)

6 months
2 (#1,263,261)

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