Related papers: Equivariant ZFA and the foundations of nominal tec…
We offer an introduction for mathematicians to the univalent foundations of Vladimir Voevodsky, aiming to explain how he chose to encode mathematics in type theory and how the encoding reveals a potentially viable foundation for all of…
The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…
We study the topological complexity of sets defined using Khovanskii's Pfaffian functions, in terms of an appropriate notion of format for those sets. We consider semi- and sub-Pfaffian sets, but more generally any definable set in the…
We are interested in investigating some definitions and assumptions stated in [4], in particular the notions of measurability and atomicity that the two authors used in order to give a representation for multiplicative linear functionals…
Ten years ago, it was shown that nominal techniques can be used to design coalgebraic data types with variable binding, so that alpha-equivalence classes of infinitary terms are directly endowed with a corecursion principle. We introduce…
In the traditional Katz-Vafa method, matter representations are determined by decomposing the adjoint representation of a parent simple Lie algebra $\mathfrak{m}$ as the direct sum of irreducible representations of a semisimple subalgebra…
These pedagogical lectures present some material, classical or more recent, on (Rational) Conformal Field Theories and their general setting ``in the bulk'' or in the presence of a boundary. Two well posed problems are the classification of…
CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…
Given a Stirling permutation w, we introduce the mesa set of w as the natural generalization of the pinnacle set of a permutation. Our main results characterize admissible mesa sets and give closed enumerative formulas in terms of rational…
The theory of finitely supported algebraic structures represents a reformulation of Zermelo-Fraenkel set theory in which every construction is finitely supported according to the action of a group of permutations of some basic elements…
We show how one may establish proof-theoretic results for constructive Zermelo-Fraenkel set theory, such as the compactness rule for Cantor space and the Bar Induction rule for Baire space, by constructing sheaf models and using their…
In 1966, Mal'cev proved that a class $\mathcal{K}$ of first-order structures with a specified signature is a quasivariety if and only if $\mathcal{K}$ contains a unit and is closed under isomorphisms, substructures, and reduced products. In…
We define an extension of the simply-typed lambda calculus where two different binding mechanisms, by position and by name, nicely coexist. In the former, as in standard lambda calculus, the matching between parameter and argument is done…
In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…
A new analytic framework is first formalized via the usage of the Monadology (Leibniz 1898), to expand the understanding of Zermelo-Fraenkel-choice set theory (ZFC) and Von Neumann-Bernays-Godel set theory (NBG). Implicitly, the framework…
We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…
The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…
In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.
In this article we introduce Variable exponent Fock spaces and study some of their basic properties such as the boundedness of evaluation functionals, density of polynomials, boundedness of a Bergman-type projection and duality.
We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…