搜索结果: 1-1 共查到“数学 computability-theoretic”相关记录1条 . 查询时间(0.031 秒)
On the computability-theoretic complexity of trivial, strongly minimal models
computability-theoretic strongly minimal models
2015/9/28
We show the existence of a trivial, strongly minimal (and thus
uncountably categorical) theory for which the prime model is computable and
each of the other countable models computes 0
00. This res...
