Related papers: Alpay Algebra: A Universal Structural Foundation
A single closed expression $f_{\text{Alpay},U}(x)$ is presented which, for every integer $x\ge 0$, returns the $(x+1)$-th prime $p_{x+1}$. The construction uses only integer arithmetic, greatest common divisors, and floor functions. A prime…
Let $A$ and $B$ be unital separable simple amenable \CA s which satisfy the Universal Coefficient Theorem. Suppose {that} $A$ and $B$ are $\mathcal Z$-stable and are of rationally tracial rank no more than one. We prove the following:…
Reasoning on large and complex real-world models is a computationally difficult task, yet one that is required for effective use of many AI applications. A plethora of inference algorithms have been developed that work well on specific…
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…
The initial algebra for an endofunctor F provides a recursion and induction scheme for data structures whose constructors are described by F. The initial-algebra construction by Ad\'amek (1974) starts with the initial object (e.g. the empty…
We propose the design of novel categorical generative AI architectures (GAIAs) using topos theory, a type of category that is ``set-like": a topos has all (co)limits, is Cartesian closed, and has a subobject classifier. Previous theoretical…
A prevailing assumption in machine learning is that model correctness must be enforced after the fact. We observe that the properties determining whether an AI model is numerically stable, computationally correct, or consistent with a…
The affine Hilbert function is a classical algebraic object that has been central, among other tools, to the development of the polynomial method in combinatorics. Owing to its concrete connections with Gr\"obner basis theory, as well as…
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics of such non-monotonic…
Let $C$ be a general unital AH-algebra and let $A$ be a unital simple $C^*$-algebra with tracial rank at most one. Suppose that $\phi, \psi: C\to A$ are two unital monomorphisms. We show that $\phi$ and $\psi$ are approximately unitarily…
The profile of a relational structure $R$ is the function $\varphi_R$ which counts for every integer $n$ the number, possibly infinite, $\varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures…
Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…
We deal with the quasi-symmetric algebra introduced by Paolo Aluffi, here named (embedded) Aluffi algebra. The algebra is a sort of "intermediate" algebra between the symmetric algebra and the Rees algebra of an ideal, which serves the…
Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…
In this article, we introduce the notion of a curved absolute $\mathcal{L}_\infty$-algebra, a structure that behaves like a curved $\mathcal{L}_\infty$-algebra where all infinite sums of operations are well-defined by definition. We develop…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
The development of machine learning in particular and artificial intelligent in general has been strongly conditioned by the lack of an appropriated framework to specify and integrate learning processes, data transformation processes and…
Explainable AI (XAI) aims to address the human need for safe and reliable AI systems. However, numerous surveys emphasize the absence of a sound mathematical formalization of key XAI notions -- remarkably including the term "explanation"…
We provide a construction of the fixed points of functors which may not be inital algebras or final coalgebras. For an endofunctor F, this fixed point construction may be expressed as a pair of adjoint functors between F-coalgebras and…