The Decidability and Complexity for Theories of Modules on Finitely PI Rings
Received:June 20, 1994  
Key Words: n-elementary equivalent   Ehrenfeucht Game   decidability   computational complexity.  
Fund Project:
Author NameAffiliation
Xue Rui Computer Center
Shanxi Teachers′ University
Linfen 041004 
Hits: 1997
Download times: 2100
Abstract:
      By making use of Ehrenfeucht Game theory, we give a successful procedure to decide the theories of modules on finitely principal ideal (PI) rings, and also the decision process upper bounds 2cn.
Citation:
DOI:10.3770/j.issn:1000-341X.1997.03.022
View Full Text  View/Add Comment