Related papers: A Type Theory with a Tiny Object

For $\mathbb Q$-factorial klt algebraically integrable adjoint foliated structures, we prove the cone theorem, the contraction theorem, and the existence of flips. Therefore, we deduce the existence of the minimal model program for such…

In this addendum to [4], we provide a pair of counterexamples relevant to the theory of implicit operations. More precisely, we exhibit a pp expansion of a variety that fails to be a variety (although it is a quasivariety). Furthermore, we…

This survey paper contains a detailed self-contained introduction to Korovkin-type theorems and to some of their applications concerning the approximation of continuous functions as well as of L^p-functions, by means of positive linear…

This paper answeres the question posed by E.Manes in his book "Algebraic theories": given monoids M and N considered as categories with a single object, and a morphism f: M --> N of monoids (considered as functor), such that f has an…

A Datalog program can be viewed as a syntactic specification of a functor from database instances over some schema to database instances over another schema. The same holds more generally for $\exists$Datalog. We establish large classes of…

Many things in mathematics seem lamost unreasonably nice. This includes objects, counterexamples, proofs. In this preprint I discuss many examples of this phenomenon with emphasis on the ring of polynomials in a countably infinite number of…

We give a general exposition of model theoretic connected components of groups. We show that if a group G has NIP, then there exists the smallest invariant (over some small set) subgroup of G with bounded index (Theorem 5.3). This result…

A theorem that is of aid in computing the domain of the adjoint operator is provided. It may serve e.g. as a criterion for selfadjointness of a symmetric operator, for normality of a formally normal operator or for $H$--selfadjointness of…

We present a two-level theory to formalize constructive mathematics as advocated in a previous paper with G. Sambin. One level is given by an intensional type theory, called Minimal type theory. This theory extends the set-theoretic version…

By the biadjoint triangle theorem, given a pseudomonad $\mathcal{T} $ on a $2$-category $\mathfrak{B} $, if a right biadjoint $\mathfrak{A}\to\mathfrak{B} $ has a lifting to the pseudoalgebras…

The ability to cast values between related types is a leitmotiv of many flavors of dependent type theory, such as observational type theories, subtyping, or cast calculi for gradual typing. These casts all exhibit a common structural…

We prove that the NTP$_1$ property of a geometric theory $T$ is inherited by theories of lovely pairs and $H$-structures associated to $T$. We also provide a class of examples of nonsimple geometric NTP$_1$ theories.

We give some Korovkin-type theorems on convergence and estimates of rates of approximations of nets of functions, satisfying suitable axioms, whose particular cases are filter/ideal convergence, almost convergence and triangular…

Lucatelli Nunes obtained a 2-categorical version of the adjoint triangle theorem of Dubuc using the descent object of a specific diagram. In some cases, such a diagram can be filled with an extra cell. We show then how to obtain a biadjoint…

This article is the last of the series of articles where we reprove the foundational ideas of abstract six-functor formalisms developed by Liu-Zheng. We prove the theorem of partial adjoints, which is a simplicial technique of encoding…

Many formal languages of contemporary mathematical music theory -- particularly those employing category theory -- are powerful but cumbersome: ideas that are conceptually simple frequently require expression through elaborate categorical…

Recently the author has studied rings for which products of flat modules have finite flat dimension. In this paper we extend the theory to characterize when products of modules in $\mathcal T$ have finite $\mathcal T$-projective dimension,…

This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…

We present an extensive mechanization of the meta-theory of Martin-L\"of Type Theory (MLTT) in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not only the decidability of conversion, but also the…

We develop a Glivenko--Cantelli theory for monotone, almost additive functions of i.\,i.\,d.\ sequences of random variables indexed by~$\Z^d$. Under certain conditions on the random sequence, short range correlations are allowed as well. We…