Lv Welch

, , , , , , &
In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 153 (1999)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Other Versions

No versions found

Links

PhilArchive



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

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

Ge Sacks and sg Simpson [1972] the oz-finite injury method, Ann. Math. Logic, 4, pp. 323-367.M. Magidor, S. Shelah, J. Stavi, M. Mytilinaios, Ta Slaman, Jb Paris & H. la KirbyRogers Jr - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 299.
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. [REVIEW]Damir D. Dzhafarov - 2017 - Bulletin of Symbolic Logic 23 (1):113-115.
SB Cooper, TA Slaman, and SS Wainer, eds. Computability, Enumerability, Unsolvability: Directions in Recursion Theory.R. Downey - 1997 - Journal of Logic Language and Information 6:107-109.
Inner model operators in L.Mitch Rudominer - 2000 - Annals of Pure and Applied Logic 101 (2-3):147-184.
Iterated relative recursive enumerability.Peter A. Cholak & Peter G. Hinman - 1994 - Archive for Mathematical Logic 33 (5):321-346.
H. Rogers, jr.W. Sieg & J. Byrnes - 1999 - In Edward R. Griffor (ed.), Handbook of computability theory. New York: Elsevier. pp. 140--35.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.
Degrees of randomized computability.Rupert Hölzl & Christopher P. Porter - 2022 - Bulletin of Symbolic Logic 28 (1):27-70.
Computability Theory.Valentina Harizanov, Keshav Srinivasan & Dario Verta - 2024 - In Bharath Sriraman (ed.), Handbook of the History and Philosophy of Mathematical Practice. Cham: Springer. pp. 1933-1961.
Turing A. M.. Computability and λ-definability.Rózsa Péter - 1938 - Journal of Symbolic Logic 3 (2):89-89.

Analytics

Added to PP
2014-01-27

Downloads
24 (#906,477)

6 months
1 (#1,886,877)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.

Add more citations

References found in this work

No references found.

Add more references