Stability theory, permutations of indiscernibles, and embedded finite models

DOI10.1090/S0002-9947-00-02672-6MaRDI QIDQ4505906zbMATH OpenFDO

Authors John T. Baldwin, Michael Benedikt

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

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

Recommendations

• Publication:4936135
• First-order queries on databases embedded in an infinite structure
• Extended order-generic queries
• Stable generic structures
• Finite variable logic stability and finite models

Cites work

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

Cited in

(25)

• Adding linear orders
• Enriching a predicate and tame expansions of the integers
• scientific article; zbMATH DE number 4068845 (Why is no real title available?)
• On inflationary fix-point operators safety
• Local homogeneity
• Quantifier rank for parity of embedded finite models.
• On superstable expansions of free abelian groups
• Absolute indiscernibility
• Generic pairs of SU-rank 1 structures
• Supersimple structures with a dense independent subset
• Sufficient conditions for effective translation of locally generic queries
• Stable theories with a new predicate
• scientific article; zbMATH DE number 1392296 (Why is no real title available?)
• 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
• 2004 Summer Meeting of the Association for Symbolic Logic
• A note on orthogonality and stable embeddedness
• An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
• A.D. Taimanov and model theory in Kazakhstan
• Type-amalgamation properties and polygroupoids in stable theories
• Externally definable sets and dependent pairs. II

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)