Strongly \(\forall\)-finite theories of unars

DOI10.1007/BF01138338zbMath0662.03026MaRDI QIDQ1113894

B. M. Khusainov

Publication date: 1987

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

theory of treesstrong \(\forall \)-finitenesstheory of unars

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Unary algebras (08A60) Computable structure theory, computable model theory (03C57)

Related Items (2)

Recursive unary algebras and trees ⋮ Primitively recursive categoricity for unars and equivalence structures

This page was built for publication: Strongly \(\forall\)-finite theories of unars