Emphasizes the computer science aspects of the subject. Details applications in databases, complexity theory, and formal languages, as well as other branches of computer science.Since |P = log n, such an element as exists for every S. C. P. Moreover, since BIT is definable, there is a definable (in FO(Cnt)) predicate Code(u, v) which is true iff v is of the form as for a set S, and u e S. The query Q will now be definable by aanbsp;...
Title | : | Elements of Finite Model Theory |
Author | : | Leonid Libkin |
Publisher | : | Springer Science & Business Media - 2013-03-09 |
You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.
Once you have finished the sign-up process, you will be redirected to your download Book page.
How it works: