The number of \(Q\)-congruences in positive algebras

DOI10.1007/BF02259947zbMath0795.03046MaRDI QIDQ1317611

N. Kh. Kasymov

Publication date: 12 April 1994

Published in: Algebra and Logic (Search for Journal in Brave)

zbMATH Keywords

logic programmingabstract data typeuniversal Horn sentencespositive modelsdecidability problems for positive enumerationseffective descriptionpositive algebrasrecursive quotient algebras

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Logic programming (68N17) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Structures of degrees of negative representations of linear orders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The number of \(Q\)-congruences in positive algebras