Finite axiomatizability for equational theories of computable groupoids

DOI10.2307/2274762zbMath0695.03023OpenAlexW2051850251MaRDI QIDQ3470464

Peter Perkins

Publication date: 1989

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274762

zbMATH Keywords

equational theoryfinite axiomatizabilitycomputable groupoid

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Connections of number theory and logic (11U99)

Related Items (3)

Equational theories of semigroups with involution. ⋮ Equational theories of unstable involution semigroups ⋮ THE FINITE BASIS PROBLEM FOR INVOLUTION SEMIGROUPS OF TRIANGULAR MATRICES

Cites Work

• Unnamed Item
• A new product of algebras and a type reduction theorem
• Basic questions for general algebras
• Nonfinitely based three-element idempotent groupoids
• Unsolvable problems for equational theories

This page was built for publication: Finite axiomatizability for equational theories of computable groupoids