Types and indiscernibles in finite models
To analyze the expressive power of first-order logic from the point of view of finite model theory, we need equivalence relations that are coarser than the relation of elementary equivalence. A way is to restrict the number of variables used in formulas of first-order logic by \(k\), the obtained logic is called a finite variable logic and is denoted by \(L^{k}\). The study of classes of finite structures axiomatizable with finitely many variables has importance through connections with computational complexity. The relationship between the size of a finite structure and the number of distinct types it realizes (with respect to \(L^{k}\)) is considered. Some open questions, formulated as finitary Löwenheim-Skolem properties, are presented regarding this relationship. This is also discussed through finitary versions of sets of indiscernibles and of the Ehrenfeucht-Mostowski property. For the entire collection see [Zbl 0884.00035].
- Ultrafilters and types on models of arithmetic
- \(\Sigma\)-predicates of finite types over an admissible set
- There is no recursive link between the k-size of a model and its cardinality
- On stability in finite models
- Large finite structures with few \(L^k\)-types
- On existence of limit models over sequences of types
- On uniform definability of types over finite sets
- How many first-order variables are needed on finite ordered structures?
- Krull dimension of types in a class of first-order theories
- On bounded theories
- Modular types in some supersimple theories
- Coherent and Strongly Discrete Rings in Type Theory
- Disjoint sums over type classes in HOL
- Theories with few non-algebraic types over models, and their decompositions
- On the ubiquity of certain total type structures
This page was built for publication: Types and indiscernibles in finite models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4381409)