Author:
Khoussainov Bakhadyr,Montalbán Antonio
Abstract
AbstractWe construct a computable ℵ0-categorical structure whose first order theory is computably equivalent to the true first order theory of arithmetic.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. A decidable $ℵ_0$-categorical theory with a non-recursive Ryll-Nardzewski function
2. Decidable models
3. Constructivizable models of undecidable theories;Kudaibergenov;Sibirskiĭ Matematicheskiĭ Zhurnal,1980
4. Computable models of theories with few models;Khoussainov;Notre Dame Journal of Formal Logic,1997
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献