Derive a boolean first-order query, Mathematics

Assignment Help:

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


Related Discussions:- Derive a boolean first-order query

How does a child think-knowing your maths learner, HOW DOES A CHILD THINK? ...

HOW DOES A CHILD THINK? :  You must have interacted with children of various ages. From your experience, do you feel that children start learning, from a very early age, and conti

Probability of tossing a head with the dime, Q. Find Probability of tossing...

Q. Find Probability of tossing a head with the dime? List the sample space, and find n(S), for the outcomes of tossing a nickel followed by a dime. What is the probability of t

Describe order of operations with example, Describe Order of Operations wit...

Describe Order of Operations with example? The order of operations is a set of rules that describe the order in which math operations are done. Try doing this math problem:

Evaluate following. 0ln (1+)excos(1-ex)dx substitution, Evaluate following....

Evaluate following. ∫ 0 ln (1 + π )   e x cos(1-e x )dx Solution The limits are little unusual in this case, however that will happen sometimes therefore don't get

Prove that a tree with n vertices has n - 1 edges, Prove that A tree with n...

Prove that A tree with n vertices has (n - 1) edges.    Ans: From the definition of a tree a root comprise indegree zero and all other nodes comprise indegree one. There should

Hieght and distances, A boy standing in the middle of a field, observes a f...

A boy standing in the middle of a field, observes a flying bird in the north at an angle of elevation fo 30 degree. and after 2 min, he observes the same bird in the south at an an

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd