Lachlan A. H.. Some notions of reducibility and productiveness. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 11 , pp. 17–44 [Book Review]

Journal of Symbolic Logic 35 (3):478-478 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

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

Some Notions of Reducibility and Productiveness.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (1):17-44.
The U‐Quantifier.A. H. Lachlan - 1961 - Mathematical Logic Quarterly 7 (11-14):171-174.
Multiple Recursion.A. H. Lachlan - 1962 - Mathematical Logic Quarterly 8 (2):81-107.
Spectra of ω‐Stable Theories.A. H. Lachlan - 1978 - Mathematical Logic Quarterly 24 (9-11):129-139.
On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11 (3):209-220.
A Note on Positive Equivalence Relations.A. H. Lachlan - 1987 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 33 (1):43-46.
On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7-12):99-100.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.
Standard Classes of Recursively Enumerable Sets.A. H. Lachlan - 1964 - Mathematical Logic Quarterly 10 (2-3):23-42.

Analytics

Added to PP
2016-06-30

Downloads
5 (#1,344,154)

6 months
2 (#668,348)

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