| 素数阶群理论的量词消去算法及其上界 |
| |
| 引用本文： | 沈云付.素数阶群理论的量词消去算法及其上界[J].数学学报,2005,48(3):549-554. |
| |
| 作者姓名： | 沈云付 |
| |
| 作者单位： | 上海大学计算机学院 上海200072 |
| |
| 基金项目： | 上海市教委科学技术发展基金资助项目(01A067) |
| |
| 摘 要： | 在以前的一些工作中,作者已经证明语言(?)={+,0,e)上素数阶群的理论T有量词消去性质并研究了它的判定问题的复杂性.本文在此基础上将利用T的判定问题的复杂性结果给出理论T的量词消去的一个算法,同时给出该算法的复杂性上界.
|
| 关 键 词： | 群 素数阶 量词消去 |
Algorithmic Quantifier Elimination and Its Upper Bound for the Theory of Groups of Prime Orders |
| |
| Yun Fu SHEN School of Computer Engineering and Science,Shanghai University,Shanghai ,P. R. China.Algorithmic Quantifier Elimination and Its Upper Bound for the Theory of Groups of Prime Orders[J].Acta Mathematica Sinica,2005,48(3):549-554. |
| |
| Authors: | Yun Fu SHEN School of Computer Engineering and Science Shanghai University Shanghai P R China |
| |
| Institution: | Yun Fu SHEN School of Computer Engineering and Science, Shanghai University, Shanghai 200072, P. R. China |
| |
| Abstract: | In the previous work it was proved that the theory T of groups with prime orders over language (?) ={+, 0, e} has the property of the quantifier elimination and discussed its decision problem. This paper is a continuation, an algorithm to eliminate the quantifiers of formulas about the theory T is presented and an upper bound for this algorithm is given. |
| |
| Keywords: | Group Prime order Quantifier elimination |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《数学学报》浏览原始摘要信息 |
| 点击此处可从《数学学报》下载免费的PDF全文 |
