A decidable Ehrenfeucht theory with exactly two hyperarithmetic models

DOI10.1016/0168-0072(91)90053-OzbMATH Open0733.03021MaRDI QIDQ810001FDOQ810001

Authors: Robert C. Reed 

Publication date: 1991

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

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

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)

Cites Work

• Model theory
• Foundations of recursive model theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Persistently Finite Theories with Hyperarithmetic Models
• On complete theories with a finite number of denumerable models

Cited In (9)

• Finite extensions and the number of countable models
• The complexity of countable categoricity in finite languages
• Autostability of prime models under strong constructivizations
• Recursive categoricity and persistence
• Model completions and omitting types
• Title not available (Why is that?)
• Arithmetical decidability of homogeneous and almost prime countable models of Ehrenfeucht theories with arithmetical types
• Title not available (Why is that?)
• Complexity of Ehrenfeucht models

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)