Add to ORKGThe Grätzer-Schmidt theorem of lattice theory states that each al-gebraic lattice is isomorphic to the congruence lattice of an algebra. A lattice is algebraic if it is complete and generated by its compact elements. We show that the set of indices of computable lattices that are complete is Π11-complete; the set of indices of computable lattices that are algebraic is Π11-complete; and that there is a computable lattice L such that the set of compact elements of L is Π11-complete. As a corollary, there is a computable algebraic lattice that is not computably isomorphic to any computable congruence lattice
Abstract. Computably enumerable algebras are the ones whose positive atomic di-agrams are computably...
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
Abstract. We give a new characterization of lattices with relative Stone congruence lattices and we ...
Abstract. The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomo...
Ph.D. University of Hawaii at Manoa 2014.Includes bibliographical references.We analyze computable a...
As everyone knows, one popular notion of Scott domain is defined as a bounded complete algebraic cpo...
International audienceThe Congruence Lattice Problem asks whether every algebraic distributive latti...
I prove a characterization theorem for algebraic bounded complete cpos similar to that for algebraic...
Two special types of algebraic (or compactly generated) lattices -- called A1- and A2-lattice -- are...
© Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic c...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
AbstractIn 1983, Wille raised the question: Is every complete lattice L isomorphic to the lattice of...
We study complexity of isomorphisms between computable copies of lattices and Heyting algebras. For...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We prove that every distributive algebraic lattice with at most $\aleph_1$ compact elements is isomo...
Abstract. Computably enumerable algebras are the ones whose positive atomic di-agrams are computably...
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
Abstract. We give a new characterization of lattices with relative Stone congruence lattices and we ...
Abstract. The Grätzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomo...
Ph.D. University of Hawaii at Manoa 2014.Includes bibliographical references.We analyze computable a...
As everyone knows, one popular notion of Scott domain is defined as a bounded complete algebraic cpo...
International audienceThe Congruence Lattice Problem asks whether every algebraic distributive latti...
I prove a characterization theorem for algebraic bounded complete cpos similar to that for algebraic...
Two special types of algebraic (or compactly generated) lattices -- called A1- and A2-lattice -- are...
© Springer Nature Switzerland AG 2019. A standard tool for the classifying computability-theoretic c...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
AbstractIn 1983, Wille raised the question: Is every complete lattice L isomorphic to the lattice of...
We study complexity of isomorphisms between computable copies of lattices and Heyting algebras. For...
Abstract. We survey the current status of an old open question in classical computability theory: Wh...
We prove that every distributive algebraic lattice with at most $\aleph_1$ compact elements is isomo...
Abstract. Computably enumerable algebras are the ones whose positive atomic di-agrams are computably...
Distributive lattices are studied from the viewpoint of effective algebra. In particular, we also co...
Abstract. We give a new characterization of lattices with relative Stone congruence lattices and we ...