Related papers: Canonicity for Cubical Type Theory
A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…
The term UniMath refers both to a formal system for mathematics, as well as a computer-checked library of mathematics formalized in that system. The UniMath system is a core dependent type theory, augmented by the univalence axiom. The…
A multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative…
We introduce the Cuntz-Thomsen picture of $\mathcal{C}$-equivariant Kasparov theory, denoted $\mathrm{KK}^\mathcal{C}$, for a unitary tensor category $\mathcal{C}$ with countably many isomorphism classes of simple objects. We use this…
We prove a conjecture about the constructibility of coinductive types - in the principled form of indexed M-types - in Homotopy Type Theory. The conjecture says that in the presence of inductive types, coinductive types are derivable.…
Kendall's Shape Theory covers shapes formed by $N$ points in $\mathbb{R}^d$ upon quotienting out the similarity transformations. This theory is based on the geometry and topology of the corresponding configuration space: shape space.…
We prove a classification theorem for conformal maps with respect to the control distance generated by a system of diagonal vector fields. It turns out that all such maps can be obtained as compositions of suitable dilations, inversions and…
The concept of conformally equivariant quantizations was introduced by Duval, Lecomte and Ovsienko in \cite{DLO} for manifolds endowed with flat conformal structures. They obtained results of existence and uniqueness (up to normalization)…
In this short note we give a glimpse of homotopy type theory, a new field of mathematics at the intersection of algebraic topology and mathematical logic, and we explain Vladimir Voevodsky's univalent interpretation of it. This…
Using arbitrary symplectic structures and parametrization invariant actions, we develop a formalism, based on Dirac's quantization procedure, that allows us to consider theories with both space-space as well as space-time noncommutativity.…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
This note documents the specification of normal forms in cubical type theory. The definition is already present in the proof of normalization for cubical type theory, but we present it in a more traditional style explicitly for reference.
We derive a uniqueness result for non-Cartesian composition of systems in a large class of process theories, with important implications for quantum theory and linguistics. Specifically, we consider theories of wavefunctions valued in…
We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalising the groupoid model of type theory. As an application, we show that countable choice cannot be…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map…
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free…
The denotational semantics of the untyped lambda-calculus is a well developed field built around the concept of solvable terms, which are elegantly characterized in many different ways. In particular, unsolvable terms provide a consistent…
In this note we remark on the problem of equality of objects in categories formalized in Martin-L\"of's constructive type theory. A standard notion of category in this system is E-category, where no such equality is specified. The main…