This article is cited in 2 papers

On arithmetic complexity of the predicate logics of complete constructive arithmetic theories

V. E. Plisko

M. V. Lomonosov Moscow State University

Abstract: It is proved in this paper that the predicate logic of each complete constructive arithmetic theory $T$ having the existence property is $\Pi_1^T$-complete. In this connection the techniques of uniform partial truth definition for intuitionistic arithmetic theories is used. The main theorem is applied to the characterization of the predicate logic corresponding to certain variant of the notion of realizable predicate formula. Namely it is shown that the set of undisprovable predicate formulas is recursively isomorphic to the complement of the set $\emptyset^{(\omega +1)}$.

UDC: 510.64+510.652

Received: 01.10.1997

Bibliographic databases:

• 
•