Distributive Initial Segments of the Degrees of Unsolvability

Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1002/malq.19680143002

Other Versions

original Lachlan, A. H. (1968) "Distributive Initial Segments of the Degrees of Unsolvability". Mathematical Logic Quarterly 14(30):457-472

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,937

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

Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.
Marian Boykan Pour-El and Hilary Putnam. Recursively enumerable classes and their application to recursive sequences of formal theories. Archiv für mathematische Logik und Grundlagenforschung, vol. 8 no. 3–4 , pp. 104–121. - Marian Boykan Pour-El and William A. Howard. A structural criterion for recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 105–114. - A. H. Lachlan. On recursive enumeration without repetition. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 209–220. - A. H. Lachlan. On recursive enumeration without repetition: a correction. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 13 , pp. 99–100. [REVIEW]James C. Owings - 1973 - Journal of Symbolic Logic 38 (1):155-156.
Lachlan A. H.. The U-quantifier. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 7 , pp. 171–174. [REVIEW]J. R. Shoenfield - 1962 - Journal of Symbolic Logic 27 (2):244-244.
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.
Donald A. Martin. Classes of recursively enumerable sets and degrees of unsolvability. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 12, pp. 295–310. [REVIEW]K. Appel - 1968 - Journal of Symbolic Logic 32 (4):528.
Lachlan A. H.. Some notions of reducibility and productiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 17–44. [REVIEW]Carl G. Jockusch - 1970 - Journal of Symbolic Logic 35 (3):478-478.
A Single‐Axiom Impligational Calculus of Given Unsolvability.M. D. Gladstone - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (13‐17):193-204.

Analytics

Added to PP
2016-02-04

Downloads
38 (#593,075)

6 months
3 (#1,470,638)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Countable initial segments of the degrees of unsolvability.A. H. Lachlan & R. Lebeuf - 1976 - Journal of Symbolic Logic 41 (2):289-300.

View all 20 citations / Add more citations

References found in this work

No references found.

Add more references