STRONG COMPLETENESS OF A PARTIAL SYSTEM OF PROPOSITIONAL CALCULUS

被引：0

|

作者：

LONDEY, DG

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1967年 / 32卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：574 / &

相关论文

共 50 条

[31] Completeness Theory for Propositional Logics
Polacik, Tomasz
STUDIA LOGICA, 2010, 95 (03) : 443 - 446
[32] Strong completeness of a narrowing calculus for conditional rewrite systems with extra variables
Hamada, Mohamed
Electronic Notes in Theoretical Computer Science, 2000, 31 : 89 - 103
[33] Strong Typed Bohm Theorem and Functional Completeness on the Linear Lambda Calculus
Matsuoka, Satoshi
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (207): : 1 - 22
[34] On the completeness of propositional Hoare logic
Kozen, D
Tiuryn, J
INFORMATION SCIENCES, 2001, 139 (3-4) : 187 - 195
[35] The formal strong completeness of partial monoidal Boolean BI
Larchey-Wendling, Dominique
JOURNAL OF LOGIC AND COMPUTATION, 2016, 26 (02) : 605 - 640
[36] Strong Completeness of Medium Logic System
潘正华
朱梧槚
Journal of Southwest Jiaotong University, 2005, (02) : 77 - 81
[37] Quasi-formal deductive system for fuzzy propositional calculus
WANG GuojunInstitute of Mathematics
ChineseScienceBulletin, 1997, (14) : 1154 - 1157
[38] Quasi-formal deductive system for fuzzy propositional calculus
Wang, GJ
CHINESE SCIENCE BULLETIN, 1997, 42 (14): : 1154 - 1157
[39] Knowledge forgetting in propositional μ-calculus
Renyan Feng
Yisong Wang
Ren Qian
Lei Yang
Panfeng Chen
Annals of Mathematics and Artificial Intelligence, 2023, 91 : 1 - 43
[40] Space complexity in propositional calculus
Alekhnovich, M
Ben-Sasson, E
Razborov, AA
Wigderson, A
SIAM JOURNAL ON COMPUTING, 2002, 31 (04) : 1184 - 1211

← 1 2 3 4 5 →