|
Sibirskii Matematicheskii Zhurnal, 2002, Volume 43, Number 6, Pages 1265–1270
(Mi smj1367)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Computably rigid models with enumerable submodels
A. N. Duzykaeva Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Abstract:
We consider recursive representations for the set of rational numbers with a distinguished dense and codense subset and for some Boolean algebras with a distinguished subalgebra. We show that the rejection of recursiveness of the distinguished submodel opens up the possibility of constructing models without nontrivial automorphisms. The proof is carried out by the priority method.
Keywords:
computable model, computable automorphism, group of computable automorphisms, priority method, Boolean algebra, recursively enumerable set.
Received: 26.11.2001
Citation:
A. N. Duzykaeva, “Computably rigid models with enumerable submodels”, Sibirsk. Mat. Zh., 43:6 (2002), 1265–1270; Siberian Math. J., 43:6 (2002), 1023–1026
Linking options:
https://www.mathnet.ru/eng/smj1367 https://www.mathnet.ru/eng/smj/v43/i6/p1265
|
|