previous ::
next
Computability-Theoretic Complexity of Countable Structures
Valentina S. Harizanov
Source: Bull. Symbolic Logic Volume 8, Number 4 (2002), 457-477.
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
Links and Identifiers
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
previous ::
next
