English
Related papers

Related papers: On Small Types in Univalent Foundations

200 papers

We investigate predicative aspects of order theory in constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work…

Logic · Mathematics 2021-04-22 Tom de Jong , Martín Hötzel Escardó

We develop domain theory in constructive univalent foundations without Voevodsky's resizing axioms. In previous work in this direction, we constructed the Scott model of PCF and proved its computational adequacy, based on directed complete…

Logic · Mathematics 2022-06-16 Tom de Jong , Martín Hötzel Escardó

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

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

We develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume…

Logic in Computer Science · Computer Science 2025-09-03 Tom de Jong , Martín Hötzel Escardó

We construct a model of cubical type theory with a univalent and impredicative universe in a category of cubical assemblies. We show that this impredicative universe in the cubical assembly model does not satisfy a form of propositional…

Logic in Computer Science · Computer Science 2019-11-19 Taichi Uemura

The Univalence Principle is the statement that equivalent mathematical structures are indistinguishable. We prove a general version of this principle that applies to all set-based, categorical, and higher-categorical structures defined in a…

Category Theory · Mathematics 2022-08-31 Benedikt Ahrens , Paige Randall North , Michael Shulman , Dimitris Tsementzis

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov

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 study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is true in a finite partially ordered set (in short, a poset).…

Logic in Computer Science · Computer Science 2014-05-13 Simone Bova , Robert Ganian , Stefan Szeider

Stone locales together with continuous maps form a coreflective subcategory of spectral locales and perfect maps. A proof in the internal language of an elementary topos was previously given by the second-named author. This proof can be…

Logic in Computer Science · Computer Science 2025-08-13 Igor Arrieta , Martín Hötzel Escardó , Ayberk Tosun

We develop locale theory constructively and predicatively in univalent foundations (UF), with a particular focus on the theory of spectral and Stone locales. In the context of UF, predicativity refers specifically to the development of…

Logic in Computer Science · Computer Science 2026-03-03 Ayberk Tosun

In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…

Metric Geometry · Mathematics 2020-09-18 John R. Burke

Let $(P,\leq)$ be a finite poset (partially ordered set), where $P$ has cardinality $n$. Consider linear extensions of $P$ as permutations $x_1x_2\cdots x_n$ in one-line notation. For distinct elements $x,y\in P$, we define…

Combinatorics · Mathematics 2018-02-02 Emily J. Olson , Bruce E. Sagan

We prove that partially ordered set has finite number of finite-dimensional indecomposable nonequivalent Hilbert representations with orthoscalarity condition if and anly if it has finite number of indecomposable linear representations. We…

Representation Theory · Mathematics 2010-06-17 Roman Grushevoi , Kostyantyn Yusenko

The commutative and homological algebra of modules over posets is developed, as closely parallel as possible to the algebra of finitely generated modules over noetherian commutative rings, in the direction of finite presentations, primary…

Commutative Algebra · Mathematics 2020-08-13 Ezra Miller

It is well-known that relatively pseudocomplemented lattices can serve as an algebraic semantics of intuitionistic logic. To extend the concept of relative pseudocomplementation to non-distributive lattices, the first author introduced…

Logic · Mathematics 2021-08-24 Ivan Chajda , Helmut Länger

We present Voevodsky's construction of a model of univalent type theory in the category of simplicial sets. To this end, we first give a general technique for constructing categorical models of dependent type theory, using universes to…

Logic · Mathematics 2026-02-06 Chris Kapulkin , Peter LeFanu Lumsdaine

A visceral structure on M is given by a definable base for a uniform topology on its universe in which all basic open sets are infinite and any infinite definable subset X of M has non-empty interior. This context includes o-minimal ordered…

Logic · Mathematics 2021-10-15 Alfred Dolich , John Goodrick

Every partial applicative structure gives rise to an indexed binary relation, that is a contravariant functor from the category of sets to the category of sets endowed with binary relations and maps preserving them. In this paper we…

Logic · Mathematics 2022-11-22 Samuele Maschio
‹ Prev 1 2 3 10 Next ›