A FORMAL AND INTUITIONISTIC PROOF OF THE COMPLETENESS THEOREM OF CLASSICAL LOGIC

被引：21

作者：

Krivine, Jean-Louis ^{[1
]}

机构：

[1] Univ Paris VII, Equipe Log Math, CNRS, 2 Pl Jussieu, F-75251 Paris 05, France

来源：

BULLETIN OF SYMBOLIC LOGIC | 1996年 / 2卷 / 04期

关键词：

D O I：

10.2307/421172

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

页码：405 / 421

页数：17

共 50 条

[1] A COMPLETENESS THEOREM FOR INTUITIONISTIC PREDICATE LOGIC - AN INTUITIONISTIC PROOF
DRAGALIN, AG
[J]. PUBLICATIONES MATHEMATICAE-DEBRECEN, 1987, 34 (1-2): : 1 - 19
[2] An Intuitionistic Completeness Theorem for Classical Predicate Logic
Victor N. Krivtsov
[J]. Studia Logica, 2010, 96 : 109 - 115
[3] An Intuitionistic Completeness Theorem for Classical Predicate Logic
Krivtsov, Victor N.
[J]. STUDIA LOGICA, 2010, 96 (01) : 109 - 115
[4] INTUITIONISTIC COMPLETENESS THEOREM FOR INTUITIONISTIC PREDICATE LOGIC
VELDMAN, W
[J]. JOURNAL OF SYMBOLIC LOGIC, 1976, 41 (01) : 159 - 166
[5] Simple proof of the completeness theorem for second-order classical and intuitionistic logic by reduction to first-order mono-sorted logic
Nour, K
Raffalli, C
[J]. THEORETICAL COMPUTER SCIENCE, 2003, 308 (1-3) : 227 - 237
[6] Intuitionistic completeness for first order classical logic
Berardi, S
[J]. JOURNAL OF SYMBOLIC LOGIC, 1999, 64 (01) : 304 - 312
[7] A strong completeness theorem in intuitionistic quantified modal logic
Gao, HS
[J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2000, 43 (01): : 60 - 70
[8] A strong completeness theorem in intuitionistic quantified modal logic
Hengshan Gao
[J]. Science in China Series E: Technological Sciences, 2000, 43 : 60 - 70
[9] A strong completeness theorem in intuitionistic quantified modal logic
高恒珊
[J]. Science China Technological Sciences, 2000, (01) : 60 - 70
[10] Krivine's intuitionistic proof of classical completeness (for countable languages)
Berardi, S
Valentini, S
[J]. ANNALS OF PURE AND APPLIED LOGIC, 2004, 129 (1-3) : 93 - 106

← 1 2 3 4 5 →