Related papers: Introduction to: classification theory for abstrac…
The notion of a categorical quotient can be generalized since its standard categorical concept does not recover the expected quotients in certain categories. We present a more general formulation in the form of $\mathcal{F}$-quotients in a…
This paper presents a study of how the theory of categories leads to the creation of non classical logical systems. In particular, the case of the elementary topos of graphs, where there are three other truth values different from false and…
We study the problem of conjunctive query evaluation relative to a class of queries; this problem is formulated here as the relational homomorphism problem relative to a class of structures A, wherein each instance must be a pair of…
Text classification is one of the most widely studied tasks in natural language processing. Motivated by the principle of compositionality, large multilayer neural network models have been employed for this task in an attempt to effectively…
Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…
This book introduces to the theory of probabilities from the beginning. Assuming that the reader possesses the normal mathematical level acquired at the end of the secondary school, we aim to equip him with a solid basis in probability…
This article is dedicated to the investigation of difficulties involved in the understanding of the homomorphism concept. It doesn't restrict to group-theory but on the contrary raises the issue of developing teaching strategies aiming at…
Separations among the first order logic ${\cal R}ing(0,+,*)$ of finite residue class rings, its extensions with generalized quantifiers, and in the presence of a built-in order are shown, using algebraic methods from class field theory.…
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…
Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a…
We introduce some new symmetric tensor categories based on the combinatorics of trees: a discrete family $\mathcal{D}(n)$, for $n \ge 3$ an integer, and a continuous family $\mathcal{C}(t)$, for $t \ne 1$ a complex number. The construction…
We define the notion of a multi-sorted algebraic theory, which is a generalization of an algebraic theory in which the objects are of different "sorts." We prove a rigidification result for simplicial algebras over these theories, showing…
Category theory has foundational importance because it provides conceptual lenses to characterize what is important in mathematics. Originally the main lenses were universal mapping properties and natural transformations. In recent decades,…
The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…
We prove a version of Shelah's Categoricity Conjecture for arbitrary deconstructible classes of modules. Moreover, we show that if $\mathcal{A}$ is a deconstructible class of modules that fits in an abstract elementary class…
Collective classification models attempt to improve classification performance by taking into account the class labels of related instances. However, they tend not to learn patterns of interactions between classes and/or make the assumption…
Class algebra provides a natural framework for sharing of ISA hierarchies between users that may be unaware of each other's definitions. This permits data from relational databases, object-oriented databases, and tagged XML documents to be…
Classification of ordinal data is one of the most important tasks of relation learning. In this thesis a novel framework for ordered classes is proposed. The technique reduces the problem of classifying ordered classes to the standard…
We consider evolution algebras and their related substructures: evolution ideals and evolution subalgebras. After exposing some of the concepts related to them in the literature, we explore the order structures that arise in the sets of…
Our "long term and large scale" aim is to characterize the first order theories T (at least the countable ones) such that: for every ordinal alpha there lambda,M_1,M_2 such that M_1,M_2 are non-isomorphic models of T of cardinality lambda…