A decidable Ehrenfeucht theory with exactly two hyperarithmetic models (Q810001): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q590477
Property / reviewed by
 
Property / reviewed by: J. M. Plotkin / rank
Normal rank
 

Revision as of 21:40, 19 February 2024

scientific article
Language Label Description Also known as
English
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
scientific article

    Statements

    A decidable Ehrenfeucht theory with exactly two hyperarithmetic models (English)
    0 references
    0 references
    1991
    0 references
    T is an Ehrenfeucht theory if it has finitely many countable models up to isomorphism and is not \(\omega\)-categorical. T is persistently Ehrenfeucht if for every n-type \(\Gamma\) (x) of T, the theory \(\Gamma\) (c) in the language of T with a new constant c added is Ehrenfeucht. This lengthy paper is devoted to a proof of the following theorem. For each \(n<\omega\) there is a complete, decidable, persistently Ehrenfeucht theory T having exactly five non-isomorphic countable models: three decidable models and two models decidable exactly in the hyperarithmetic set H(n). By a theorem of Millar this is the best that can be achieved if a decidable Ehrenfeucht theory has a countable model which is not \(0''\)- decidable. The T exhibited is a theory of trees which is inspired by earlier examples of Millar and Peretyat'kin.
    0 references
    Ehrenfeucht theory
    0 references
    countable models
    0 references
    persistently Ehrenfeucht
    0 references
    decidable models
    0 references
    hyperarithmetic set
    0 references
    theory of trees
    0 references

    Identifiers