A Decidable Ehrenfeucht Theory with Exactly Two Hyperarithmetic Models
暂无分享,去创建一个
Millar showed that for each n<ω, there is a complete decidable theory having precisely eighteen nonisomorphic countable models where some of these are decidable exactly in the hyperarithmetic set H(n). By combining ideas from Millar's proof with a technique of Peretyat'kin, the author reduces the number of countable models to five. By a theorem of Millar, this is the smallest number of countable models a decidable theory can have if some of the models are not 0″-decidable.
[1] Terrence Millar. Foundations of recursive model theory , 1978 .
[2] M. G. Peretyat'kin. On complete theories with a finite number of denumerable models , 1973 .
[3] Terrence Millar. Persistently finite theories with hyperarithmetic models , 1983 .
[4] Chen C. Chang,et al. Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .