On the Relationship Between the Complexity of Decidability and Decomposability of First-Order Theories

被引：0

作者：

D. Ponomaryov

机构：

[1] Ershov Institute of Informatics Systems,

[2] Novosibirsk State University,undefined

来源：

Lobachevskii Journal of Mathematics | 2021年 / 42卷

关键词：

decomposition; decidability; computational complexity;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：2905 / 2912

页数：7

共 50 条

[31] Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers
Franek, Peter
Ratschan, Stefan
Zgliczynski, Piotr
JOURNAL OF AUTOMATED REASONING, 2016, 57 (02) : 157 - 185
[32] PETRI NET REACHABILITY GRAPHS: DECIDABILITY STATUS OF FIRST-ORDER PROPERTIES
Darondeau, Philippe
Demri, Stephane
Meyer, Roland
Morvan, Christophe
LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (04)
[33] The decidability of the first-order theory of the Knuth-Bendix order in the case of unary signatures
Korovin, K
Voronkov, A
FST TCS 2002: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEOETICAL COMPUTER SCIENCE, PROCEEDINGS, 2002, 2556 : 230 - 240
[34] Compact Propositional Encodings of First-Order Theories
Ramachandran, Deepak
Amir, Eyal
19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 1579 - 1580
[35] Interpreting first-order theories into a logic of records
Van De Vel M.
Studia Logica, 2002, 72 (3) : 411 - 432
[36] UNDECIDABLE FIRST-ORDER THEORIES OF AFFINE GEOMETRIES
Kuusisto, Antti
Meyers, Jeremy
Virtema, Jonni
LOGICAL METHODS IN COMPUTER SCIENCE, 2013, 9 (04)
[37] Pairs, sets and sequences in first-order theories
Visser, Albert
ARCHIVE FOR MATHEMATICAL LOGIC, 2008, 47 (04) : 299 - 326
[38] Adding metatheoretic facilities to first-order theories
Basin, D
Matthews, S
JOURNAL OF LOGIC AND COMPUTATION, 1996, 6 (06) : 835 - 849
[39] Jurisprudential Theories and First-Order Legal Judgments
Toh, Kevin
PHILOSOPHY COMPASS, 2013, 8 (05): : 457 - 471
[40] Probabilistic characterisation of models of first-order theories
Rad, Soroush Rafiee
ANNALS OF PURE AND APPLIED LOGIC, 2021, 172 (01)

← 1 2 3 4 5 →