Computably Rigid Models with Enumerable Submodels

Author: Buzykaeva A.N.  

Publisher: Springer Publishing Company

ISSN: 0037-4466

Source: Siberian Mathematical Journal, Vol.43, Iss.6, 2002-11, pp. : 1023-1026

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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.