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
相关论文
共 50 条