摘要
本文讨论了有理数理论的复杂性，通过构造精确的判定过程，从而确定了有理数理论的计算复杂性上界．
The complexity of the theory of rational number is discussed. By constructing accurate decision Procedure,the upper bounds of computational complexity of the theory of rational numberis obtained.
出处
《淮北煤师院学报（自然科学版）》
CAS
1999年第1期1-4,共4页
Journal of Huaibei Teachers College(Natural Sciences Edition)
关键词
有理数理论
前束范式
计算复杂性
逻辑理论
the theory of rational number prenex normal form computational complexity
