Abstract:
In this paper a conception of predicative truth in the language of naive analysis is given, and the peculiarities of the induced logic are studied. It is shown that this concept can be formalized in a system with a constructive Carnap rule and that in a theory based on this concept of truth the same things can be expressed that can be expressed in the usual theories of hyperarithmetic and ramified analysis.
Citation:
N. N. Nepeivoda, “A new concept of predicative truth and definability”, Mat. Zametki, 13:5 (1973), 735–745; Math. Notes, 13:5 (1973), 439–445