English
Related papers

Related papers: Partial Univalence in n-truncated Type Theory

200 papers

Awodey, later with Newstead, showed how polynomial functors with extra structure (termed ``natural models'') hold within them the categorical semantics for dependent type theory. Their work presented these ideas clearly but ultimately led…

Logic in Computer Science · Computer Science 2026-03-03 C. B. Aberlé , David I. Spivak

We consider a self-homeomorphism h of some surface S. A subset F of the fixed point set of h is said to be unlinked if there is an isotopy from the identity to h that fixes every point of F. With Le Calvez' transverse foliations theory in…

Dynamical Systems · Mathematics 2017-03-01 François Béguin , Sylvain Crovisier , Frédéric Le Roux

In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…

Logic · Mathematics 2009-05-05 Fairouz Kamareddine , Karim Nour

We study a new extension of the weak MSO logic, talking about boundedness. Instead of a previously considered quantifier U, expressing the fact that there exist arbitrarily large finite sets satisfying a given property, we consider a…

Logic in Computer Science · Computer Science 2023-11-29 Anita Badyl , Paweł Parys

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei

In this paper, we define indexed type theories which are related to indexed ($\infty$-)categories in the same way as (homotopy) type theories are related to ($\infty$-)categories. We define several standard constructions for such theories…

Category Theory · Mathematics 2023-06-22 Valery Isaev

We introduce constraints necessary for type checking a higher-order concurrent constraint language, and solve them with an incremental algorithm. Our constraint system extends rational unification by constraints x$\subseteq$ y saying that…

cmp-lg · Computer Science 2008-02-03 Martin Mueller , Joachim Niehren

In this paper, we explore the 'equivalence principle' (EP): roughly, statements about mathematical objects should be invariant under an appropriate notion of equivalence for the kinds of objects under consideration. In set theoretic…

Logic · Mathematics 2022-02-07 Benedikt Ahrens , Paige Randall North

Let $[\rho_{i_k},[\rho_{i_{k-1}},...,[\rho_{i_{1}}, \rho_{i_2}] ...]]$ be an iterated commutator of self-maps $\rho_{i_j} : \Sigma {\Bbb H}P^\infty \to \Sigma {\Bbb H}P^\infty, j = 1,2, ..., k$ on the suspension of the infinite quaternionic…

Algebraic Topology · Mathematics 2015-03-17 Dae-Woong Lee

In proof theory the notion of canonical proof is rather basic, and it is usually taken for granted that a canonical proof of a sentence must be unique up to certain minor syntactical details (such as, e.g., change of bound variables). When…

Logic in Computer Science · Computer Science 2013-08-07 Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

Does a space enjoying good finiteness properties admit an algebraic model with commensurable finiteness properties? In this note, we provide a rational homotopy obstruction for this to happen. As an application, we show that the maximal…

Algebraic Topology · Mathematics 2019-02-05 Stefan Papadima , Alexander I. Suciu

We present a class of discretisation spaces and H(div)-conformal elements that can be built on any polytope. Bridging the flexibility of the Virtual Element spaces towards the element's shape with the divergence properties of the…

Numerical Analysis · Mathematics 2020-07-17 Rémi Abgrall , Élise Le Mélédo , Philipp Öffner

In this paper, we explore a connection between type universes and memory allocation. Type universe hierarchies are used in dependent type theories to ensure consistency, by forbidding a type from quantifying over all types. Instead, the…

Programming Languages · Computer Science 2024-07-10 Paulette Koronkevich , William J. Bowman

After developing the basic theory of locally cartesian localizations of presentable locally cartesian closed infinity-categories, we establish the representability of equivalences and show that univalent families, in the sense of Voevodsky,…

Category Theory · Mathematics 2017-05-30 David Gepner , Joachim Kock

We give a formulation of the Nielsen-Schreier theorem (subgroups of free groups are free) in homotopy type theory using the presentation of groups as pointed connected 1-truncated types. We show the special case of finite index subgroups…

Logic · Mathematics 2023-06-22 Andrew W Swan

The persistent challenge of formulating ontic structuralism in a rigorous manner, which prioritizes structures over the entities they contain, calls for a transformation of traditional logical frameworks. I argue that Univalent Foundations…

History and Philosophy of Physics · Physics 2024-07-22 Lu Chen

Multiple types can represent the same concept. For example, lists and trees can both represent sets. Unfortunately, this easily leads to incomplete libraries: some set-operations may only be available on lists, others only on trees.…

Programming Languages · Computer Science 2025-03-19 Kevin Kappelmann

We investigate the injective types and the algebraically injective types in univalent mathematics, both in the absence and in the presence of propositional resizing. Injectivity is defined by the surjectivity of the restriction map along…

Category Theory · Mathematics 2020-03-10 Martín Hötzel Escardó

We prove the existence of families of distinct isotopy classes of physical unknots through the key concept of parametrised thickness. These unknots have prescribed length, tube thickness, a uniform bound on curvature, and cannot be…

Geometric Topology · Mathematics 2025-06-06 José Ayala

Homotopy type theory is a version of Martin-L\"of type theory taking advantage of its homotopical models. In particular, we can use and construct objects of homotopy theory and reason about them using higher inductive types. In this…

Algebraic Topology · Mathematics 2017-04-20 Ulrik Buchholtz , Egbert Rijke
‹ Prev 1 4 5 6 7 8 10 Next ›