相关论文: Transport of finiteness structures and application…

We investigate the representation theory of finite sets. The correspondence functors are the functors from the category of finite sets and correspondences to the category of k-modules, where k is a commutative ring. They have various…

We give a description of simple functors taking finitely generated values, from a small additive category to the category of vector spaces over a field. This result is analogous to Steinberg's tensor product theorems in group representation…

In this paper, we construct an infinitary variant of the relational model of linear logic, where the exponential modality is interpreted as the set of finite or countable multisets. We explain how to interpret in this model the fixpoint…

We show that a profinite completion functor for (simplicial or topological) operads with good homotopical properties can be constructed as a left Quillen functor from an appropriate model category of infinity-operads to a certain model…

The notions of null-sets and nullity are present in all discourses of mathematics. They are based on the dual-pair of notions of "almost-every" and "almost none". A notion of nullity corresponds to a choice of subsets that one interprets as…

Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…

Structural operational semantics can be studied at the general level of distributive laws of syntax over behaviour. This yields specification formats for well-behaved algebraic operations on final coalgebras, which are a domain for the…

Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics…

We prove analogues of model theory results for $\mathcal{C}\to \mathcal{D}$ coherent functors, including variants of the omitting types theorem and some results on ultraproduct constructions. We introduce a distributive lattice valued…

We lay out an infinity categorical interpretation of reconstruction theorems which are germane to the symmetric monoidal perspective of noncommutative algebraic geometry, present sufficient conditions which allow for the factorization of…

This paper is devoted to the investigation of term-definable connexive implications in substructural logics with exchange and, on the semantical perspective, in sub-varieties of commutative residuated lattices (FLe-algebras). In particular,…

We show that certain free energy functionals that are not convex with respect to the usual convex structure on their domain of definition, are strictly convex in the sense of displacement convexity under a natural change of variables. We…

The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

We study several structure aspects of functor categories from a small additive category to a module category, in particular the category F(A,K) of functors from finitely generated free modules over a commutative ring A to vector spaces over…

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

This paper explores the interplay between category theory, topology, and the algebraic theory of finite groups. Our analysis unfolds in three stages. First, we establish the foundational universe of our objects: the complete and cocomplete…

We initiate the study of reducts of relational structures up to primitive positive interdefinability: After providing the tools for such a study, we apply these tools in order to obtain a classification of the reducts of the logic of…

We present three syntactic forcing models for coherent logic. These are based on sites whose underlying category only depends on the signature of the coherent theory, and they do not presuppose that the logic has equality. As an application…

In this article, we prove some fixed point theorems in metric type spaces. This article is just a generalization some results previously proved in \cite{niyi-gaba}. In particular, we give some coupled common fixed points theorems under weak…