What reasonable first-order queries are permitted by Trakhtenbrot's theorem?
Graduate studies at Western
|Abstract||Around 1950, B.A. Trakhtenbrot proved an important undecidability result (known, by a pure accident, as \Trakhtenbrot's theorem"): there is no algorithm to decide, given a rst-order sentence, whether the sentence is satis able in some nite model. The result is in fact true even if we restrict ourselves to languages that has only one binary relation Tra63]. It is hardly conceivable that at that time Prof. Trakhtenbrot expected his result to in uence the development of the theory of relational databases query languages, but it did. This perhaps is not surprising in view of the following two facts: 1) The theory of relational databases is strongly rooted in logic and can easily be abstracted to make it a branch of mathematical logic. 2) The main interest in the theory of relational databases is in nite relations. In the rst section we explain those two points in more detail. Then, in section 2 of the present paper, we discuss the question: \What constitutes a reasonable query to a database?" The discussion naturally leads to a certain class of queries, known as the \domain independent" queries, as an ideal query language. At this point Trakhtenbrot's theorem appears as a major obstacle, since it easily implies that this ideal class is undecidable. Real query languages cannot be allowed to have this property. Section 3 outlines then several possible ways to circumvent this di culty. The following section explains the..|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|External links||This entry has no external links. Add one.|
|Through your library||Only published papers are available at libraries|
Similar books and articles
E. Fischer & J. A. Makowsky (2004). On Spectra of Sentences of Monadic Second Order Logic with Counting. Journal of Symbolic Logic 69 (3):617-640.
Jan Von Plato (2007). In the Shadows of the Löwenheim-Skolem Theorem: Early Combinatorial Analyses of Mathematical Proofs. Bulletin of Symbolic Logic 13 (2):189-225.
Rami Grossberg (1991). Indiscernible Sequences in a Model Which Fails to Have the Order Property. Journal of Symbolic Logic 56 (1):115-123.
Martin Otto (2000). Epsilon-Logic is More Expressive Than First-Order Logic Over Finite Structures. Journal of Symbolic Logic 65 (4):1749-1757.
Solomon Feferman (2008). Harmonious Logic: Craig's Interpolation Theorem and Its Descendants. Synthese 164 (3):341 - 357.
Catherine Lai & Steven Bird (2010). Querying Linguistic Trees. Journal of Logic, Language and Information 19 (1):53-73.
William I. Gasarch, Mark G. Pleszkoch & Robert Solovay (1992). Learning Via Queries in $\Lbrack +, < \Rbrack$. Journal of Symbolic Logic 57 (1):53 - 81.
Stephan Kepser (2004). Querying Linguistic Treebanks with Monadic Second-Order Logic in Linear Time. Journal of Logic, Language and Information 13 (4):457-470.
Added to index2009-04-13
Total downloads5 ( #170,270 of 739,404 )
Recent downloads (6 months)0
How can I increase my downloads?