Sufficient Conditions of Decidability of Boolean Algebras
    
    
  
  
  
      
      
      
        
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 4, pp. 63-68
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			In order to complete an investigation of decidability of Boolean algebras in terms of computability of a sequence of canonical ideals in this paper we present a proof of sufficiency of conditions obtained for Boolean algebras of every elementary characteristic.
			
            
            
            
          
        
      
                  
                    
                    
                    
                    
                    
                      
Keywords: 
Boolean algebras, computable set, computable model, strongly computable model, $n$-computability, elementary charakteristic of Boolean algebra, Ershov–Tarski ideal, Frechet ideal.
                    
                  
                
                
                @article{VNGU_2011_11_4_a5,
     author = {M. N. Leontyeva},
     title = {Sufficient {Conditions} of {Decidability} of {Boolean} {Algebras}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {63--68},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/}
}
                      
                      
                    M. N. Leontyeva. Sufficient Conditions of Decidability of Boolean Algebras. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 4, pp. 63-68. http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/
