Computability-Theoretic Complexity of Countable Structures
Harizanov, Valentina S.
Bull. Symbolic Logic, Tome 8 (2002) no. 1, p. 457-477 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
Publié le : 2002-12-15
Classification:  
@article{1182353917,
     author = {Harizanov, Valentina S.},
     title = {Computability-Theoretic Complexity of Countable Structures},
     journal = {Bull. Symbolic Logic},
     volume = {8},
     number = {1},
     year = {2002},
     pages = { 457-477},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1182353917}
}

Harizanov, Valentina S. Computability-Theoretic Complexity of Countable Structures. Bull. Symbolic Logic, Tome 8 (2002) no. 1, pp.  457-477. http://gdmltest.u-ga.fr/item/1182353917/