The criteria of completeness for redefining boolean  function
    
    
  
  
  
      
      
      
        
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 9 (2009) no. 3, pp. 95-114
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			Boolean function with two kinds of indeterminateness are considered. Appropriat definition of superposition, closed classes is introduced and the criteria of completeness is proved.
			
            
            
            
          
        
      @article{VNGU_2009_9_3_a6,
     author = {V. I. Panteleyev},
     title = {The criteria of completeness for redefining boolean  function},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {95--114},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2009_9_3_a6/}
}
                      
                      
                    V. I. Panteleyev. The criteria of completeness for redefining boolean function. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 9 (2009) no. 3, pp. 95-114. http://geodesic.mathdoc.fr/item/VNGU_2009_9_3_a6/