Essential arities in algebras of finite type and arity trees

DOI10.1016/S0012-365X(01)00186-8zbMATH Open0998.08003OpenAlexW2022480287MaRDI QIDQ1598815

Jerzy Tomasik, Andrzej Kisielewicz

Publication date: 28 May 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00186-8

zbMATH Keywords

clonefinite algebraessential arityarity treesessentially \(n\)-ary term operation

Mathematics Subject Classification ID

Trees (05C05) Operations and polynomials in algebraic structures, primal algebras (08A40) Finitary algebras (08A62)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Essential countability of treeable equivalence relations 👍 👎
• Bounding essential arities of term operations in finitely decidable varieties 👍 👎
• Arithmetic hierarchy and ideals of enumerated Boolean algebras 👍 👎
• Essential arities of term operations in finite algebras 👍 👎
• Enumeration of algebras close to absolutely free algebras and binary trees 👍 👎
• A variety theorem for trees and theories 👍 👎
• Semilattices of finite arithmetical algebras 👍 👎
• Mathematical Foundations of Computer Science 2003 👍 👎

This page was built for publication: Essential arities in algebras of finite type and arity trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1598815)