A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Decidability of Definability

2011
*
2011 IEEE 26th Annual Symposium on Logic in Computer Science
*

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,

doi:10.1109/lics.2011.11
dblp:conf/lics/BodirskyPT11
fatcat:xob3ubxjqzd5tfaqdm7qukstze