Countable functionals and the projective hierarchy
Journal of Symbolic Logic 46 (2):209-215 (1981)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,672 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJ. Duparc (2003). The Steel Hierarchy of Ordinal Valued Borel Mappings. Journal of Symbolic Logic 68 (1):187-234.
Dag Normann (1983). Characterizing the Continuous Functionals. Journal of Symbolic Logic 48 (4):965-969.
Dag Normann (2006). Computing with Functionals: Computability Theory or Computer Science? Bulletin of Symbolic Logic 12 (1):43-59.
Howard Becker & Steve Jackson (2001). Supercompactness Within the Projective Hierarchy. Journal of Symbolic Logic 66 (2):658-672.
G. Longo & E. Moggi (1984). The Hereditary Partial Effective Functionals and Recursion Theory in Higher Types. Journal of Symbolic Logic 49 (4):1319-1332.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Kai Hauser & W. Hugh Woodin (1999). Π13 Sets and Π13 Singletons. Journal of Symbolic Logic 64 (2):590 - 616.
Steve Jackson & R. Daniel Mauldin (1991). Nonuniformization Results for the Projective Hierarchy. Journal of Symbolic Logic 56 (2):742-748.
Dag Normann (2000). Computability Over the Partial Continuous Functionals. Journal of Symbolic Logic 65 (3):1133-1142.
Dag Normann (1980). Recursion on the Countable Functionals. Springer-Verlag.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,652 of 549,069 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
