A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

DOI10.1016/0168-0072(91)90053-OMaRDI QIDQ810001zbMATH OpenFDO

Authors Robert C. Reed

Publication date 1991

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

Ehrenfeucht theorycountable modelsdecidable modelshyperarithmetic setpersistently Ehrenfeuchttheory of trees

Mathematics Subject Classification ID

Trees (05C05) Decidability of theories and sets of sentences (03B25) Model theory of denumerable and separable structures (03C15)

Recommendations

• scientific article; zbMATH DE number 3914293
• A new spectrum of computable models
• Finite extensions and the number of countable models
• Model complete theories of trees
• Spectra of computable models for Ehrenfeucht theories

Cites work

• scientific article; zbMATH DE number 3914293 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Foundations of recursive model theory
• Model theory
• On complete theories with a finite number of denumerable models
• Persistently Finite Theories with Hyperarithmetic Models

Cited in

(9)

• scientific article; zbMATH DE number 3914293 (Why is no real title available?)
• Autostability of prime models under strong constructivizations
• scientific article; zbMATH DE number 4164815 (Why is no real title available?)
• Model completions and omitting types
• The complexity of countable categoricity in finite languages
• Recursive categoricity and persistence
• Complexity of Ehrenfeucht models
• Finite extensions and the number of countable models
• Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types

This page was built for publication: A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810001)