Definability of R. E. sets in a class of recursion theoretic structures
Journal of Symbolic Logic 48 (3):662-669 (1983)
| 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 articlesTill Tantau (2005). Weak Cardinality Theorems. Journal of Symbolic Logic 70 (3):861 - 878.
Gunther Mainhardt (2004). P Versus Np and Computability Theoretic Constructions in Complexity Theory Over Algebraic Structures. Journal of Symbolic Logic 69 (1):39-64.
Wolfgang Maass (1982). Recursively Enumerable Generic Sets. Journal of Symbolic Logic 47 (4):809-823.
Charles K. Landraitis (1977). Definability in Well Quasi-Ordered Sets of Structures. Journal of Symbolic Logic 42 (2):289-291.
A. C. Walczak-Typke (2005). The First-Order Structure of Weakly Dedekind-Finite Sets. Journal of Symbolic Logic 70 (4):1161 - 1170.
Franco Montagna & Andrea Sorbi (1985). Universal Recursion Theoretic Properties of R.E. Preordered Structures. Journal of Symbolic Logic 50 (2):397-406.
Robert E. Byerly (1982). Recursion Theory and the Lambda-Calculus. Journal of Symbolic Logic 47 (1):67-83.
Jon Barwise (1975). Admissible Sets and Structures: An Approach to Definability Theory. Springer-Verlag.
Iraj Kalantari & Allen Retzlaff (1979). Recursive Constructions in Topological Spaces. Journal of Symbolic Logic 44 (4):609-625.
Sebastiaan A. Terwijn & Domenico Zambella (2001). Computational Randomness and Lowness. Journal of Symbolic Logic 66 (3):1199-1205.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,830 of 549,087 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
