DECIDABILITY OF DEFINABILITY

被引:36
作者
Bodirsky, Manuel [1 ]
Pinsker, Michael [2 ]
Tsankov, Todor [2 ]
机构
[1] Ecole Polytech, CNRS UMR 7161, Lab Informat LIX, F-91128 Palaiseau, France
[2] Univ Paris 07, UFR Math, Equipe Log Math, F-75205 Paris 13, France
基金
欧洲研究理事会;
关键词
CONSTRAINT SATISFACTION; REDUCTS;
D O I
10.2178/jsl.7804020
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
For a fixed countably infinite structure Gamma with finite relational signature tau, we study the following computational problem: input are quantifier-free tau-formulas phi(0), phi(1), phi(n) that define relations R-0, R-1,...,R-n,, over Gamma. The question is whether the relation R-0 is primitive positive definable from R-1,,, R-n, i.e., definable by a first-order formula that uses only relation symbols for R-1,..., R-n, equality, conjunctions, and existential quantification (disjunction, negation, and universal quantification are forbidden). We show decidability of this problem for all structures Gamma that have a first-order definition in an ordered homogeneous structure Delta with a finite relational signature whose age is a Ramsey class and determined by finitely many forbidden substructures. Examples of structures Gamma with this property are the order of the rationale, the random graph, the homogeneous universal poset, the random tournament, all homogeneous universal C-relations, and many more. We also obtain decidability of the problem when we replace primitive positive definability by existential positive, or existential definability, Our proof makes use of universal algebraic and model theoretic concepts. Ramsey theory, and a recent characterization of Ramsey classes in topological dynamics.
引用
收藏
页码:1036 / 1054
页数:19
相关论文
共 23 条
[1]  
Adeleke Samson Adepoju, 1998, RELATIONS RELATED BE, V131
[2]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[3]  
Bodirsky M., 2010, PREPRINT
[4]  
Bodirsky M., ISRAEL J MA IN PRESS
[5]   Constraint satisfaction with countable homogeneous templates [J].
Bodirsky, Manuel ;
Nesetril, Jaroslav .
JOURNAL OF LOGIC AND COMPUTATION, 2006, 16 (03) :359-373
[6]   Data log and constraint satisfaction with infinite templates [J].
Bodirsky, Manuel ;
Dalmau, Victor .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2013, 79 (01) :79-100
[7]  
Bodirsky M, 2011, CONTEMP MATH, V558, P489
[8]   THE REDUCTS OF EQUALITY UP TO PRIMITIVE POSITIVE INTERDEFINABILITY [J].
Bodirsky, Manuel ;
Chen, Hubie ;
Pinsker, Michael .
JOURNAL OF SYMBOLIC LOGIC, 2010, 75 (04) :1249-1292
[9]   The Complexity of Temporal Constraint Satisfaction Problems [J].
Bodirsky, Manuel ;
Kara, Jan .
JOURNAL OF THE ACM, 2010, 57 (02)
[10]   Relation algebras and their application in temporal and spatial reasoning [J].
Düntsch, I .
ARTIFICIAL INTELLIGENCE REVIEW, 2005, 23 (04) :315-357