×

zbMATH — the first resource for mathematics

Similarity of the properties of recursively enumerable and finitely axiomatizable theories. (English. Russian original) Zbl 0703.03014
Sov. Math., Dokl. 40, No. 2, 372-375 (1990); translation from Dokl. Akad. Nauk SSSR 308, No. 4, 788-791 (1989).
This note contains the result that, with respect to the majority of natural model-theoretic properties, the significant options possible for finitely axiomatizable theories precisely coincide with those possible for recursively axiomatizable theories.

MSC:
03C57 Computable structure theory, computable model theory
PDF BibTeX XML Cite