1. This paper is devoted to a proof of decidability on consistent structure and gives a rapid decision method. 本文致力于相容结构的可判定性的证明并给出了一个快速的判定算法。
2. The decidability and soundness of the tableau algorithm is proved. The computation complexity is analysised. 证明了表算法的可判定性和可靠性，分析了表算法推理时的时间复杂度；
3. In this article, we make a survey on the logical problem of arithmetical sentences, definability and decidability, in particular. 本文是对算术句型中的逻辑问题做一综览，特别是算术句型的可定义性与可决定性。
