Recommendations
Cites work
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 1114329 (Why is no real title available?)
- scientific article; zbMATH DE number 1479611 (Why is no real title available?)
- scientific article; zbMATH DE number 3382339 (Why is no real title available?)
- Classification theory and the number of non-isomorphic models.
- Computable queries for relational data bases
- Definability and decision problems in arithmetic
- Definable Sets in Ordered Structures. I
- Definable Sets in Ordered Structures. II
- Definable Sets in Ordered Structures. III
- Finitely representable databases
- First-order queries on databases embedded in an infinite structure
- Model theory.
- The comparison of the expressive power of first-order dynamic logics
- Ultrahomogeneous Structures
Cited in
(14)- Sufficient conditions for effective translation of locally generic queries
- Aggregate operators in constraint query languages
- Coset-minimal groups
- A general condition for collapse results
- In memoriam: Mikhail A. Taitslin, 1936--2013
- The past and future of embedded finite model theory
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture
- Pseudofinite homogeneity, isolation, and reducibility
- Metafinite model theory
- Invariance to ordinal transformations in rank-aware databases
- Query Order
- On o-Stable Expansions of $$\boldsymbol{(\mathbb{Z},<,+)}$$
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Stability theory, permutations of indiscernibles, and embedded finite models
This page was built for publication: Extended order-generic queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1302301)
