Basic Predicate Calculus is not Sound with Respect to the Strong Variant of Strictly Primitive Recursive Realizability

被引：2

作者：

Konovalov, A. Yu ^{[1
]}

机构：

[1] Lomonosov Moscow State Univ, Moscow 119991, Russia

来源：

基金：

俄罗斯基础研究基金会;

关键词：

strictly primitive recursive realizability; basic predicate calculus BQC; constructive semantics; realizability;

D O I：

10.1134/S000143462201028X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

It is proved that basic predicate calculus BQC is not sound with respect to the strong variant of strictly primitive recursive realizability.

引用

页码：243 / 257

页数：15

共 10 条

[1]

Axt P., 1963, Z. Math. Logik Grundlagen Math, V9, P53, DOI [10.1002/malq.19630090106, DOI 10.1002/MALQ.19630090106]

[2] STRICTLY PRIMITIVE RECURSIVE REALIZABILITY [J].

DAMNJANOVIC, Z .

[3]

Grzegorczyk A., 1953, Rozprawy Matematyczne, V4, P1

[4]

Kha PakBen., 2003, SUBRECURSIVE REALIZA

[5]

Kleene Stephen, 1945, J SYMBOLIC LOGIC, V10, P109, DOI DOI 10.2307/2269016

[6]

Konovalov A.Yu., 2021, INTELLECT SISTEMY TE, V25, P97

[7]

Plisko V., 2007, Primitive Recursive Realizability and Basic Propositional Logic

[8]

RUITENBURG W., 1998, NOTRE DAME J FORMAL, V39, P18, DOI [10.1305/ndjfl/1039293019, DOI 10.1305/NDJFL/1039293019]

[9] Provably total functions of Basic Arithmetic [J].

Salehi, S .

[10]

Visser A., 1981, STUDIA LOGICA, V40, P155, DOI 10.1007/BF01874706