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.
Similar content being viewed by others
Literature cited
S. Feferman, “Systems of predicative analysis,” J. of Symbolic Logic,29, 1–30 (1964).
S. C. Kleene, “Hierarchies of number-theoretical predicates,” Bull. Am. Math. Soc.,61, 193–213 (1955).
S. C. Kleene, Introduction to Metamathematics, Van Nostrand (1952).
P. Lorenzen, Einfuhrung in die operative Logik und Mathematik, Berlin-Heidelberg-New York (1955).
Additional information
Translated from Matematicheskie Zametki, Vol. 13, No. 5, pp. 735–745, May, 1973.
Rights and permissions
About this article
Cite this article
Nepeivoda, N.N. A new concept of predicative truth and definability. Mathematical Notes of the Academy of Sciences of the USSR 13, 439–445 (1973). https://doi.org/10.1007/BF01147475
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01147475