Complexity Ranks of Countable Models
Gao, Su
Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, p. 33-48 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
We define some variations of the Scott rank for countable models and obtain some inequalities involving the ranks. For mono-unary algebras we prove that the game rank of any subtree does not exceed the game rank of the whole model. However, similar questions about linear orders remain unresolved.
Publié le : 2007-01-14
Classification:  isomorphism relation,  Scott rank,  mono-unary algebras,  03C15,  03C64,  03E15 
@article{1172787543,
     author = {Gao, Su},
     title = {Complexity Ranks of Countable Models},
     journal = {Notre Dame J. Formal Logic},
     volume = {48},
     number = {1},
     year = {2007},
     pages = { 33-48},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1172787543}
}

Gao, Su. Complexity Ranks of Countable Models. Notre Dame J. Formal Logic, Tome 48 (2007) no. 1, pp.  33-48. http://gdmltest.u-ga.fr/item/1172787543/