Decidability of the positive theory of a~free countably generated semigroup
    
    
  
  
  
      
      
      
        
Sbornik. Mathematics, Tome 44 (1983) no. 1, pp. 109-116
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			A decision procedure for the positive theory of a free countably generated semigroup is constructed, with a bound on the number of steps, obtained by modifying an algorithm from work of G. S. Makanin (see Matem. Sb. (N.S.), 103(145) (1977), 147–236).
Bibliography: 7 titles.
			
            
            
            
          
        
      @article{SM_1983_44_1_a5,
     author = {Yu. M. Vazhenin and B. V. Rozenblat},
     title = {Decidability of the positive theory of a~free countably generated semigroup},
     journal = {Sbornik. Mathematics},
     pages = {109--116},
     publisher = {mathdoc},
     volume = {44},
     number = {1},
     year = {1983},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/SM_1983_44_1_a5/}
}
                      
                      
                    TY - JOUR AU - Yu. M. Vazhenin AU - B. V. Rozenblat TI - Decidability of the positive theory of a~free countably generated semigroup JO - Sbornik. Mathematics PY - 1983 SP - 109 EP - 116 VL - 44 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/SM_1983_44_1_a5/ LA - en ID - SM_1983_44_1_a5 ER -
Yu. M. Vazhenin; B. V. Rozenblat. Decidability of the positive theory of a~free countably generated semigroup. Sbornik. Mathematics, Tome 44 (1983) no. 1, pp. 109-116. http://geodesic.mathdoc.fr/item/SM_1983_44_1_a5/
