Recursively separable enumerated algebras
From MaRDI portal
Recommendations
Cited in
(21)- Enumerated algebras with uniformly recursive-separable classes
- Negative dense linear orders
- Separable enumerations of division rings and effective embeddability of rings therein
- \(T_1\)-separable numberings of subdirectly indecomposable algebras
- Structures of degrees of negative representations of linear orders
- Computably separable models
- Topological spaces over algorithmic representations of universal algebras
- Intrinsically recursively enumerable subalgebras of a recursive Boolean algebra
- Uniform \(m\)-equivalencies and numberings of classical systems
- Uniformly computably separable algebras with effectively splittable families of negative congruences
- Computability and universal determinability of negatively representable models
- Mechanised Separation Algebra
- Homomorphisms onto effectively separable algebras
- Definability of linear orders over negative equivalences
- On Some Problems Related to Enumerated Types of Algebras
- Lower semilattices of separable congruences of numbered algebras
- Separable algorithmic representations of classical systems and their applications
- Logical specifications of effectively separable data models
- Finite logical specifications of effectively separable data models
- Unoids with finiteness conditions over computably separable equivalences
- Defining algorithmically presented structures in first order logic
This page was built for publication: Recursively separable enumerated algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4341931)
