Classification theory for a 1-ary function
The paper contains a stability theoretic analysis of complete first order theories over a language with a single 1-ary function. First it is shown that these theories are superstable, and non-algebraic 1-types over models are regular and have U-rank \(\leq \omega\). Then orthogonality of types and depth are examined. These results are used to study which theories are classifiable in Shelah's sense. The main theorem states that every theory of a 1-ary function is presentable and satisfies the existence property, hence shallowness is sufficient to guarantee classifiability. The paper finishes with a complete characterization of which theories are non-multidimensional, unidimensional and categorical. A second paper ``1-ary function and the f.c.p. will contain a full classification of theories satisfying the finite cover property. An alternative approach to this matter can be found in \textit{A. N. Ryaskin}'s paper in Tr. Inst. Mat. 8, 162-182 (1988; Zbl 0675.03022).
- A further glance at classifiable 1-ary functions
- Lascar rank and the finite cover property for complete theories of unars
- Countable models of trivial theories which admit finite coding
- Lattice of algebraically closed sets in one-based theories
- scientific article; zbMATH DE number 238507 (Why is no real title available?)
- 1-ary functions and the f.c.p
This page was built for publication: Classification theory for a 1-ary function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910399)
