相关论文: Notions of Anonymous Existence in Martin-L\"of Typ…

This paper continues the study of generalized amalgamation properties. Part of the paper provides a finer analysis of the groupoids that arise from failure of 3-uniqueness in a stable theory. We show that such groupoids must be abelian and…

Value independence is enormously beneficial for reasoning about software systems at scale. These benefits carry over into the world of formal verification. Reasoning about programs algebraically is a simple affair in a proof assistant,…

We adapt the notion of a (relatively) definable subset of Aut(M) when M is a saturated model to the case Aut(M/A) when M is atomic and strongly omega-homogeneous over A. We discuss the existence and uniqueness of invariant measures on the…

Formalizations of quantum information theory in category theory and type theory, for the design of verifiable quantum programming languages, need to express its two fundamental characteristics: (1) parameterized linearity and (2) metricity.…

The truncation operation facilitates the articulation and analysis of several aspects of the structure of archimedean vector lattices; we investigate two such aspects in this article. We refer to archimedean vector lattices equipped with a…

This paper is concerned with the form of typed name binding used by the FreshML family of languages. Its characteristic feature is that a name binding is represented by an abstract (name,value)-pair that may only be deconstructed via the…

We present a construction of stable diagonal factorizations, used to define categorical models of type theory with identity types, from a family of algebraic weak factorization systems on the slices of a category. Inspired by a…

We combine Homotopy Type Theory with axiomatic cohesion, expressing the latter internally with a version of "adjoint logic" in which the discretization and codiscretization modalities are characterized using a judgmental formalism of "crisp…

A canonical Lorentz invariant field theory extension of collective field theory of d=1 matrix models is presented. We show that the low density, discrete, sector of collective field theory includes single eigenvalue Euclidean instantons…

We develop a theory of adjunctions in semigroup categories, i.e. monoidal categories without a unit object. We show that a rigid semigroup category is promonoidal, and thus one can naturally adjoin a unit object to it. This extends the…

In the theory of unitary group representations, a group is called type I if all factor representations are of type I, and by a celebrated theorem of James Glimm [Gli61b], the type I groups are precisely those groups for which the…

In this note, we study the easy certificate classes introduced by Hemaspaandra, Rothe, and Wechsung, with regard to the question of whether or not surjective one-way functions exist. This is an important open question in cryptology. We show…

We initiate the study of language generation in the limit, a model recently introduced by Kleinberg and Mullainathan [KM24], under the constraint of differential privacy. We consider the continual release model, where a generator must…

This is an expostion of various aspects of amenability and paradoxical decompositions for groups, group actions and metric spaces. First, we review the formalism of pseudogroups, which is well adapted to stating the alternative of Tarski,…

In this paper, the results of part I regarding a special case of Feynman identity are extended. The sign rule for a path in terms of data encoded by its word and formulas for the numbers of distinct equivalence classes of nonperiodic paths…

The class of nonlinear integral equations on the positive half-line with a monotone operator of Hammerstein type is studied. With various partial representations of the corresponding kernel and nonlinearity, this class of equations has…

For a division ring $D$, denote by $\mathcal M_D$ the $D$-ring obtained as the completion of the direct limit $\varinjlim_n M_{2^n}(D)$ with respect to the metric induced by its unique rank function. We prove that, for any ultramatricial…

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…

In verified generic programming, one cannot exploit the structure of concrete data types but has to rely on well chosen sets of specifications or abstract data types (ADTs). Functors and monads are at the core of many applications of…

Let K be a field and F denote the prime field in K. Let \tilde{K} denote the set of all r \in K for which there exists a finite set A(r) with {r} \subseteq A(r) \subseteq K such that each mapping f:A(r) \to K that satisfies: if 1 \in A(r)…