Abstract
An absolute L-realizability of predicate formulas is introduced for all countable extensions L of the language of arithmetic. It is proved that the intuitionistic logic is not sound with this semantics.
References
S. C. Kleene, Introduction to Metamathematics (North-Holland Publishing Company, 1952; IL, Moscow, 1957).
V. E. Plisko, “Absolute Realizability of Predicate Formulas,” Izvestiya Akad. Nauk SSSR, Matem. 47 (2), 315 (1983).
S. Salehi, “Primitive Recursive Realizability and Basic Arithmetic,” Bull. Symbol. Logic. 7 (1), 147 (2001).
W. Ruitenburg, “Basic Predicate Calculus,” Notre Dame J. Formal Logic 39 (1), 18 (1998).
A. Yu. Konovalov and V. E. Plisko, “On Hyperarithmetical Realizability,” Matem. Zametki 98 (5), 725 (2015) [Math. Notes 98 (5), 778 (2015)].
A. Yu. Konovalov, “Arithmetical Realizability and Basic Logic,” Vestn. Mosk. Univ., Matem. Mekhan., No. 1, 52 (2016).
Author information
Authors and Affiliations
Corresponding author
About this article
Cite this article
Konovalov, A.Y. Absolute L-Realizability and Intuitionistic Logic. Moscow Univ. Math. Bull. 74, 79–82 (2019). https://doi.org/10.3103/S0027132219020086
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0027132219020086