The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Decidability of definability
[article]

2012
*
arXiv
*
pre-print

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

arXiv:1012.2381v4
fatcat:gfgrj2mcdzbbzhsrwtsq4am34m