Ct Chong

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Other Versions

No versions found

View all bargains

Buy this book

Find it on Amazon.com

Links

PhilArchive

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

Σ2 Induction and infinite injury priority argument, Part I: Maximal sets and the jump operator.C. T. Chong & Yue Yang - 1998 - Journal of Symbolic Logic 63 (3):797-814.
C. TRETKOFF [1988] Complexity, combinatorial group theory and the language of palutators, Theoret. Comput. Sci., 56. pp. 253-275. [REVIEW]J. Stillwell, V. Stoltenberg-Hansen & Jv Tucker - 1999 - In Edward R. Griffor, Handbook of computability theory. New York: Elsevier. pp. 140--445.
Towards applied theories based on computability logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
C. T. Chong. Techniques of admissible recursion theory. Lecture notes in mathematics, vol. 1106. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1984, ix + 214 pp.Anne Leggett - 1987 - Journal of Symbolic Logic 52 (1):285-287.
The classification of small weakly minimal sets. II.Steven Buechler - 1988 - Journal of Symbolic Logic 53 (2):625-635.
PG. Hinman.J. Barwise, L. Blum, M. Shub, S. Smale, Fr Drake, Ss Wainer, E. Engeler, Hm Friedman, Ro Gandy & Cme Yates - 1999 - In Edward R. Griffor, Handbook of computability theory. New York: Elsevier. pp. 358.
Lv Welch.Sg Simpson, Ta Slaman, Steel Jr, Wh Woodin, Ri Soare, M. Stob, C. Spector & Am Turing - 1999 - In Edward R. Griffor, Handbook of computability theory. New York: Elsevier. pp. 153.
H. Rogers, jr.W. Sieg & J. Byrnes - 1999 - In Edward R. Griffor, Handbook of computability theory. New York: Elsevier. pp. 140--35.
Pseudoprojective strongly minimal sets are locally projective.Steven Buechler - 1991 - Journal of Symbolic Logic 56 (4):1184-1194.
Computability theory and linear orders.Rod Downey - 1998 - In I︠U︡riĭ Leonidovich Ershov, Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.

Analytics

Added to PP
2014-01-27

Downloads
34 (#1,507,408)

6 months
14 (#861,703)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Photo of Yi Yang
Yi Yang
University of Canterbury

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references