Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T07:36:49.901Z Has data issue: false hasContentIssue false

Decidability of Definability

Published online by Cambridge University Press:  12 March 2014

Manuel Bodirsky
Affiliation:
Laboratoire d'Informatique (LIX), CNRS UMR 7161, École Polytechnique, 91128 Palaiseau, France, E-mail: bodirsky@lix.polytechnique.fr, URL: http://www.lix.polytechnique.fr/~bodirsky/
Michael Pinsker
Affiliation:
Équipe de Logique Mathématique, Université Diderot, —Paris 7, UFR de Mathématiques, 75205 Paris Cedex 13, France, E-mail: marula@gmx.at, URL: http://dmg.tuwien.ac.at/pinsker/
Todor Tsankov
Affiliation:
Équipe de Logique Mathématique, Université Diderot, —Paris 7, UFR de Mathématiques, 75205 Paris Cedex 13, France, E-mail: todor@math.jussieu.fr, URL: http://people.math.jussieu.fr/~todor/

Abstract

For a fixed countably infinite structure Γ with finite relational signature τ, we study the following computational problem: input are quantifier-free τ-formulas ϕ 0, ϕ 1, …, ϕ n that define relations R 0, R 1, …, Rn over Γ. The question is whether the relation R 0 is primitive positive definable from R 1, …, Rn , i.e., definable by a first-order formula that uses only relation symbols for R 1, …, Rn , equality, conjunctions, and existential quantification (disjunction, negation, and universal quantification are forbidden).

We show decidability of this problem for all structures Γ that have a first-order definition in an ordered homogeneous structure Δ with a finite relational signature whose age is a Ramsey class and determined by finitely many forbidden substructures. Examples of structures Γ with this property are the order of the rationals, 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable