English
Related papers

Related papers: Examples and counterexamples of injective types

200 papers

It is well known that univalence is incompatible with uniqueness of identity proofs (UIP), the axiom that all types are h-sets. This is due to finite h-sets having non-trivial automorphisms as soon as they are not h-propositions. A natural…

Logic in Computer Science · Computer Science 2020-05-04 Christian Sattler , Andrea Vezzosi

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. It is proved consistent with $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of…

Logic · Mathematics 2025-09-23 Ruihuan Mao , Guozhen Shen

Say that a cone is a commutative monoid in which x+y=0 implies that x=y=0. We show that cones (resp. simple cones) of many kinds order-embed or even embed unitarily into refinement cones (resp. simple refinement cones) of the same kind,…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

We show that if $X$ is a complete metric space with uniform relative normal structure and $G$ is a subgroup of the isometry group of $X$ with bounded orbits, then there is a point in $X$ fixed by every isometry in $G$. As a corollary, we…

Functional Analysis · Mathematics 2023-06-08 Andrzej Wiśnicki

We consider the possibility of semisimple tensor categories whose fusion rule includes exactly one noninvertible simple object. Conditions are given for the existence or nonexistence of coherent associative structures for such fusion rules,…

Quantum Algebra · Mathematics 2014-10-01 Jacob Siehler

Generalised algebraic theories (GATs) allow multiple sorts indexed over each other. For example, the theories of categories or Martin-L{\"o}f type theories form GATs. Categories have two sorts, objects and morphisms, and the latter are…

Programming Languages · Computer Science 2026-01-28 Samy Avrillon , Ambrus Kaposi , Ambroise Lafont , Niyousha Najmaei , Johann Rosain

Classify simple games into sixteen "types" in terms of the four conventional axioms: monotonicity, properness, strongness, and nonweakness. Further classify them into sixty-four classes in terms of finiteness (existence of a finite carrier)…

Computer Science and Game Theory · Computer Science 2011-07-05 Masahiro Kumabe , H. Reiju Mihara

Given a surjective ring homomorphism, we study when the induced group homomorphism on unit groups is surjective. To this end, we introduce notions of generalized inverses and units, as well as a class of rings such that the set of closed…

Commutative Algebra · Mathematics 2017-10-17 Justin Chen

We review and analyse techniques from the literature for extending a normed algebra, A to a normed algebra, B, so that B has interesting or desirable properties which A may lack. For example, B might include roots of monic polynomials over…

Functional Analysis · Mathematics 2007-05-23 Thomas William Dawson

Monoids generated by elements of order two appear in numerous places in the literature. For example, Coxeter reflection groups in geometry, Kuratowski monoids in topology, various monoids generated by regular operations in language theory…

Group Theory · Mathematics 2024-02-02 Pascal Caron , Jean-Gabriel Luque , Bruno Patrou

We study the geometry of algebraic monoids. We prove that the group of invertible elements of an irreducible algebraic monoid is an algebraic group, open in the monoid. Moreover, if this group is reductive, then the monoid is affine. We…

Algebraic Geometry · Mathematics 2007-05-23 A. Rittatore

A partition of the set of unary pp formulas into four regions is presented, which has a bearing on various structural properties of modules. The machinery developed allows for applications to IF, weakly coherent, nonsingular, and reduced…

Rings and Algebras · Mathematics 2021-11-04 Philipp Rothmaler

A monoid $M$ is called surjunctive if every injective cellular automata with finite alphabet over $M$ is surjective. We show that all finite monoids, all finitely generated commutative monoids, all cancellative commutative monoids, all…

Dynamical Systems · Mathematics 2015-09-01 Tullio Ceccherini-Silberstein , Michel Coornaert

We introduce judgemental theories and their calculi as a general framework to present and study deductive systems. As an exemplification of their expressivity, we approach dependent type theory and natural deduction as special kinds of…

Logic · Mathematics 2024-11-04 Greta Coraglia , Ivan Di Liberti

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the…

Logic in Computer Science · Computer Science 2015-07-01 Benjamin Werner

Containers represent a wide class of type constructions relevant for functional programming and (co)inductive reasoning. Indexed containers generalize this notion to better fit the scope of dependently typed programming. When interpreting…

Logic in Computer Science · Computer Science 2025-10-01 Michele De Pascalis , Tarmo Uustalu , Niccolò Veltrì

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

Category Theory · Mathematics 2019-11-28 Soichiro Fujii

We introduce the notion of Kan injectivity in 2-categories and study its properties. For an adequate 2-category $\mathcal{K}$, we show that every set of morphisms $\mathcal{H}$ induces a KZ-pseudomonad on $\mathcal{K}$ whose 2-category of…

Category Theory · Mathematics 2025-10-16 Ivan Di Liberti , Gabriele Lobbia , Lurdes Sousa

Consider a finite morphism f:X -> Y of smooth projective varieties over a finite field k. Suppose X is the vanishing locus in projective N-space of at most r forms of degree at most d. We show there is a constant C, depending only on N, r,…

Algebraic Geometry · Mathematics 2020-02-27 Jeff Achter

We give a model of dependent type theory with one univalent universe and propositional truncation interpreting a type as a stack, generalising the groupoid model of type theory. As an application, we show that countable choice cannot be…

Logic in Computer Science · Computer Science 2017-04-21 Thierry Coquand , Bassel Mannaa , Fabian Ruch
‹ Prev 1 8 9 10 Next ›