Related papers: Modular specification of monads through higher-ord…
Modular symbols for the congruence subgroup $\Gamma_0(\mathfrak{n})$ of $GL_{2}(\mathbf{F}_q[T])$ have been defined by Teitelbaum. They have a presentation given by a finite number of generators and relations, in a formalism similar to…
These notes were originally developed as lecture notes for a category theory course. They should be well-suited to anyone that wants to learn category theory from scratch and has a scientific mind. There is no need to know advanced…
The behaviour of limits of weak morphisms in 2-dimensional universal algebra is not 2-categorical in that, to fully express the behaviour that occurs, one needs to be able to quantify over strict morphisms amongst the weaker kinds.…
The notion of $F$-signature is defined by C. Huneke and G. Leuschke and this numerical invariant characterizes some singularities. This notion is extended to finitely generated modules and called dual $F$-signature. In this paper, we…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
We introduce simple models for associative algebras and bimodules in the context of non-symmetric $\infty$-operads, and use these to construct an $(\infty,2)$-category of associative algebras, bimodules, and bimodule homomorphisms in a…
We provide various ways to characterise $\Sigma$-pure-injective objects in a compactly generated triangulated category. These characterisations mimic analogous well-known results from the model theory of modules. The proof involves two…
The paper is a first of two and aims to show that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…
In studies of bundled modalities, we encode a complex conceptual notion into the semantics of a single modal operator and study its logic. Although there is already a substantial body of work on various concrete bundled operators, we still…
We introduce a contravariant idempotent adjunction between (i) the category of ranked monads on $\mathsf{Set}$; and (ii) the category of internal categories and internal retrofunctors in the category of locales. The left adjoint takes a…
Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…
We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…
We define the notion of a 2-operad relative to an operad, and prove that the 2-associahedra form a 2-operad relative to the associahedra. Using this structure, we define the notions of an $(A_\infty,2)$-category and $(A_\infty,2)$-algebra…
The higher-dimensional modal mu-calculus is an extension of the mu-calculus in which formulas are interpreted in tuples of states of a labeled transition system. Every property that can be expressed in this logic can be checked in…
A class of models is presented, in the form of continuation monads polymorphic for first-order individuals, that is sound and complete for minimal intuitionistic predicate logic. The proofs of soundness and completeness are constructive and…
We construct almost holomorphic and holomorphic modular forms by considering theta series for quadratic forms of signature $(n-1,1)$. We include homogeneous and spherical polynomials in the definition of the theta series (generalizing a…
Suppose $\Lambda$ is a special biserial algebra over an algebraically closed field. Schr\"oer showed that if $\Lambda$ is domestic then the radical of the category of finitely generated (left) $\Lambda$-modules is nilpotent, and the least…
We introduce a category-theoreticabstraction of a syntax with auxiliary functions, called an admissiblemonad morphism. Relying on an abstract form of structural recursion,we then design generic tools to construct admissible monad…
Algorithmic meta-theorems state that problems definable in a fixed logic can be solved efficiently on structures with certain properties. An example is Courcelle's Theorem, which states that all problems expressible in monadic second-order…
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…