Arithmetic complexity of the predicate l
β
Valery Plisko
π
Article
π
2001
π
Elsevier Science
π
English
β 137 KB
It is proved in this paper that the predicate logic of each complete constructive arithmetic theory T having the existential property is T 1 -complete. In this connection, the techniques of a uniform partial truth deΓΏnition for intuitionistic arithmetic theories is used. The main theorem is applied