Geodesic
Perfect Local Computability of Superatomic Boolean Algebra
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 2, pp. 24-41 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Proved that superatomic Boolean algebra is perfect local computable if and only if its rank is equal to computable ordinal.
Keywords: superatomic Boolean algebra, local computable, perfect local computable, rank of superatomic Boolean algebra. 
@article{VNGU_2014_14_2_a3,
     author = {D. A. Luppov},
     title = {Perfect {Local} {Computability} of {Superatomic} {Boolean} {Algebra}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {24--41},
     year = {2014},
     volume = {14},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a3/}
}
TY  - JOUR
AU  - D. A. Luppov
TI  - Perfect Local Computability of Superatomic Boolean Algebra
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2014
SP  - 24
EP  - 41
VL  - 14
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a3/
LA  - ru
ID  - VNGU_2014_14_2_a3
ER  - 
%0 Journal Article
%A D. A. Luppov
%T Perfect Local Computability of Superatomic Boolean Algebra
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2014
%P 24-41
%V 14
%N 2
%U http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a3/
%G ru
%F VNGU_2014_14_2_a3
D. A. Luppov. Perfect Local Computability of Superatomic Boolean Algebra. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 14 (2014) no. 2, pp. 24-41. http://geodesic.mathdoc.fr/item/VNGU_2014_14_2_a3/

[1] S. S. Goncharov, Yu. L. Ershov, Constructive Models, Kluwer Academic/Plenum Press, New York, 2002

[2] Miller R., Mulcahey D., “Perfect Local Computability and Computable Simulations”, Fourth Conference on Computability in Europe, CiE 2008, Lecture Notes in Computer Science, 5028, Springer-Verlag, Berlin, 2008, 388–397 | MR

[3] Miller R., “Locally Computable Structures”, Third Conference on Computability in Europe, CiE 2007, Lecture Notes in Computer Science, 4497, Springer-Verlag, Berlin, 2007, 575–584 | DOI | MR | Zbl

[4] Goncharov S. S., “Constructivizability of Superatomic Boolean Algebras”, Algebra Logika, 12:1 (1973), 31–40 | DOI | MR | Zbl

[5] S. S. Goncharov, Countable Boolean Algebras and Decidability, Kluwer Academic/Plenum Publishers, New York, etc., 1997 | MR | MR

[6] H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Company, New York, 1967 | MR | MR | Zbl

[7] Sacks G. E., Higher Recursion Theory, Perspectives in Mathematical Logic, Springer, Berlin, 1990 | DOI | MR