Logical specifications of effectively separable data models
From MaRDI portal
Cites work
- ^0_1-presentations of algebras
- \(T_1\)-separable numberings of subdirectly indecomposable algebras
- Algebras over negative equivalences
- Computability and universal determinability of negatively representable models
- Definability of linear orders over negative equivalences
- Enumerated algebras with uniformly recursive-separable classes
- Finitely presented expansions of groups, semigroups, and algebras
- Homomorphisms onto effectively separable algebras
- Homomorphisms onto negative algebras
- scientific article; zbMATH DE number 4079406 (Why is no real title available?)
- scientific article; zbMATH DE number 3655327 (Why is no real title available?)
- scientific article; zbMATH DE number 1390542 (Why is no real title available?)
- scientific article; zbMATH DE number 3353345 (Why is no real title available?)
- Joins and meets in the structure of ceers
- Negative dense linear orders
- ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
- Positive algebras with congruences of finite index
- Positive algebras with countable congruence lattices
- Randnomness, computability, and algebraic specifications
- Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Translated from the English. Translation edited and with a preface by M. M. Arslanov.
- Recursively separable enumerated algebras
- Separation axioms and partitions of the set of natural numbers
- Structures of degrees of negative representations of linear orders
This page was built for publication: Logical specifications of effectively separable data models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6638449)
