arXiv Open Access 2011

Complexity of countable categoricity in finite languages

A. Ivanov

Lihat Sumber

Abstrak

We study complexity of the index set of countably categorical theories and Ehrenfeucht theories in finite languages.

math.LO

A. Ivanov

APA MLA BibTeX

Ivanov, A. (2011). Complexity of countable categoricity in finite languages. https://arxiv.org/abs/1101.3792

Lihat di Sumber

Informasi Jurnal