We continue to study into the notion of general recursive realizability, which was introduced in [Algebra and Logic, 59, No. 5, 367-384 (2020)], based on using indices of general recursive functions as a constructive way of obtaining some realizations from others. It is proved that intuitionistic logic is not sound with respect to a weaker version of the semantics of general recursive realizability.
Similar content being viewed by others
References
S. C. Kleene, “On the interpretation of intuitionistic number theory,” J. Symb. Log., 10, 109-124 (1945).
Z. Damnjanovic, “Strictly primitive recursive realizability. I,” J. Symb. Log., 59, No. 4, 1210-1227 (1994).
S. Salehi, “Provably total functions of basic arithmetic,” Math. Log. Quart., 49, No. 3, 316-322 (2003).
Z. Damnjanovic, “Minimal realizability of intuitionistic arithmetic and elementary analysis,” J. Symb. Log., 60, No. 4, 1208-1241 (1995).
D. A. Viter, “Primitive recursive realizability and predicate logic,” Dep. VINITI of 06.08.2001, No. 1830-B2001, Moscow.
D. A. Viter, “Primitive recursive realizability and constructive theory of models,” Cand. Sci. Dissertation, MSU, Moscow (2001).
B. H. Park, “Minimal realizability and predicate logic,” Dep. VINITI of 05.11.2002, No. 1896-B2002, Moscow.
B. H. Park, “Strictly primitive recursive realizability and predicate logic,” Dep. VINITI of 04.02.2003, No. 218-B2003, Moscow.
A. Yu. Konovalov, “General recursive realizability and basic logic,” Algebra and Logic, 59, No. 5, 367-384 (2020).
W. Ruitenburg, “Basic predicate calculus,” Notre Dame J. Form. Log., 39, No. 1, 18-46 (1998).
A. Yu. Konovalov, “Arithmetical realizability and basic logic,” Vest. MGU, Ser. 1, Mat. Mekh., No. 1, 52-56 (2016).
A. Yu. Konovalov, “Arithmetical realizability and primitive recursive realizability,” Vest. MGU, Ser. 1, Mat. Mekh., No. 4, 60-64 (2016).
A. Yu. Konovalov and V. E. Plisko, “On hyperarithmetical realizability,” Mat. Zametki, 98, No. 5, 725-746 (2015).
A. Yu. Konovalov, “Absolute L-realizability and intuitionistic logic,” Vest. MGU, Ser. 1, Mat. Mekh., No. 2, 50-53 (2019).
V. E. Plisko, “Absolute realizability of predicate formulas,” Izv. Akad. Nauk SSSR, Ser. Mat., 47, No. 2, 315-334 (1983).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 60, No. 2, pp. 137-144, March-April, 2021. Russian https://doi.org/10.33048/alglog.2021.60.202.
Supported by RF Ministry of Education and Science, grant No. 075-15-2020-801.
Rights and permissions
About this article
Cite this article
Konovalov, A.Y. General Recursive Realizability and Intuitionistic Logic. Algebra Logic 60, 89–94 (2021). https://doi.org/10.1007/s10469-021-09631-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-021-09631-1