Logical specifications of effectively separable data models

DOI10.3103/S1066369X24700397MaRDI QIDQ6638449

N. Kh. Kasymov

Publication date: 14 November 2024

Published in: Russian Mathematics (Search for Journal in Brave)

zbMATH Keywords

data modelspecificationeffectively separable many-sorted algebra

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx) Model theory (03Cxx) Algebraic structures (08Axx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Homomorphisms onto effectively separable algebras
• Definability of linear orders over negative equivalences
• Positive algebras with congruences of finite index
• Homomorphisms onto negative algebras
• Separation axioms and partitions of the set of natural numbers
• Enumerated algebras with uniformly recursive-separable classes
• Algebras over negative equivalences
• Randnomness, computability, and algebraic specifications
• Negative dense linear orders
• \(T_1\)-separable numberings of subdirectly indecomposable algebras
• Structures of degrees of negative representations of linear orders
• Positive algebras with countable congruence lattices
• \(\Pi^0_1\)-presentations of algebras
• Computability and universal determinability of negatively representable models
• 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
• Joins and meets in the structure of ceers
• Finitely presented expansions of groups, semigroups, and algebras
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS

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)