Bulletin of Symbolic Logic

Computability-Theoretic Complexity of Countable Structures

Valentina S. Harizanov

Full-text: Access denied (no subscription detected) We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Article information

Source
Bull. Symbolic Logic Volume 8, Number 4 (2002), 457-477.

Dates
First available in Project Euclid: 20 June 2007

Permanent link to this document
http://projecteuclid.org/euclid.bsl/1182353917

JSTOR
links.jstor.org

Digital Object Identifier
doi:10.2178/bsl/1182353917

Mathematical Reviews number (MathSciNet)
MR1956865

Zentralblatt MATH identifier
1039.03027

Citation

Harizanov, Valentina S. Computability-Theoretic Complexity of Countable Structures. Bulletin of Symbolic Logic 8 (2002), no. 4, 457--477. doi:10.2178/bsl/1182353917. http://projecteuclid.org/euclid.bsl/1182353917.


Export citation