|
This article is cited in 5 scientific papers (total in 5 papers)
General recursive realizability and basic logic
A. Yu. Konovalov Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The notion of general recursive realizability is defined based on using indices of general recursive functions as a constructive way of obtaining some realizations from others. The soundness of basic logic with respect to the semantics of general recursive realizability is proved.
Keywords:
realizability, absolute realizability, subrecursive realizability, basic logic.
Received: 21.08.2019 Revised: 27.11.2020
Citation:
A. Yu. Konovalov, “General recursive realizability and basic logic”, Algebra Logika, 59:5 (2020), 542–566; Algebra and Logic, 59:5 (2020), 367–384
Linking options:
https://www.mathnet.ru/eng/al2633 https://www.mathnet.ru/eng/al/v59/i5/p542
|
Statistics & downloads: |
Abstract page: | 166 | Full-text PDF : | 19 | References: | 20 | First page: | 5 |
|