The Priority Method I

Mathematical Logic Quarterly 13 (1‐2):1-10 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19670130102

Other Versions

reprint Lachlans, A. H. (1967) "The Priority Method I". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13(1-2):1-10

Links

PhilArchive



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

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

Topological Framework for Non‐Priority.Kyriakos Kontostathis - 1991 - Mathematical Logic Quarterly 37 (31-32):495-500.
Topological Framework for Non‐Priority.Kyriakos Kontostathis - 1991 - Mathematical Logic Quarterly 37 (31‐32):495-500.
The priority method for the construction of recursively enumerable sets.Alistair H. Lachlan - 1973 - In A. R. D. Mathias & Hartley Rogers (eds.), Cambridge Summer School in Mathematical Logic. New York,: Springer Verlag. pp. 299--310.
A Generalization of a Theorem of H. Friedman.C. Dimitracopoulos - 1985 - Mathematical Logic Quarterly 31 (14-18):221-225.
A Generalization of a Theorem of H. Friedman.C. Dimitracopoulos - 1985 - Mathematical Logic Quarterly 31 (14‐18):221-225.
Concerning a problem of H. Scholz.Andrzej Mostowski - 1956 - Mathematical Logic Quarterly 2 (10‐15):210-214.
Fixed points and diagonal method.Maurizio Negri - 1990 - Mathematical Logic Quarterly 36 (4):319-329.

Analytics

Added to PP
2013-11-24

Downloads
13 (#1,311,767)

6 months
5 (#1,011,143)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
Completely mitotic R.E. degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.

View all 12 citations / Add more citations

References found in this work

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Add more references