Stability theory, permutations of indiscernibles, and embedded finite models
From MaRDI portal
Publication:4505906
DOI10.1090/S0002-9947-00-02672-6zbMATH Open0960.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)
Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Database theory (68P15) Interpolation, preservation, definability (03C40)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model theory.
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Definable types in -minimal theories
- Quasi-o-minimal structures
- Vapnik-Chervonenkis Classes of Definable Sets
- On variants of \(o\)-minimality
- Relational queries over interpreted structures
- Definability of types, and pairs of O-minimal structures
- Domain independence and the relational calculus
- Cohomology of Structures and Some Problems of Ahlbrandt and Ziegler
- Paires de structures stables
- Infinitary logic and inductive definability over finite structures
- Measures and forking
- Relational expressive power of constraint query languages
- First-Order Queries on Finite Structures Over the Reals
- Classification theory over a predicate. I
- First-order queries on databases embedded in an infinite structure
- Pseudo-finite homogeneity and saturation
- Stable theories with a new predicate
- On the number of minimal models
- On reduction properties
Cited In (21)
- Title not available (Why is that?)
- On inflationary fix-point operators safety
- Local homogeneity
- Quantifier rank for parity of embedded finite models.
- On superstable expansions of free abelian groups
- Generic pairs of SU-rank 1 structures
- Supersimple structures with a dense independent subset
- Stable theories with a new predicate
- Sufficient conditions for effective translation of locally generic queries
- A general condition for collapse results
- Externally definable sets and dependent pairs
- Dependent first order theories, continued
- The past and future of embedded finite model theory
- Geometric structures with a dense independent subset
- Pseudofinite homogeneity, isolation, and reducibility
- Externally definable sets and dependent pairs II
- 2004 Summer Meeting of the Association for Symbolic Logic
- A.D. Taimanov and model theory in Kazakhstan
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
- Type-amalgamation properties and polygroupoids in stable theories
- Adding linear orders
This page was built for publication: Stability theory, permutations of indiscernibles, and embedded finite models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4505906)
