Arithmetical Completeness of the Intuitionistic Logic of Proofs

被引：6

作者：

Dashkov, Evgenij ^{[1
]}

机构：

[1] Moscow MV Lomonosov State Univ, Dept Math Log & Theory Algorithms, Fac Mech & Math, Moscow 119992, Russia

来源：

JOURNAL OF LOGIC AND COMPUTATION | 2011年 / 21卷 / 04期

基金：

美国国家科学基金会;

关键词：

Logic of proofs; intuitionistic arithmetic; admissible rules;

D O I：

10.1093/logcom/exp041

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Classical logic of proofs LP naturally extends propositional calculus to the language enriched with formulas meaning t is a proof of formula F. Intuitionistic logic of proofs iLP introduced by Artemov and Iemhoff was conjectured to be complete with respect to intuitionistic arithmetic HA. The article presents a proof of this conjecture.

引用

页码：665 / 682

页数：18

共 50 条

[21] A simplified proof of arithmetical completeness theorem for provability logic GLP
Beklemishev, L. D.
[J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2011, 274 (01) : 25 - 33
[22] MEANING AND PROOFS - CONFLICT BETWEEN CLASSICAL AND INTUITIONISTIC LOGIC
PRAWITZ, D
[J]. THEORIA, 1977, 43 : 2 - 40
[23] A simplified proof of arithmetical completeness theorem for provability logic GLP
L. D. Beklemishev
[J]. Proceedings of the Steklov Institute of Mathematics, 2011, 274 : 25 - 33
[24] Irreflexive Modality in the Intuitionistic Propositional Logic and Novikov Completeness
A. D. Yashin
[J]. Journal of Philosophical Logic, 1999, 28 : 175 - 197
[25] A strong completeness theorem in intuitionistic quantified modal logic
Hengshan Gao
[J]. Science in China Series E: Technological Sciences, 2000, 43 : 60 - 70
[26] A strong completeness theorem in intuitionistic quantified modal logic
Gao, HS
[J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2000, 43 (01): : 60 - 70
[27] On the polynomial-space completeness of intuitionistic propositional logic
Vítězslav Švejdar
[J]. Archive for Mathematical Logic, 2003, 42 : 711 - 716
[28] On the polynomial-space completeness of intuitionistic propositional logic
Svejdar, V
[J]. ARCHIVE FOR MATHEMATICAL LOGIC, 2003, 42 (07) : 711 - 716
[29] A FORMAL AND INTUITIONISTIC PROOF OF THE COMPLETENESS THEOREM OF CLASSICAL LOGIC
Krivine, Jean-Louis
[J]. BULLETIN OF SYMBOLIC LOGIC, 1996, 2 (04) : 405 - 421
[30] COMPLETENESS RESULTS FOR INTUITIONISTIC AND MODAL LOGIC IN A CATEGORICAL SETTING
MAKKAI, M
REYES, GE
[J]. ANNALS OF PURE AND APPLIED LOGIC, 1995, 72 (01) : 25 - 101

← 1 2 3 4 5 →