Year: 2024
Type: article
Abstract: Matrix properties are a type of property of categories which includes the ones of being Mal’tsev, arithmetical, majority, unital, strongly unital, and subtractive. Recently, an algorithm has been developed to determine implications $$\textrm{M}\Rightarrow _{\textrm{lex}_*}\textrm{N}$$ M ⇒ lex ∗ N between them. We show here that this algorithm reduces to constructing a partial term corresponding to $$\textrm{N}$$ N from a partial term corresponding to $$\textrm{M}$$ M . Moreover, we prove that this is further equivalent to the corresponding implication between the weak versions of these properties, i.e., the one where only strong monomorphisms are considered instead of all monomorphisms.
Source: Applied Categorical Structures
Authors: Michael Hoefnagel, Pierre-Alain Jacqmin
Institutions: Stellenbosch University, Royal Military Academy, UCLouvain
Language: Latvian
Topic: Advanced Algebra and Logic
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,090
Funder: Universiteit Stellenbosch
OpenAlex ID: W4403785302