Recursively separable enumerated algebras
N. Kh. Kasymov · Russian Mathematical Surveys · 1996
Contents Preface §1. Introduction 1.1. Equivalences 1.2. Enumerated algebras 1.3. Specification of abstract data structures §2. Negative approximations 2.1. Criteria of recursive separability 2.2. Finitely generated algebras 2.3. Negative algebras §3. Topological aspects 3.1. Recursively separable enumerations 3.2. Separable enumerations §4. Uniformity 4.1. Equivalences 4.2. Algebras §5. Specifications 5.1. Algebraic specifications 5.2. Universal specifications 5.3. Recursive congruences §6. Positive algebras with countable congruence lattices 6.1. Noetherian case 6.2. General case §7. Some questions Bibliography