Related papers: Against Cumulative Type Theory

The treatment of equality as a type in type theory gives rise to an interesting type-theoretic structure known as `identity type'. The idea is that, given terms $a,b$ of a type $A$, one may form the type $Id_{A}(a,b)$, whose elements are…

Set Matrix Theory (SMT) has been introduced in Log. Anal. 225: 59-82 (2014) as a generalization of ZF, in which matrices constructed from sets are treated as urelements, that is, as objects that are not sets but that can be elements of…

Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we use a program abstraction in which transitions are described by Monotonicity Constraints over (abstract)…

The question of whether the central limit theorem (CLT) holds for the total number of edges in exponential random graph models (ERGMs) in the subcritical region of parameters has remained an open problem. In this paper, we establish the…

We prove a central limit theorem for the linear statistics of one-dimensional log-gases, or $\beta$-ensembles. We use a method based on a change of variables which allows to treat fairly general situations, including multi-cut and, for the…

Let $\mathcal{L}$ be a first-order two-sorted language. Let $S$ be some fixed structure. A standard structure is an $\mathcal{L}$-structure of the form $(M,S)$, where $M$ is arbitrary. When $S$ is a compact topological space (and…

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

In this essay, I present the advantages and, I dare say, the beauty of programming in a language with set-theoretic types, that is, types that include union, intersection, and negation type connectives. I show by several examples how…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

Toda Conformal Field Theories (CFTs hereafter) are generalizations of Liouville CFT where the underlying field is no longer scalar but takes values in a finite-dimensional vector space induced by a complex simple Lie algebra. The goal of…

Staton has shown that there is an equivalence between the category of presheaves on (the opposite of) finite sets and partial bijections and the category of nominal restriction sets: see [2, Exercise 9.7]. The aim here is to see that this…

This paper provides a Central Limit Theorem (CLT) for a process $\{\theta_n, n\geq 0\}$ satisfying a stochastic approximation (SA) equation of the form $\theta_{n+1} = \theta_n + \gamma_{n+1} H(\theta_n,X_{n+1})$; a CLT for the associated…

Using dependent type theory to formalise the syntax of dependent type theory is a very active topic of study and goes under the name of "type theory eating itself" or "type theory in type theory." Most approaches are at least loosely based…

We formulate and prove a new sufficient conditions for Central Limit Theorem(CLT) in the space of continuous functions in the terms typical for the approximation theory. We prove that the conditions for continuous CLT obtained by N.C.Jain…

We demonstrate that the assembly pathway method underlying assembly theory (AT) is an encoding scheme widely used by popular statistical compression algorithms. We show that in all cases (synthetic or natural) AT performs similarly to other…

Scalar-tensor theories (STTs) are a widely studied alternative to General Relativity (GR) in which gravity is endowed with an additional scalar degree of freedom. Although severely constrained by solar system and pulsar timing experiments,…

One of the aims of Implicit Computational Complexity is the design of programming languages with bounded computational complexity; indeed, guaranteeing and certifying a limited resources usage is of central importance for various aspects of…

We use the method due to Batalin, Fradkin, Fradkina, and Tyutin (BFFT) in order to convert second-class into first-class constraints for some quantum mechanics supersymmetric theories. The main point to be considered is that the extended…

A group is $G$ commutative transitive or CT if commuting is transitive on nontrivial elements. A group $G$ is CSA or conjugately separated abelian if maximal abelian subgroups are malnormal. These concepts have played a prominent role in…

We show that string-net models provide a novel geometric method to construct invariants of mapping class group actions. Concretely, we consider string-net models for a modular tensor category ${\mathcal C}$. We show that the datum of a…