Abstract
Absolute arithmetical realizability of predicate formulas is introduced. It is proved that the intuitionistic logic is not correct with this semantics, but the basic logic is correct.
References
S. C. Kleene, Introduction to Metamathematics (Wolters-Noordhoff, 1952; IL, Moscow, 1957).
V. E. Plisko, “Absolute Realizability of Predicate Formulas,” Izvestiya Akad. Nauk SSSR, Matem. 47 (2), 315 (1983).
W. Ruitenburg, “Basic Predicate Calculus,” Notre Dame J. Formal Logic 39 (1), 18 (1998).
S. Salehi, “Primitive Recursive Realizability and Basic Arithmetic,” Bull. Symbol. Logic 7 (1), 147 (2001).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A. Y-u. Konovalov, 2016, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2016, Vol. 71, No. 1, pp. 52-56.
About this article
Cite this article
Konovalov, A.Y. Arithmetical realizability and basic logic. Moscow Univ. Math. Bull. 71, 35–38 (2016). https://doi.org/10.3103/S0027132216010071
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132216010071