General Recursive Realizability and Basic Logic

被引:4
作者
Konovalov, A. Yu. [1 ]
机构
[1] Lomonosov Moscow State Univ, Moscow, Russia
关键词
realizability; absolute realizability; subrecursive realizability; basic logic;
D O I
10.1007/s10469-020-09610-y
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:367 / 384
页数:18
相关论文
共 15 条
[1]   STRICTLY PRIMITIVE RECURSIVE REALIZABILITY [J].
DAMNJANOVIC, Z .
JOURNAL OF SYMBOLIC LOGIC, 1994, 59 (04) :1210-1227
[2]   Minimal realizability of intuitionistic arithmetic and elementary analysis [J].
Damnjanovic, Z .
JOURNAL OF SYMBOLIC LOGIC, 1995, 60 (04) :1208-1241
[3]  
Kleene S.C., 1945, J. Symb. Log., V10, P109, DOI DOI 10.2307/2269016
[4]   On Hyperarithmetical Realizability [J].
Konovalov, A. Yu. ;
Plisko, V. E. .
MATHEMATICAL NOTES, 2015, 98 (5-6) :778-797
[5]  
Konovalov A. Yu., 2016, VESTN MOSK U MAT M+, P52
[6]  
Konovalov A. Yu., 2016, VEST MGU 1, P60
[7]  
Park B. H., 2002, 1896B2002 VINITI
[8]  
Park B. H., 2003, 218B2003 VINITI
[9]  
Plisko V. E., 1983, IZVESTIYA AKAD NAUK, V47, P315
[10]  
Rogers Hartley, 1987, Theory of Recursive Functions and Effective Computability