Algorithmic Definability and Completeness in Modal Logic

被引：0

作者：

Vakarelov, Dimiter ^{[1
]}

机构：

[1] Univ Sofia, Dept Math Log, Fac Math & Comp Sci, Sofia 1164, Bulgaria

来源：

FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, PROCEEDINGS | 2010年 / 5956卷

关键词：

EXTENSIONS;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：6 / 8

页数：3

共 50 条

[1] Elementary Definability and Completeness in General and Positive Modal Logic
Ernst Zimmermann
[J]. Journal of Logic, Language and Information, 2003, 12 (1) : 99 - 117
[2] Characterizations of Negative Definability in Modal Logic
Hollenberg M.
[J]. Studia Logica, 1998, 60 (3) : 357 - 386
[3] A NEW PROOF OF SAHLQVIST THEOREM ON MODAL DEFINABILITY AND COMPLETENESS
SAMBIN, G
VACCARO, V
[J]. JOURNAL OF SYMBOLIC LOGIC, 1989, 54 (03) : 992 - 999
[4] Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
Conradie, Willem
Goranko, Valentin
Vakarelov, Dimitar
[J]. JOURNAL OF APPLIED LOGIC, 2010, 8 (04) : 319 - 333
[5] ALGORITHMIC CORRESPONDENCE AND COMPLETENESS IN MODAL LOGIC. I. THE CORE ALGORITHM SQEMA
Conradie, Willem
Goranko, Valentin
Vakarelov, Dimiter
[J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2006, 2 (01)
[6] The Completeness Problem for Modal Logic
Achilleos, Antonis
[J]. LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS 2018), 2018, 10703 : 1 - 21
[7] POST COMPLETENESS IN MODAL LOGIC
SEGERBERG, K
[J]. JOURNAL OF SYMBOLIC LOGIC, 1972, 37 (04) : 711 - 715
[8] A COMPLETENESS THEOREM IN MODAL LOGIC
BAYART, A
[J]. JOURNAL OF SYMBOLIC LOGIC, 1966, 31 (02) : 276 - &
[9] FIRST-ORDER DEFINABILITY IN MODAL LOGIC
GOLDBLATT, RI
[J]. JOURNAL OF SYMBOLIC LOGIC, 1975, 40 (01) : 35 - 40
[10] Algorithmic Correspondence and Completeness in Modal Logic. III. Extensions of the Algorithm SQEMA with Substitutions
Conradie, Willem
Goranko, Valentin
Vakarelov, Dimiter
[J]. FUNDAMENTA INFORMATICAE, 2009, 92 (04) : 307 - 343

← 1 2 3 4 5 →