Classification theory over a predicate. I (Q1083445): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1305/ndjfl/1093870929 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081511772 / rank
 
Normal rank

Revision as of 23:58, 19 March 2024

scientific article
Language Label Description Also known as
English
Classification theory over a predicate. I
scientific article

    Statements

    Classification theory over a predicate. I (English)
    0 references
    0 references
    0 references
    1985
    0 references
    If T is a complete first-order theory and P a unary predicate in its language, the authors study the structre and number of models M of T over the substructure \(M^ P\) of M determined by the universe \(P^ M\). It is shown that, given N, those models of T with \(M^ P=N\) can be coded to some extent by L'-reducts of expansions of N to a certain theory T'', where \(L(T)\subseteq L'\subseteq L(T'')\). The number of such reducts is estimated. This generalizes the context of the Chang-Makkai theorem. It is shown that if for some N of power \(\Lambda\), the number of non-N- isomorphic models M of T, with \(M^ P=N\), \(| M| =\Lambda\) is not too big, then the set of types \(tp(\bar a/P^ M)\) is definable over \(P^ M\) for every model M of T and every \(\bar a\in M\). Assuming the above definability condition and \(T=T''\) some non-structure theorems are proved.
    0 references
    non-structure theorems
    0 references

    Identifiers