A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

DOI10.1016/0168-0072(91)90053-OzbMath0733.03021MaRDI QIDQ810001

Robert C. Reed

Publication date: 1991

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

zbMATH Keywords

countable modelsEhrenfeucht theorydecidable 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)

Related Items (5)

Model completions and omitting types ⋮ Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types ⋮ Autostability of prime models under strong constructivizations ⋮ Complexity of Ehrenfeucht models ⋮ The complexity of countable categoricity in finite languages

Cites Work

• Unnamed Item
• Unnamed Item
• On complete theories with a finite number of denumerable models
• Model theory
• Persistently Finite Theories with Hyperarithmetic Models
• Foundations of recursive model theory

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