Stability theory, permutations of indiscernibles, and embedded finite models

DOI10.1090/S0002-9947-00-02672-6zbMath0960.03027MaRDI QIDQ4505906

Michael Benedikt, John T. Baldwin

Publication date: 3 October 2000

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

stability theoryfirst-order sentenceembedded finite modelsgeneric querylocally order generic

Mathematics Subject Classification ID

Database theory (68P15) Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Interpolation, preservation, definability (03C40)

Related Items (20)

On inflationary fix-point operators safety ⋮ Adding linear orders ⋮ Dependent first order theories, continued ⋮ An Ehrenfeucht-Fraïssé game approach to collapse results in database theory ⋮ Supersimple structures with a dense independent subset ⋮ Quantifier rank for parity of embedded finite models. ⋮ The past and future of embedded finite model theory ⋮ Geometric structures with a dense independent subset ⋮ Externally definable sets and dependent pairs ⋮ On superstable expansions of free abelian groups ⋮ Pseudofinite homogeneity, isolation, and reducibility ⋮ Stable theories with a new predicate ⋮ Sufficient conditions for effective translation of locally generic queries ⋮ A general condition for collapse results ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ A.D. Taimanov and model theory in Kazakhstan ⋮ Local homogeneity ⋮ Externally definable sets and dependent pairs II ⋮ Type-amalgamation properties and polygroupoids in stable theories ⋮ Generic pairs of SU-rank 1 structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification theory over a predicate. I
• Measures and forking
• Model theory.
• Domain independence and the relational calculus
• First-order queries on databases embedded in an infinite structure
• Infinitary logic and inductive definability over finite structures
• On variants of \(o\)-minimality
• Stable theories with a new predicate
• Paires de structures stables
• Almost Everywhere Equivalence of Logics in Finite Model Theory
• Relational queries over interpreted structures
• Relational expressive power of constraint query languages
• Vapnik-Chervonenkis Classes of Definable Sets
• On the number of minimal models
• First-Order Queries on Finite Structures Over the Reals
• Definable types in -minimal theories
• Cohomology of Structures and Some Problems of Ahlbrandt and Ziegler
• On reduction properties
• Definability of types, and pairs of O-minimal structures
• Quasi-o-minimal structures
• Pseudo-finite homogeneity and saturation

This page was built for publication: Stability theory, permutations of indiscernibles, and embedded finite models