definability_problem (260B)
1 # Definability problem 2 3 For a [query_class] C, given a [database] D and set of [query_answers] a, decide if there is a [query] Q in C such that Q(D) = a 4 5 See also: [synthetic_witness], [Logical_separability] 6 7 Up: [database_theory] 8 9 Aliases: query definability