Chapter 2 Π 1 0 Classes in computability theory

Studies in Logic and the Foundations of Mathematics

Volumn 140, Issue C, 1999, Pages 37-85

  Cenzer, Douglas ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 15244352362     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(99)80018-4     Document Type: Chapter

References (62)

1. Bean D. Effective coloration. J. Symbolic Logic 41 (1976) 469-480
2. Cenzer D. Effective dynamics. In: Crossley J., Remmel J., Shore R., and Sweedler M. (Eds). Logical Methods in honor of Anil Nerode's Sixtieth Birthday (1993), Birkhäuser 162-177
3. 0 classes. Ann. Pure Appl. Logic. 31 (1986) 145-163
4. 0 classes. Ann. Pure Appl. Logic 59 (1993) 79-139
5. Cenzer D., and Remmel J. Recursively presented games and strategies. Math. Social Sciences 24 (1992) 117-139
6. 0 classes. Ann. Pure Appl. Logic. 43 (1998) 3-61
7. D. Cenzer and J. Remmel [ta1] Index sets in computable analysis, Theoretical Computer Science, to appear.
8. 0 classes in mathematics, in: Recursive Mathematics, Y. Ershov, S. Goncharov, A. Nerode, J. Remmel, eds., to appear.
9. 0 set. J. Symbolic Logic 54 (1989) 975-991
10. Cholak P., and Downey R. On the Cantor-Bendixson rank of ecursively enumerable sets. J. Symbolic Logic 58 (1993) 629-640
11. Church A., and Kleene S. Formal definitions in the theory of ordinal numbers. Fund. Math. 28 (1937) 11-21
12. Dekker J., and Myhill J. Retraceable sets. Canad. J. math. 10 (1985) 357-373
13. Downey R. Abstract Dependence, Recursion Theory and the Lattice of Recursively Enumerable Filters. Dissertation (1982), Monash University
14. 0 classes and their ranked points. Notre Dame J. Formal Logic 32 (1991) 499-512
15. Downey R., Jockusch C., and Stob M. Array non-recursive sets and multiple permitting arguments. In: Ambos-Spies K., Muller G., and Sacks G. (Eds). Recursion Theory Week (Proceedings oberwolfach 1989). Lecture Notes in Mathematics Vol. 1432 (1990), Springer 141-173
16. Ehrenfeucht A. Separable theories. Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 9 (1961) 17-19
17. Friedman H., Simpson S., and Smith R. Countable algebra and set existence theorems. Ann. Pure and Appl. Logic. 25 (1983) 141-181
18. M. Groszek and T. Slaman [ta3] A recursive tree in which every path computes a minimal degree, Proc. ASL Summer School, Haifa, to appear.
19. Hanf W. The Boolean algebra of logic. Bull. Amer. Math. Soc. 81 (1975) 587-589
20. Harei D. Hamiltonian paths in infinite graphs. Israel J. Math. 76 (1991) 317-336
21. Hinman P. Recursion-Theoretic Hierarchies, Perspectives in Mathematical Logic (1978), Springer, Berlin
22. 0 classes and Boolean combinations of recursively enumerable sets. J. Symbolic Logic 39 (1974) 95-96
23. Jockusch C., and Shore R. Pseudo-jump operators II. J. Symbolic Logic 49 (1984) 1205-1236
24. 0 classes. J. Symbolic Logic 36 (1971) 66-78
25. 0 classes and degrees of theories. Trans. Amer. Math. Soc. 173 (1972) 33-56
26. 0 classes. Pacific J. Math. 40 (1972) 605-616
27. Kierstead H. An effective version of Dilworth's theorem. Trans. Amer. Math. Soc. 268 (1981) 63-77
28. Kierstead H., McNulty G., and Trotter W. Recursive dimension for partially ordered sets. Order 1 (1984) 67-82
29. Kleene S. Recursive predicates and quantifiers. Trans. Amer. Math. Soc. 53 (1943) 41-73
30. Kleene S. A symmetric form of Gödel's theorem. Ind. Math. 12 (1950) 244-246
31. Kreisel G. A variant to Hilbert's theory of the foundations of arithmetic. British J. Philosophy of Science 4 (1953) 107-129
32. Kreisel G. Analysis of the Cantor-Bendixson theorem by means of the analytic hierarchy. Bull. Acad. Polon. des Sciences, Ser. Math., Astronom. et Phys. 7 (1959) 621-626
33. 0 classes and complete extensions of PA. In: Ebbinghaus H.-D., Muller G., and Sacks G. (Eds). Recursion Theory Week (Proceedings Oberwolfach 1984). Lecture Notes in Mathematics Vol. 1141 (1985), Springer, Berlin 245-259
34. Kucera A. An alternative, priority free, solution to Post's problem. Lecture Notes in Computer Science Vol. 233 (1986) 493-500
35. Kuratowski K., and Mostowski A. Set Theory, Studies in Logic Vol. 86 (1968), North-Holland
36. Lacombe D. Les ensembles recursivement ouverts ou fermes, et leurs applications a l'analyse recursive. Comptes Rendus Hebdomaires des Sciences 245 (1957) 1040-1043
37. Lacombe D. Les ensembles recursivement ouverts ou fermes, et leurs applications a l'analyse recursive. Comptes Rendus Hebdomaires des Sciences 246 (1958) 405-418
38. Manaster A., and Rosenstein J. Effective matchmaking. Proc. London Math. Soc. 25 (1972) 615-654
39. Manaster A., and Rosenstein J. Effective matchmaking and k-chromatic graphs. Proc. Amer. Math. Soc. 39 (1973) 371-378
40. Martin D., and Pour-El M. Axiomatizable theories with few axiomatizable extensions. J. Symbolic Logic 35 (1970) 205-209
41. Martin G. Cantor Singletons, Rank-Faithful Trees, and Other Topics in Recursion Theory. Dissertation (1993), University of Maryland
42. Martin-Löf P. The definition of random sequences. Information and Control 9 (1966) 602-619
43. Metakides G., and Nerode A. Effective content of field theory. Ann. Math. Logic 17 (1979) 289-320
44. Moschovakis Y. Descriptive Set Theory, Studies in Logic Vol. 100 (1980), North-Holland, Amsterdam
45. Nerode A. General topology and partial recursive functionals. Summaries of Talks Presented at the Summer Institute for Symbolic Logic (1957), Cornell University 247-251
46. Nerode A., and Huang W. Applications of pure recursion theory to recursive analysis. Acta Sinica 28 (1985)
47. Odifreddi P. Classical Recursion Theory (1989), North-Holland, Amsterdam
48. Owings J. Rank, join and Cantor singletons. Archives of Mathematical Logic 36 (1997) 313-320
49. Remmel J. On the effectiveness of the Schroder-Bernstein theorem. Proc. Amer. Math. Soc. 83 (1981) 379-386
50. 0 classes. Ann. Pure Appl. Logic 32 (1986) 185-194
51. Rogers H. Theory of Recursive Functions and Effective Computability (1967), McGraw-Hill, New York
52. Rosser B. Extensions of some theorems of Gödel and Church. J. Symbolic 1 (1936) 87-91
53. Schmerl J. Jump number and width. Order 3 (1986) 227-234
54. Scott D. Algebras of sets binumerable in complete extensions of arithmetic. In: Dekker J. (Ed). Recursive Function Theory. Amer. Math. Soc. Proc. Symposia in Pure Math. Vol. 5 (1962) 117-121
55. Shoenfield J. Degrees of formal systems. J. Symbolic 23 (1958) 389-392
56. Shoenfield J. Degrees of models. J. Symbolic Logic 25 (1960) 233-237
57. Shoenfield J. Mathematical Logic (1967), Addison-Wesley
58. Simpson S. Degrees of unsolvability. In: Barwise J. (Ed). Handbook of Mathematical Logic. Studies in Logic Vol. 90 (1977), North-Holland, Amsterdam 631-652
59. Smith R. Effective aspects of profinite groups. J. Symbolic Logic 46 (1981) 851-863
60. Soare R. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc. 139 (1969) 271-294
61. Soare R. Recursively Enumerable Sets and Degrees (1987), Springer, Berlin
62. Spector C. Inductively defined sets of natural numbers. Infinitistic Methods (Proceedings of Warsaw Symposium) (1961), Pergamon Press 301-384