Around classification theory of models (Q1088651)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Around classification theory of models
scientific article

    Statements

    Around classification theory of models (English)
    0 references
    0 references
    1986
    0 references
    The book under review presents new results in the following areas: (i) results extending classification theory in various directions, (ii) some applications of classification theory to Boolean algebras and general topology, (iii) set-theoretic investigations related to classification theory, and (iv) some unrelated results concerning groups, modules and finite models. As some of the results are quite technical or difficult to state without excessive repeating of the definitions, we shall concentrate on results that are more or less self-explaining and restrict ourselves to a brief outline in other cases. The book starts with an attempt to classify generalized quantifiers on infinite universes. Some positive results are obtained assuming the axiom of constructibility \(V=L\). It is, e.g., shown that any quantifier ranging over a family of n-place relations over a universe is bi-expressible with a quantifier ranging over a family of equivalence relations. Some independence results are also proved. Next, the classification theory over a predicate is continued and some weak structure theorems and non- structure results are proved under various set-theoretic assumptions. In some cases, the analysis is restricted to theories without two-cardinal models. Non-structure techniques are used to get endorigid Boolean algebras, i.e., Boolean algebras with only trivial endomorphisms that are definable from ultrafilters on them. It is shown in ZFC that for every uncountable cardinal \(\lambda\), there is an indecomposable Boolean algebra of density character \(\lambda\) and cardinality \(\lambda^{\aleph_ 0}\) satisfying the countable chain condition. Some other results concerning Boolean algebras and topological spaces are proved by set-theoretic methods. It is shown that the number id(B) of ideals on an arbitrary infinite Boolean algebra B satisfies \(id(B)=id(B)^{\aleph_ 0}\) and similar results are proved for the number of open sets in some topological spaces. Other cardinal functions, e.g. the spread, are also discussed. Non-structure results for infinitary languages show that for models M of singular cardinality, there is no nice dichotomy for the number no(M) of isomorphism types of models equivalent to M. Some new results on Hanf numbers of theories in monadic logic continue the classification developed by \textit{J. T. Baldwin} and \textit{S. Shelah} [Notre Dame J. Formal Logic 26, 229-303 (1985; Zbl 0596.03033)]. Other model-theoretic results concern countable first-order theories with model-homogeneous models only, prove the existence of a non-standard uniserial module over a uniserial domain and discuss the \(\kappa\)-freeness of Abelian groups. Set-theoretic investigations of stationary coding show, e.g., that under the weak continuum hypothesis (WCH) the ideal of non-stationary subsets of \(\omega_ 1\) is not \(\aleph_ 1\)-dense. W. S. Zwicker's analysis of stationary coding using the club filter on \(P_{\kappa}(\lambda^+)\) is continued.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    classification theory
    0 references
    Boolean algebras
    0 references
    modules
    0 references
    finite models
    0 references
    generalized quantifiers on infinite universes
    0 references
    independence results
    0 references
    topological spaces
    0 references
    cardinal functions
    0 references
    infinitary languages
    0 references
    Abelian groups
    0 references
    stationary coding
    0 references