Extended order-generic queries

DOI10.1016/S0168-0072(98)00025-6zbMath0956.03035MaRDI QIDQ1302301

Michael A. Taitslin, Oleg V. Belegradek, Alexei P. Stolboushkin

Publication date: 13 March 2001

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

relational databases; locally generic queries; embedded finite models; finitely presented databases; first-order queries; quasi-o-minimality

Mathematics Subject Classification ID

68P15: Database theory

03C13: Model theory of finite structures

03C50: Models with special properties (saturated, rigid, etc.)

03C40: Interpolation, preservation, definability

Related Items

A general condition for collapse results, Sufficient conditions for effective translation of locally generic queries, Aggregate operators in constraint query languages, An Ehrenfeucht-Fraïssé game approach to collapse results in database theory, Metafinite model theory, Coset-minimal groups, First-order expressibility of languages with neutral letters or: The Crane Beach conjecture, Pseudofinite homogeneity, isolation, and reducibility

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The comparison of the expressive power of first-order dynamic logics
• Computable queries for relational data bases
• Classification theory and the number of non-isomorphic models.
• Model theory.
• First-order queries on databases embedded in an infinite structure
• Finitely representable databases
• Definable Sets in Ordered Structures. III
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Ultrahomogeneous Structures
• Definability and decision problems in arithmetic