Computability-theoretic complexity of countable structures
Bulletin of Symbolic Logic 8 (4):457-477 (2002)
| 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 |
  Try with proxy. |
| Through your library | Configure |
Similar books and articlesTom Linton (1991). Countable Structures, Ehrenfeucht Strategies, and Wadge Reductions. Journal of Symbolic Logic 56 (4):1325-1348.
S. B. Cooper, T. A. Slaman & S. S. Wainer (eds.) (1996). Computability, Enumerability, Unsolvability: Directions in Recursion Theory. Cambridge University Press.
Shaughan Lavine (1991). Dual Easy Uniformization and Model-Theoretic Descriptive Set Theory. Journal of Symbolic Logic 56 (4):1290-1316.
Shaughan Lavine (1993). Generalized Reduction Theorems for Model-Theoretic Analogs of the Class of Coanalytic Sets. Journal of Symbolic Logic 58 (1):81-98.
Su Gao (1998). On Automorphism Groups of Countable Structures. Journal of Symbolic Logic 63 (3):891-896.
Victor Harnik & Michael Makkai (1976). Applications of Vaught Sentences and the Covering Theorem. Journal of Symbolic Logic 41 (1):171-187.
S. J. Mcleish (1997). The Forth Part of the Back and Forth Map in Countable Homogeneous Structures. Journal of Symbolic Logic 62 (3):873-890.
Gunther Mainhardt (2004). P Versus Np and Computability Theoretic Constructions in Complexity Theory Over Algebraic Structures. Journal of Symbolic Logic 69 (1):39-64.
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
