English
Related papers

Related papers: An introduction to univalent foundations for mathe…

200 papers

These notes are intended to provide a self-contained introduction to the basic ideas of finite dimensional Batalin-Vilkovisky (BV) formalism and its applications. A brief exposition of super- and graded geometries is also given. The…

Quantum Algebra · Mathematics 2011-12-15 Jian Qiu , Maxim Zabzine

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

We develop algebraic models of simple type theories, laying out a framework that extends universal algebra to incorporate both algebraic sorting and variable binding. Examples of simple type theories include the unityped and simply-typed…

Logic in Computer Science · Computer Science 2020-07-01 Nathanael Arkor , Marcelo Fiore

It is a well-known theorem of homotopy type theory, originally due to Voevodsky, that function extensionality holds inside any univalent universe. We consider a weaker variant of the univalence axiom, asserting that the wild category formed…

Logic in Computer Science · Computer Science 2026-05-04 Evan Cavallo , Jonas Höfer

This primer is intended as an introduction to differential forms, a central object in modern mathematical physics, for scientists and engineers.

Mathematical Physics · Physics 2012-06-18 Christian Lessig

This paper makes a modest contribution to the family of starlike univalent mappings in the open unit disk, by the introduction of some new subclasses of them via certain convolution operators. A new univalence condition is given with…

Complex Variables · Mathematics 2010-04-16 K. O. Babalola

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

Logic in Computer Science · Computer Science 2024-04-24 Thaynara Arielly de Lima , Andréia Borges Avelar , André Luiz Galdino , Mauricio Ayala-Rincón

We give a short introduction to the theory of modular metric spaces. This is a corrected version of the paper [1], which had some errors. We are grateful to V. V. Chistyakov for bringing these to our attention.

Functional Analysis · Mathematics 2022-03-24 Hana Abobaker , Raymond A. Ryan

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 2023-09-29 Tom de Jong

This text is devoted to the theory of varieties, which provides an important tool, based in universal algebra, for the classification of regular languages. In the introductory section, we present a number of examples that illustrate and…

Formal Languages and Automata Theory · Computer Science 2021-11-19 Howard Straubing , Pascal Weil

The recent trend in mathematics is towards a framework of abstract mathematical objects, rather than the more concrete approach of explicitly defining elements which objects were thought to consist of. A natural question to raise is whether…

Logic · Mathematics 2013-12-24 Benjamin Horowitz

C-systems were defined by Cartmell as the algebraic structures that correspond exactly to generalised algebraic theories. B-systems were defined by Voevodsky in his quest to formulate and prove an initiality conjecture for type theories.…

Category Theory · Mathematics 2025-02-12 Benedikt Ahrens , Jacopo Emmenegger , Paige Randall North , Egbert Rijke

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

Logic · Mathematics 2018-07-09 Ulrik Buchholtz

In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is highly challenging to implement this technique in proof…

Logic in Computer Science · Computer Science 2015-09-11 Paolo Torrini , Tom Schrijvers

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

Isaak Moiseevich Yaglom deduced complete classification of geometric spaces. In this work, supposed to your attention, author formalizes Yaglom's approach and constructs uniform theory of geometric spaces on analytic level. Among its…

Metric Geometry · Mathematics 2018-07-31 Alexander Popa

Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories and other structures in (higher) category theory. Here, we…

Logic in Computer Science · Computer Science 2023-08-17 Kobe Wullaert , Ralph Matthes , Benedikt Ahrens

We discuss how canonical and universal constructions, properties and characterizations interact with equality in the framework of Homotopy Type Theory, comparing it with Grothendieck's use of equality and shedding further light on…

Logic · Mathematics 2026-04-02 Thomas Eckl

Increasing attention is being focussed on the use of symmetry-adapted functions to describe magnetic structures, structural distortions, and incommensurate crystallography. Though the calculation of such functions is well developed,…

Materials Science · Physics 2016-10-04 Zoso Davies , Andrew Wills

We give a model of set theory based on multisets in homotopy type theory. The equality of the model is the identity type. The underlying type of iterative sets can be formulated in Martin-L\"of type theory, without Higher Inductive Types…

Logic · Mathematics 2020-07-08 Håkon Robbestad Gylterud
‹ Prev 1 3 4 5 6 7 10 Next ›