Extended order-generic queries

DOI10.1016/S0168-0072(98)00025-6zbMath0956.03035OpenAlexW2090832823MaRDI 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)

Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00025-6

zbMATH Keywords

relational databaseslocally generic queriesembedded finite modelsfinitely presented databasesfirst-order queriesquasi-o-minimality

Mathematics Subject Classification ID

Database theory (68P15) Model theory of finite structures (03C13) Models with special properties (saturated, rigid, etc.) (03C50) Interpolation, preservation, definability (03C40)

Related Items (10)

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

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

This page was built for publication: Extended order-generic queries