Related papers: Approximation Theory and Elementary Submodels
In this paper, we introduce and investigate \emph{semicorings} over associative semirings and their categories of \emph{semicomodules.} Our results generalize old and recent results on corings over rings and their categories of comodules.…
We use the Graph Minor Theorem to characterize infinite sequences of finite subsets of factorial and commutative semigroups (here semigroups have a unity element), e.g. the multiplicative semigroup of a unique factorization domain.
We consider a notion of exact sequences in any -not necessarily exact- pointed category relative to a given (E;M)-factorization structure. We apply this notion to introduce and investigate a new notion of exact sequences of semimodules over…
The growing complexity of modern practical problems puts high demands on the mathematical modelling. Given that various models can be used for modelling one physical phenomenon, the role of model comparison and model choice becomes…
In this paper we study categorical properties of the category of abelian hypergroups that leads to the notion of hyper (almost) preadditive and hyper (almost) abelian categories. Our goal is to create a path towards a general theory of…
We introduce the notion of an approximation system as a generalization of Taylor approximation, and we give some first examples. Next we develop the general theory, including error bounds and a sufficient criterion for convergence. More…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
In these self-contained low prerequisite introductory notes we first present (in part 1) basic concepts of set theory and algebra without explicit category theory. We then present (in part 2) basic category theory involving a somewhat…
Approximation Fixpoint Theory (AFT) is an algebraic framework designed to study the semantics of non-monotonic logics. Despite its success, AFT is not readily applicable to higher-order definitions. To solve such an issue, we devise a…
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 exploration of the notion of observability exhibits transparently the rich interplay between algebraic and geometric ideas in \emph{geometric invariant theory}. The concept of \emph{observable subgroup} was introduced in the early 1960s…
In this survey we present the relatively new concept of \emph{approximable triangulated categories.} We will show that the definition is natural, that it leads to powerful new results, and that it throws new light on old, familiar objects.…
We develop category-theoretic framework for universal homogeneous objects, with some applications in the theory of Banach spaces, linear orderings, and in topology of compact spaces.
In Part 1, we describe six projective-type model structures on the category of differential graded modules over a differential graded algebra A over a commutative ring R. When R is a field, the six collapse to three and are well-known, at…
We classify localising subcategories of the stable module category of a finite group that are closed under tensor product with simple (or, equivalently all) modules. One application is a proof of the telescope conjecture in this context.…
We introduce a notion of a filtered model structure and use this notion to produce various model structures on pro-categories. This framework generalizes several known examples. We give several examples, including a homotopy theory for…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Statistical information is ubiquitous but drawing valid conclusions from it is prohibitively hard. We explain how knowledge graph embeddings can be used to approximate probabilistic inference efficiently using the example of Statistical EL…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
We introduce a method to derive theorems from Elementary Number Theory by means of relationships among formal languages. Using $\sigma$-algebras, we define what a proof of a number-theoretical statement by Language Theory means. We prove…