Enumerated algebras with uniformly recursive-separable classes

DOI10.1007/BF00971403zbMath0813.03030MaRDI QIDQ1335938

N. Kh. Kasymov

Publication date: 8 November 1994

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

zbMATH Keywords

equivalence relationsabstract data typesconstructive modelsrecursive separationenumerated algebras

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (7)

Computably separable models ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Computability and universal determinability of negatively representable models ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Structures of degrees of negative representations of linear orders

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerated algebras with uniformly recursive-separable classes