Related papers: Against Cumulative Type Theory
We propose a diagnostic tool for detecting non-trivial symmetry protected topological (SPT) phases protected by a symmetry group $G$ in 2+1 dimensions. Our method is based on directly studying the 1+1-dimensional anomalous edge conformal…
Weak $\infty$-categories are known to be more expressive than their strict counterparts, but are more difficult to work with, as constructions in such a category involve the manipulation of explicit coherence data. This motivates the search…
Basis tensor gauge theory (BTGT) is a vierbein analog reformulation of ordinary gauge theories in which the vierbein field describes the Wilson line. After a brief review of the BTGT, we clarify the Lorentz group representation properties…
In a type-theoretic fibration category in the sense of Shulman (representing a dependent type theory with at least 1, Sigma, Pi, and identity types), we define the type of constant functions from A to B. This involves an infinite tower of…
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…
The aim of staged compilation is to enable metaprogramming in a way such that we have guarantees about the well-formedness of code output, and we can also mix together object-level and meta-level code in a concise and convenient manner. In…
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…
A series of sigma models with torsion are analysed which generate their mass dynamically but whose ultra-violet fixed points are non-trivial conformal field theories -- in fact SU(2) WZW models at level $k$. In contrast to the more familiar…
Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a…
Combinatorial group testing (CGT) is used to identify defective items from a set of items by grouping them together and performing a small number of tests on the groups. Recently, group testing has been used to design efficient COVID-19…
Homotopy Quantum Field Theories (HQFTs) were introduced by the second author to extend the ideas and methods of Topological Quantum Field Theories to closed $d$-manifolds endowed with extra structure in the form of homotopy classes of maps…
Boundary conformal field theory (BCFT) is simply the study of conformal field theory (CFT) in domains with a boundary. It gains its significance because, in some ways, it is mathematically simpler: the algebraic and geometric structures of…
We address one of the open problems in quantization theory recently listed by Rieffel. By developping in detail Connes' tangent groupoid principle and using previous work by Landsman, we show how to construct a strict, flabby quantization,…
Mathematicians still use Naive Set Theory when generating sets without danger of producing any contradiction. Therefore their working method can be considered as a consistent inference system with an experience of over 100 years. My…
We introduce compositional tensor trains (CTTs) for the approximation of multivariate functions, a class of models obtained by composing low-rank functions in the tensor-train format. This format can encode standard approximation tools,…
In two earlier articles, we proved that, if the Hodge conjecture is true for ALL CM abelian varieties over the complex numbers, then both the Tate conjecture and the standard conjectures are true for abelian varieties over finite fields.…
The most powerful formulation of the Central Sets Theorem in an arbitrary semigroup was proved in the work of De, Hindman, and Strauss. The sets which satisfy the conclusion of the above Central Sets Theorem are called $C$-sets. The…
Size-Change Termination (SCT) is a method of proving program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by monotonicity constraints over…
We propose Class Based Thresholding (CBT) to reduce the computational cost of early exit semantic segmentation models while preserving the mean intersection over union (mIoU) performance. A key idea of CBT is to exploit the…
We show how (well-established) type systems based on non-idempotent intersection types can be extended to characterize termination properties of functional programming languages with pattern matching features. To model such programming…