Computability of distributive lattices

DOI10.1134/S0037446617060052zbMath1469.03121OpenAlexW2793604464MaRDI QIDQ1745078

Xianqiang Yang

Publication date: 20 April 2018

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446617060052

zbMATH Keywords

distributive latticecomputable structurecomputable categoricitydegree spectrum

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (4)

A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ Spectral universality of linear orders with one binary relation ⋮ Degree spectra of structures ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithmic complexity of algebraic systems
• Autostability of models
• Degree spectra and computable dimensions in algebraic structures
• New degree spectra of abelian groups
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Effective categoricity for distributive lattices and Heyting algebras
• Computable Boolean algebras
• The -spectrum of a linear order
• Spectra of highn and non-lown degrees
• Equivalence Relations on Classes of Computable Structures
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Degrees coded in jumps of orderings
• Recursively Categorical Linear Orderings
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degrees of Structures
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
• Effective categoricity of computable linear orderings

This page was built for publication: Computability of distributive lattices