Computability of Distributive Lattices
Siberian Mathematical Journal(2018)
摘要
The class of (not necessarily distributive) countable lattices is HKSS-universal, and it is also known that the class of countable linear orders is not universal with respect to degree spectra neither to computable categoricity. We investigate the intermediate class of distributive lattices and construct a distributive lattice with degree spectrum { d : d ≠ 0}. It is not known whether a linear order with this property exists. We show that there is a computably categorical distributive lattice that is not relatively Δ 2 0 -categorical. It is well known that no linear order can have this property. The question of the universality of countable distributive lattices remains open.
更多查看译文
关键词
distributive lattice,computable structure,degree spectrum,computable categoricity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络