SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR

DOI10.1142/S0218196701000644zbMath1025.08003OpenAlexW2085135455MaRDI QIDQ4786292

Dejan Delić

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196701000644

zbMATH Keywords

congruence distributive varietynon-recursive set

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Congruence modularity, congruence distributivity (08B10) Equational classes, universal algebra in model theory (03C05) Computability and recursion theory (03D99)

Related Items (1)

MODAL RESTRICTION SEMIGROUPS: TOWARDS AN ALGEBRA OF FUNCTIONS

Cites Work

• Finite equational bases for finite algebras in a congruence-distributive equational class
• Algorithmic problems for finite groups and finite \(0\)-simple semigroups
• A Variety Where the Set of Subalgebras of Finite Simple Algebras is Not Recursive
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE

This page was built for publication: SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR