English
Related papers

Related papers: Partial Univalence in n-truncated Type Theory

200 papers

Postulating an impredicative universe in dependent type theory allows System F style encodings of finitary inductive types, but these fail to satisfy the relevant {\eta}-equalities and consequently do not admit dependent eliminators. To…

Logic in Computer Science · Computer Science 2024-02-22 Steve Awodey , Jonas Frey , Sam Speight

If H is a Hopf algebra whose square of the antipode is the identity, $v\in\l (V)\otimes H$ is a corepresentation, and $\pi :H\to\l (W)$ is a representation, then $u=(id\otimes\pi)v$ satisfies the equation $(t\otimes id)u^{-1}=((t\otimes…

Quantum Algebra · Mathematics 2007-05-23 Teodor Banica

There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a sort of converse statement for a class of…

Probability · Mathematics 2013-03-21 Jan M. Swart

We define and develop two-level type theory (2LTT), a version of Martin-L\"of type theory which combines two different type theories. We refer to them as the inner and the outer type theory. In our case of interest, the inner theory is…

Logic in Computer Science · Computer Science 2026-05-27 Danil Annenkov , Paolo Capriotti , Nicolai Kraus , Christian Sattler

In their usual form, representation independence metatheorems provide an external guarantee that two implementations of an abstract interface are interchangeable when they are related by an operation-preserving correspondence. If our…

Programming Languages · Computer Science 2025-06-11 Carlo Angiuli , Evan Cavallo , Anders Mörtberg , Max Zeuner

Informally, a homotopy monoid is a monoid-like structure in which properties such as associativity only hold `up to homotopy' in some consistent way. This short paper comprises a rigorous definition of homotopy monoid and a brief analysis…

Quantum Algebra · Mathematics 2009-09-25 Tom Leinster

Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class-namely a downward closure of NP, \rsnnp - has…

Computational Complexity · Computer Science 2007-05-23 Edith Hemaspaandra , Lane A. Hemaspaandra , Harald Hempel

Let $X$ be a finite CW complex and let $h_1, h_2: C(X)\to A$ be two unital \hm s, where $A$ is a unital C*-algebra. We study the problem when $h_1$ and $h_2$ are approximately homotopic. We present a $K$-theoretical necessary and sufficient…

Operator Algebras · Mathematics 2008-01-28 Huaxin Lin

We relate the existence problem of universal objects to the properties of corresponding enriched categories (lifts or expansions). In particular, extending earlier results, we prove that for every (possibly infinite) regular set F of finite…

Combinatorics · Mathematics 2013-03-05 Jan Hubička , Jaroslav Nešetřil

We prove that a set of finite perimeter is indecomposable if and only if it is, up to a choice of suitable representative, connected in the 1-fine topology. This gives a topological characterization of indecomposability which is new even in…

Metric Geometry · Mathematics 2025-12-23 Paolo Bonicatto , Panu Lahti , Enrico Pasqualetto

We consider natural Hamiltonian systems of $n>1$ degrees of freedom with polynomial homogeneous potentials of degree $k$. We show that under a genericity assumption, for a fixed $k$, at most only a finite number of such systems is…

Exactly Solvable and Integrable Systems · Physics 2010-04-19 Maria Przybylska

In the paper hereditary classes of ${\rm L}$-structures are studied with language of the form ${{\rm L} = {\rm L_{fin}} \cup {\rm L_\infty}}$, where ${{\rm L_{fin}} = \langle R_1,R_2,\ldots, R_m, = \rangle}$ and ${{\rm L_\infty} = \langle…

Logic · Mathematics 2023-12-29 Artem Ilev

Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…

Computational Complexity · Computer Science 2025-09-05 Lunjia Hu , Salil Vadhan

This paper continues the series of papers that develop a new approach to syntax and semantics of dependent type theories. Here we study the interpretation of the rules of the identity types in the intensional Martin-Lof type theories on the…

Category Theory · Mathematics 2015-05-26 Vladimir Voevodsky

The constraint satisfaction problem (CSP) can be formulated as a homomorphism problem between relational structures: given a structure $\mathcal{A}$, for any structure $\mathcal{X}$, whether there exists a homomorphism from $\mathcal{X}$ to…

Logic · Mathematics 2024-03-12 Azza Gaysin

Recently discovered domain-specific formal systems -- specifically homotopy type theory and simplicial type theory -- provide new perspectives on spaces and categories in a natively equivalence-invariant setting. In this note, we expose…

Category Theory · Mathematics 2025-10-20 Emily Riehl

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…

Logic in Computer Science · Computer Science 2019-07-16 Benedikt Ahrens , Ralph Matthes , Anders Mörtberg

This note extends Quillen's Theorem A to a large class of categories internal to topological spaces. This allows us to show that under a mild condition a fully faithful and essentially surjective functor between such topological categories…

Algebraic Topology · Mathematics 2024-06-12 David Michael Roberts

The algebraic dichotomy conjecture for Constraint Satisfaction Problems (CSPs) of reducts of (infinite) finitely bounded homogeneous structures states that such CSPs are polynomial-time tractable when the model-complete core of the template…

Logic in Computer Science · Computer Science 2020-07-22 Manuel Bodirsky , Antoine Mottet , Miroslav Olšák , Jakub Opršal , Michael Pinsker , Ross Willard

We show that the $p$-group complex of a finite group $G$ is homotopy equivalent to a wedge of spheres of dimension at most $n$ if $G$ contains a self-centralising normal subgroup $H$ which is isomorphic to a group of Lie type and Lie rank…

Group Theory · Mathematics 2026-02-25 Kevin Iván Piterman