The complexity of countable categoricity in finite languages

Aleksander Ivanov. The complexity of countable categoricity in finite languages. Math. Log. Q., 58(1-2):105-112, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.