Recursion theory in a lower semilattice
Journal of Symbolic Logic 57 (3):892-911 (1992)
| 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,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJens Erik Fenstad, R. O. Gandy & Gerald E. Sacks (eds.) (1978). Generalized Recursion Theory Ii: Proceedings of the 1977 Oslo Symposium. Sole Distributors for the U.S.A. And Canada, Elsevier North-Holland.
C.-T. Chong (1984). Techniques of Admissible Recursion Theory. Springer-Verlag.
Simon Thompson (1985). Axiomatic Recursion Theory and the Continuous Functionals. Journal of Symbolic Logic 50 (2):442-450.
Wolfgang Maass (1978). Contributions to [Alpha]- and [Beta]-Recursion Theory. Minerva-Publikation.
Jens Erik Fenstad & Peter G. Hinman (eds.) (1974). Generalized Recursion Theory. New York,American Elsevier Pub. Co..
Anil Nerode & Richard A. Shore (eds.) (1985). Recursion Theory. American Mathematical Society.
Klaus Ambos-Spies, André Nies & Richard A. Shore (1992). The Theory of the Recursively Enumerable Weak Truth-Table Degrees is Undecidable. Journal of Symbolic Logic 57 (3):864-874.
Raymond M. Smullyan (1993). Recursion Theory for Metamathematics. Oxford University Press.
C. J. Ash & R. G. Downey (1984). Decidable Subspaces and Recursively Enumerable Subspaces. Journal of Symbolic Logic 49 (4):1137-1145.
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads2 ( #232,501 of 549,087 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
