Constructive and Non-Constructive Infinite Formulas in Computable Structures
Algebra i logika, Tome 42 (2003) no. 4, pp. 391-412
Voir la notice de l'article provenant de la source Math-Net.Ru
A transition from arbitrary $L_{\omega_1\omega}$-formulas to computable formulas in the class of computable structures is considered. It is shown that transition of a certain type is possible which doubles the complexity of the formulas. In addition, the complexity jump is analyzed for the transition from an arbitrary Scott family consisting of $L_{\omega_1\omega}$-formulas to a computable Scott family in a fixed computable structure. Exact estimates of this jump are found.
Keywords:
computable structure, computable formula, Scott family.
@article{AL_2003_42_4_a0,
author = {P. E. Alaev},
title = {Constructive and {Non-Constructive} {Infinite} {Formulas} in {Computable} {Structures}},
journal = {Algebra i logika},
pages = {391--412},
publisher = {mathdoc},
volume = {42},
number = {4},
year = {2003},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2003_42_4_a0/}
}
P. E. Alaev. Constructive and Non-Constructive Infinite Formulas in Computable Structures. Algebra i logika, Tome 42 (2003) no. 4, pp. 391-412. http://geodesic.mathdoc.fr/item/AL_2003_42_4_a0/