|
This article is cited in 1 scientific paper (total in 1 paper)
Computable categoricity of the Boolean algebra $\mathfrak B(\omega)$ with a distinguished automorphism
N. A. Bazhenova, R. R. Tukhbatullinab a Novosibirsk State University, Novosibirsk, Russia
b CERGE–EI, a joint workplace of Charles Univ. and Economics Inst. Acad. Sci. Czech Repub., Politických vězňů, 7, 11121 Prague, Czech Republic
Abstract:
It is proved that every computably enumerable Turing degree is a degree of categoricity of some computable Boolean algebra with a distinguished automorphism. We construct an example of a computably categorical Boolean algebra with a distinguished automorphism, having a set of atoms in a given computably enumerable Turing degree.
Keywords:
Boolean algebra with distinguished automorphism, computable categoricity, categoricity spectrum, degree of categoricity.
Received: 24.07.2012
Citation:
N. A. Bazhenov, R. R. Tukhbatullina, “Computable categoricity of the Boolean algebra $\mathfrak B(\omega)$ with a distinguished automorphism”, Algebra Logika, 52:2 (2013), 131–144; Algebra and Logic, 52:2 (2013), 89–97
Linking options:
https://www.mathnet.ru/eng/al578 https://www.mathnet.ru/eng/al/v52/i2/p131
|
Statistics & downloads: |
Abstract page: | 369 | Full-text PDF : | 81 | References: | 74 | First page: | 21 |
|