For the decidable cases of arithmatical sentences, we give the upper and lower bounds of their computational complexity.
For the decidable cases of arithmatical sentences, we give the upper and lower bounds of their computational complexity.
对具可决定性的算术句型，我们并给出了其计算繁度的上界与下界。