Related papers: Lifschitz Realizability as a Topological Construct…
We construct positive-genus analogues of Welschinger's invariants for many real symplectic manifolds, including the odd-dimensional projective spaces and the renowned quintic threefold. In some cases, our invariants provide lower bounds for…
We study the notion of structured realizability for linear systems defined over graphs. A stabilizable and detectable realization is structured if the state-space matrices inherit the sparsity pattern of the adjacency matrix of the…
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus. This allows a direct interpretation of classical proofs, avoiding the usual negative translation to…
We prove solvability theorems for relaxed one-sided Lipschitz multivalued mappings in Hilbert spaces and for composed mappings in the Gelfand triple setting. From these theorems, we deduce properties of the inverses of such mappings and…
Within Bishop-style constructive mathematics we study the classical McShane-Whitney theorem on the extendability of real-valued Lipschitz functions defined on a subset of a metric space. Using a formulation similar to the formulation of…
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
We study topological realizations of countable Borel equivalence relations, including realizations by continuous actions of countable groups, with additional desirable properties. Some examples include minimal realizations on any perfect…
The purpose of this paper is to describe an analogue of a construction of Costello in the context of finite-dimensional differential graded Frobenius algebras which produces closed forms on the decorated moduli space of Riemann surfaces. We…
We show that the Lipschitz shadowing property of a diffeomorphism is equivalent to structural stability. As a corollary, we show that an expansive diffeomorphism having the Lipschitz shadowing property is Anosov.
The reconstruction theorem, a cornerstone of Martin Hairer's theory of regularity structures, appears in this article as the unique extension of the explicitly given reconstruction operator on the set of smooth models due its inherent…
For a prime $p$, fusion systems over discrete $p$-toral groups are categories that model and generalize the $p$-local structure of Lie groups and certain other infinite groups in the same way that fusion systems over finite $p$-groups model…
We prove some constructive results that on first and maybe even on second glance seem impossible.
We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.
We give a general construction of topological groups from combinatorial structures such as trees, towers, gaps, and subadditive functions. We connect topological properties of corresponding groups with combinatorial properties of these…
We study $\Sigma^1_2$ definable counterparts for some algebraic equivalent forms of the Continuum Hypothesis. All turn out to be equivalent to "all reals are constructible".
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
Lov\'asz Local Lemma (LLL) is a probabilistic tool that allows us to prove the existence of combinatorial objects in the cases when standard probabilistic argument does not work (there are many partly independent conditions). LLL can be…
We construct lattices on six dimensional not completely solvable almost abelian Lie groups, for which the Mostow condition does not hold. For the corresponding compact quotients, we compute the de Rham cohomology (which does not agree in…
We propose a natural theory SO axiomatizing the class of sets of ordinals in a model of ZFC set theory. Both theories possess equal logical strength. Constructibility theory in SO corresponds to a natural recursion theory on ordinals.
We present a new type system with support for proofs of programs in a call-by-value language with control operators. The proof mechanism relies on observational equivalence of (untyped) programs. It appears in two type constructors, which…