Categoricity and generalized model completeness (Q1098836): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: J. M. Plotkin / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: J. M. Plotkin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi finitely axiomatizable totally categorical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost strongly minimal theories. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order theories of abstract dependence relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Omitting types of prenex formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\aleph _ 0\)-categorical, \(\aleph _ 0\)-stable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Categoricity in Power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification theory and the number of non-isomorphic models / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01625828 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046909290 / rank
 
Normal rank

Latest revision as of 10:03, 30 July 2024

scientific article
Language Label Description Also known as
English
Categoricity and generalized model completeness
scientific article

    Statements

    Categoricity and generalized model completeness (English)
    0 references
    0 references
    0 references
    1988
    0 references
    The author proves that if T is \(\aleph_ 0\)-categorical and almost strongly minimal then T has a finite definitional extension which is model complete (T is said to be almost model complete). In addition such a T is axiomatizable by sentences of bounded quantifier complexity.
    0 references
    axiomatizability
    0 references
    sentences of bounded quantifier complexity
    0 references
    0 references

    Identifiers