English
Related papers

Related papers: A topological reading of inductive and coinductive…

200 papers

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…

Logic in Computer Science · Computer Science 2026-02-10 Sam Speight , Niels van der Weide

The authors establish a relation of the theory of varieties with degenerate Gauss maps in projective spaces with the theory of congruences and pseudocongruences of subspaces and show how these two theories can be applied to the construction…

Differential Geometry · Mathematics 2007-05-23 Maks A. Akivis , Vladislav V. Goldberg , Arto V. Chakmazyan

Let $A$ be a commutative and unital $\mathbb{R}$-algebra, and $M$ be an Archimedean quadratic module of $A$. We define a submultiplicative seminorm $\|\cdot\|_M$ on $A$, associated with $M$. We show that the closure of $M$ with respect to…

Functional Analysis · Mathematics 2014-03-28 Mehdi Ghasemi

We show that both the $\infty$-category of $(\infty, \infty)$-categories with inductively defined equivalences, and with coinductively defined equivalences, satisfy universal properties with respect to weak enrichment in the sense of Gepner…

Category Theory · Mathematics 2024-09-24 Zach Goldthorpe

These notes offer a lightening introduction to topological quantum field theory in its functorial axiomatisation, assuming no or little prior exposure. We lay some emphasis on the connection between the path integral motivation and the…

Quantum Algebra · Mathematics 2020-07-08 Nils Carqueville , Ingo Runkel

In this paper we present mutual coinduction as a dual of mutual induction and also as a generalization of standard coinduction. In particular, we present a precise formal definition of mutual induction and mutual coinduction. In the process…

Logic in Computer Science · Computer Science 2019-07-30 Moez A. AbdelGawad

This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos,…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

We give a new criterion guaranteeing existence of model structures left-induced along a functor admitting both adjoints. This works under the hypothesis that the functor induces idempotent adjunctions at the homotopy category level. As an…

Category Theory · Mathematics 2022-10-25 Philip Hackney , Martina Rovelli

Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…

Logic in Computer Science · Computer Science 2022-11-04 Christian Williams , Michael Stay

To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are…

Logic in Computer Science · Computer Science 2015-07-01 Gianluigi Bellin

Let $H$ be a pointed Hopf algebra with abelian coradical. Let $A\supseteq B$ be left (or right) coideal subalgebras of $H$ that contain the coradical of $H$. We show that $A$ has a PBW basis over $B$, provided that $H$ satisfies certain…

Quantum Algebra · Mathematics 2024-02-27 G. -S. Zhou

In this work, we study the notions of relative comonad and comodule over a relative comonad, and use these notions to give a terminal coalgebra semantics for the coinductive type families of streams and of infinite triangular matrices,…

Logic in Computer Science · Computer Science 2014-04-23 Benedikt Ahrens , Régis Spadotti

We prove a version of the Manin-Mumford conjecture for semiabelian varieties over fields of positive characteristic. The proof presented here contains the details of the proof sketched by the author in the article "Diophantine geometry from…

Algebraic Geometry · Mathematics 2007-05-23 Thomas Scanlon

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

Logic · Mathematics 2013-12-25 Saharon Shelah

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

We construct a category $\OrdFor$ as an arboreal extension of $\Delta_{\mathrm{epi}}\subseteq\Delta$, whose morphisms are ordered forests composed by grafting. We define a full functor $\pi\colon \OrdFor\to\Delta_{\mathrm{epi}}^{op}$…

Algebraic Topology · Mathematics 2026-04-03 Atabey Kaygun

We develop domain theory in constructive and predicative univalent foundations (also known as homotopy type theory). That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive…

Logic in Computer Science · Computer Science 2024-07-19 Tom de Jong

Extending G\"odel's \emph{Dialectica} interpretation, we provide a functional interpretation of classical theories of positive arithmetic inductive definitions, reducing them to theories of finite-type functionals defined using transfinite…

Logic · Mathematics 2009-02-17 Jeremy Avigad , Henry Towsner

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…

Logic · Mathematics 2015-10-23 Nicolai Kraus