Publikace na Fakulta sociálních věd, Matematicko-fyzikální fakulta, Centrum pro ekonomický výzkum a doktorské studium |
2013
Abstrakt
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.