This article is cited 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.

UDC: 510.64

Received: 21.08.2019
Revised: 27.11.2020

DOI: 10.33048/alglog.2020.59.503

 English version: Algebra and Logic, 2020, 59:5, 367–384

Bibliographic databases:

• 
•