Related papers: Decomposing the Univalence Axiom

As large language models (LLMs) gain popularity in conducting prediction tasks in-context, understanding the sources of uncertainty in in-context learning becomes essential to ensuring reliability. The recent hypothesis of in-context…

Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…

Incompressible fluid equations are studied with UV cut-off and in periodic boundary conditions. Properties of the resulting ODEs holding uniformly in the cut-off are considered and, in particular, are conjectured to be equivalent to…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…

We define a general class of dependent type theories, encompassing Martin-L\"of's intuitionistic type theories and variants and extensions. The primary aim is pragmatic: to unify and organise their study, allowing results and constructions…

Over a perfect field k, let G be an extension of an abelian variety by the multiplicative group $\G_m$. We compute the motive of G in Voevodsky's category of etale motivic complexes with rational coefficients. The result is a decomposition…

We develop birational versions of Voevodsky's triangulated categories of motives over a field, and relate them with the pure birational motives studied in arXiv:0902.4902 [math.AG]. We also get an interpretation of unramified cohomology in…

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

Inspired by a fundamental theorem of Bernstein, Kushnirenko, and Khovanskii we study the following Bezout type inequality for mixed volumes $$ V(L_1,\dots,L_{n})V_n(K)\leq V(L_1,K[{n-1}])V(L_2,\dots, L_{n},K). $$ We show that the above…

We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…

We prove normalization for (univalent, Cartesian) cubical type theory, closing the last major open problem in the syntactic metatheory of cubical type theory. Our normalization result is reduction-free, in the sense of yielding a bijection…

Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…

Decomposition of text into atomic propositions is a flexible framework allowing for the closer inspection of input and output text. We use atomic decomposition of hypotheses in two natural language reasoning tasks, traditional NLI and…

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…

In this paper, we analyze and compare three of the many algebraic structures that have been used for modeling dependent type theories: categories with families, split type-categories, and representable maps of presheaves. We study these in…

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 present the theory of higher order invariants and higher order automorphic forms in the simplest case, that of a compact quotient. In this case many things simplify and we are thus able to prove a more precise structure theorem than in…

For an arbitrary evolution family, we consider the notion of a polynomial dichotomy with respect to a family of norms and characterize it in terms of the admissibility property, that is, the existence of a unique bounded solution for each…

In this paper we consider Modal Team Logic, a generalization of Classical Modal Logic in which it is possible to describe dependence phenomena between data. We prove that most known fragment of Full Modal Team Logic allow the elimination of…