Complexity of countable categoricity in finite languages
Logic
2011-01-21 v1
Abstract
We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.
Keywords
Cite
@article{arxiv.1101.3792,
title = {Complexity of countable categoricity in finite languages},
author = {A. Ivanov},
journal= {arXiv preprint arXiv:1101.3792},
year = {2011}
}
Comments
16 pages