Priority constructions

Annals of Pure and Applied Logic 81 (1-3):115-123 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,247

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

Constructions by transfinitely many workers.Julia F. Knight - 1990 - Annals of Pure and Applied Logic 48 (3):237-259.
A microscopic approach to Souslin-tree constructions, Part I.Ari Meir Brodsky & Assaf Rinot - 2017 - Annals of Pure and Applied Logic 168 (11):1949-2007.
On the ideal J[κ].Assaf Rinot - 2022 - Annals of Pure and Applied Logic 173 (2):103055.
Laforte, G., see Downey, R.T. Arai, Z. Chatzidakis & A. Pillay - 1998 - Annals of Pure and Applied Logic 95 (1-3):287.

Analytics

Added to PP
2014-01-16

Downloads
28 (#798,682)

6 months
9 (#482,469)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

In Memoriam: Joseph R. Shoenfield 1927–2000.Carl G. Jockusch - 2001 - Bulletin of Symbolic Logic 7 (3):393-396.

Add more citations

References found in this work

Non-bounding constructions.J. R. Shoenfield - 1990 - Annals of Pure and Applied Logic 50 (2):191-205.
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.

Add more references