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: 2107
Download times: 2166
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  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.