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 (categorize this paper)
DOI 10.2178/bsl/1182353917
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,248
Through your library
References found in this work BETA
Recursively Enumerable Vector Spaces.G. Metakides & A. Nerode - 1977 - Annals of Mathematical Logic 11 (2):147-171.
Effective Content of Field Theory.G. Metakides & A. Nerode - 1979 - Annals of Mathematical Logic 17 (3):289-320.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
Generic Copies of Countable Structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.

View all 31 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
12 ( #386,185 of 2,193,087 )

Recent downloads (6 months)
1 ( #290,277 of 2,193,087 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature