Uniformly computably separable algebras with effectively splittable families of negative congruences
From MaRDI portal
Publication:2671977
DOI10.1134/S0037446622030077MaRDI QIDQ2671977
N. Kh. Kasymov, I. A. Khodzhamuratova, R. N. Dadazhanov
Publication date: 8 June 2022
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
uniformityenumerated algebras and morphismscomputably separable enumerationseffective splittingsemiproductivity
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Definability of linear orders over negative equivalences
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Algebras with finitely approximable positively representable enrichments
- Positive algebras with congruences of finite index
- Positive algebras with Noetherian congruence lattices
- The number of algebras over simple sets
- Homomorphisms onto negative algebras
- The number of \(Q\)-congruences in positive algebras
- Enumerated algebras with uniformly recursive-separable classes
- Algebras over negative equivalences
- A journey to computably enumerable structures (tutorial lectures)
- Jumps of computably enumerable equivalence relations
- Structures of degrees of negative representations of linear orders
- Graphs realised by r.e. equivalence relations
- Positive algebras with countable congruence lattices
- Recursively separable enumerated algebras
- The first-order theory of the computably enumerable equivalence relations in the uncountable setting
- ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
- Joins and meets in the structure of ceers
- CONSTRUCTIVE ALGEBRAS I
- Finitely presented expansions of groups, semigroups, and algebras
This page was built for publication: Uniformly computably separable algebras with effectively splittable families of negative congruences
