Computability of Distributive Lattices

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 cons...

Full description

Saved in:
Bibliographic Details
Published in:Siberian mathematical journal 2017-11, Vol.58 (6), p.959-970
Main Authors: Bazhenov, N. A., Frolov, A. N., Kalimullin, I. Sh, Melnikov, A. G.
Format: Article
Language:English
Subjects:
Lattices
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0037-4466
1573-9260
DOI:10.1134/S0037446617060052