Finite logical specifications of effectively separable data models

DOI10.3103/S1066369X25700586MaRDI QIDQ6873611zbMATH OpenFDO

Authors N. Kh. Kasymov, Sarvar Kurbonmiratovich Zhavliev

Publication date 16 January 2026

Published in Russian Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/S1066369X25700586

zbMATH Keywords

effectively separable numberingfinite specificationmany-sorted algebra

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Model theory (03Cxx) Computability and recursion theory (03Dxx)

Cites work

• \(T_1\)-separable numberings of subdirectly indecomposable algebras
• Computably separable models
• CONSTRUCTIVE ALGEBRAS I
• Enumerated algebras with uniformly recursive-separable classes
• Homomorphisms onto effectively separable algebras
• scientific article; zbMATH DE number 4172407 (Why is no real title available?)
• scientific article; zbMATH DE number 3113504 (Why is no real title available?)
• scientific article; zbMATH DE number 4007714 (Why is no real title available?)
• scientific article; zbMATH DE number 3688693 (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?)
• scientific article; zbMATH DE number 3110189 (Why is no real title available?)
• Joins and meets in the structure of ceers
• Logical specifications of effectively separable data models
• Lower semilattices of separable congruences of numbered algebras
• ON THE STRUCTURE OF COMPUTABLE REDUCIBILITY ON EQUIVALENCE RELATIONS OF NATURAL NUMBERS
• Positive algebras with Noetherian congruence lattices
• 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
• Semirecursive Sets and Positive Reducibility
• Separable algorithmic representations of classical systems and their applications
• Separable enumerations of division rings and effective embeddability of rings therein
• Separation axioms and partitions of the set of natural numbers
• The number of \(Q\)-congruences in positive algebras
• The number of algebras over simple sets
• Uniform \(m\)-equivalencies and numberings of classical systems

This page was built for publication: Finite 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 Q6873611)