Effective categoricity for distributive lattices and Heyting algebras
From MaRDI portal
Publication:2404797
DOI10.1134/S1995080217040035zbMath1420.03070OpenAlexW2734362451MaRDI QIDQ2404797
Publication date: 20 September 2017
Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1995080217040035
distributive latticeHeyting algebracategoricity spectrumdegree of categoricitycomputable dimensioncomputable categoricity
Heyting algebras (lattice-theoretic aspects) (06D20) Structure and representation theory of distributive lattices (06D05) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items
Computable Heyting algebras with distinguished atoms and coatoms ⋮ Computable bi-embeddable categoricity ⋮ Computability of distributive lattices ⋮ Categoricity spectra of computable structures ⋮ Degree spectra of structures ⋮ Degrees of bi-embeddable categoricity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categoricity spectra for polymodal algebras
- Computable isomorphisms of Boolean algebras with operators
- Pairs of recursive structures
- Computable single-valued numerations
- Stability of recursive structures in arithmetical degrees
- Algorithmic complexity of algebraic systems
- Generic copies of countable structures
- Problem of the number of non-self-equivalent constructivizations
- Computable structures and the hyperarithmetical hierarchy
- Degree spectra and computable dimensions in algebraic structures
- Degrees of categoricity and the hyperarithmetic hierarchy
- Autostability spectra for Boolean algebras
- Degrees of autostability for linear orders and linearly ordered abelian groups
- Degrees of autostability relative to strong constructivizations
- Enumerations in computable structure theory
- Degrees of categoricity of computable structures
- RELATIVE TO ANY NON-HYPERARITHMETIC SET
- Lattice Theory: Foundation
- Prime Model with No Degree of Autostability Relative to Strong Constructivizations
- d-computable categoricity for algebraic fields
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS
- Computable categoricity for algebraic fields with splitting algorithms
- ∏ 0 1 Classes and Degrees of Theories
- Effective model theory vs. recursive model theory
- Categoricity spectra for rigid structures
- The theory of projective planes is complete with respect to degree spectra and effective dimensions
- Effective categoricity of computable linear orderings
