Decidable and Undecidable Problems for First-Order Definability and Modal Definability

被引：0

作者：

Balbiani, Philippe ^{[1
,2
]}

Tinchev, Tinko ^{[3
]}

机构：

[1] CNRS, Toulouse Inst Comp Sci Res, Toulouse, France

[2] Toulouse Univ, Toulouse, France

[3] Sofia Univ St Kliment Ohridski, Fac Math & Informat, Sofia, Bulgaria

来源：

LANGUAGE, LOGIC, AND COMPUTATION | 2022年 / 13206卷

关键词：

First-order definability; Modal definability; Chagrova's theorems;

D O I：

10.1007/978-3-030-98479-3_11

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The core of this paper is Chagrova's Theorems about first-order definability of given modal formulas and modal definability of given elementary conditions. We consider classes of frames for which modal definability is decidable and classes of frames for which first-order definability is trivial. We give a new proof of Chagrova's Theorem about modal definability and sketches of proofs of new variants of Chagrova's Theorem about modal definability.

引用

页码：214 / 236

页数：23

共 50 条

[1] Undecidable problems for modal definability
Balbiani, Philippe
Tinchev, Tinko
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2017, 27 (03) : 901 - 920
[2] FIRST-ORDER DEFINABILITY IN MODAL LOGIC
GOLDBLATT, RI
[J]. JOURNAL OF SYMBOLIC LOGIC, 1975, 40 (01) : 35 - 40
[3] First-Order Modal Logic: Frame Definability and a Lindstrom Theorem
Zoghifard, R.
Pourmahdian, M.
[J]. STUDIA LOGICA, 2018, 106 (04) : 699 - 720
[4] Modal definability of first-order formulas with free variables and query answering
Kikot, Stanislav
Zolin, Evgeny
[J]. JOURNAL OF APPLIED LOGIC, 2013, 11 (02) : 190 - 216
[5] First-Order Definability of Transition Structures
Antje Rumberg
Alberto Zanardo
[J]. Journal of Logic, Language and Information, 2019, 28 : 459 - 488
[6] First-Order Definability of Transition Structures
Rumberg, Antje
Zanardo, Alberto
[J]. JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2019, 28 (03) : 459 - 488
[7] First-Order Modal Logic: Frame Definability and a Lindström Theorem
R. Zoghifard
M. Pourmahdian
[J]. Studia Logica, 2018, 106 : 699 - 720
[8] The complexity of definability by open first-order formulas
Areces, Carlos
Campercholi, Miguel
Penazzi, Daniel
Ventura, Pablo
[J]. LOGIC JOURNAL OF THE IGPL, 2020, 28 (06) : 1093 - 1105
[9] Definability in first-order theories of graph orderings
Ramanujam, R.
Thinniyam, Ramanathan S.
[J]. JOURNAL OF LOGIC AND COMPUTATION, 2020, 30 (01) : 403 - 420
[10] Decidable and Undecidable Fragments of First-Order Concatenation Theory
Kristiansen, Lars
Murwanashyaka, Juvenal
[J]. SAILING ROUTES IN THE WORLD OF COMPUTATION, 2018, 10936 : 244 - 253

← 1 2 3 4 5 →