Computability of distributive lattices
From MaRDI portal
Recommendations
- Effective categoricity for distributive lattices and Heyting algebras
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
- Embedding distributive lattices in the \(\Sigma ^0_2\) enumeration degrees
- scientific article; zbMATH DE number 1202105
- Embedding finite lattices into the computably enumerable degrees -- a status survey
Cites work
- scientific article; zbMATH DE number 1303201 (Why is no real title available?)
- scientific article; zbMATH DE number 1873435 (Why is no real title available?)
- Algorithmic complexity of algebraic systems
- Autostability of models
- Computability theoretic classifications for classes of structures
- Computable Boolean algebras
- Computable functors and effective interpretability
- Degree spectra and computable dimensions in algebraic structures
- Degrees coded in jumps of orderings
- Degrees of Structures
- Effective categoricity for distributive lattices and Heyting algebras
- Effective categoricity of computable linear orderings
- Enumerations, countable structures and Turing degrees
- Equivalence Relations on Classes of Computable Structures
- New degree spectra of abelian groups
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Recursively Categorical Linear Orderings
- Relative to any nonrecursive set
- Spectra of high\(_n\) and non-low\(_n\) degrees
- The \(\Delta_2^0\)-spectrum of a linear order
- \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
Cited in
(4)
This page was built for publication: Computability of distributive lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1745078)
