Derive a boolean first-order query, Mathematics

Consider a database whose universe is a finite set of vertices V and whose unique relation .E is binary and encodes the edges of an undirected (resp., directed) graph G: (V, E). Each undirected edge between the nodes o and u (resp., directed edge from the node v to the node u) is encoded by the two atoms E (v, u) and E (u, v) (resp., by the single atom E (v, u)).

Consider the pairs of stucture (undirected (resp., directed) graphs) shown in Fig. 1. Suppose that the graphs are encoded in a database as explained above. For each pair, answer the following questions:

1. What is the smallest quantifier rank k for which the spoiler wins the k-move Ehrenfeucht-Fraisse game on the pair of structure?

2. Derive a Boolean first-order query from your winning strategy that is true on one structure but not on the other (you can use the equality relation between vertices).

2382_Derive a Boolean First-Order Query.png

Posted Date: 3/1/2013 12:29:43 AM | Location : United States







Related Discussions:- Derive a boolean first-order query, Assignment Help, Ask Question on Derive a boolean first-order query, Get Answer, Expert's Help, Derive a boolean first-order query Discussions

Write discussion on Derive a boolean first-order query
Your posts are moderated
Related Questions
what is actual error and how do you find percentage error

A screening test for a newly discovered disease is being evaluated. In order to determine the effectiveness of the new test, it was administered to 900 workers; 150 of the individu



Describe Common Phrases to Represent Math Operations? The table below shows the common phrases used in word problems to represent addition, subtraction, multiplication, and div



I need to follow the pattern .125,.25,.375,.5, ?

what are the core concept of marketing