For the decidable cases of arithmatical sentences , we give the upper and lower bounds of their computational complexity 对具可决定性的算术句型，我们并给出了其计算繁度的上界与下界。
2.
The system ip and relations of classification of generalized tautologies among the systems ip and its 3 - valued system and the system c2 is investigated . it is proved that generalized tautologies are decidable in the system ip 本文分两种情形b一0与p 0 ）研究了系统lp与其三元子代数及经典二值系统q之间（广川重言式的关系，指出在系统lp中广义重言式是可判定的
