Related papers: The Universal Exponentiable Arrow
We classify all essential extensions of the form $$0 \rightarrow \W \rightarrow \D \rightarrow A \rightarrow 0$$ where $\W$ is the unique separable simple C*-algebra with a unique tracial state, with finite nuclear dimension and with…
The generality of a derivation is an equivalence relation on the set of occurrences of variables in its premises and conclusion such that two occurrences of the same variable are in this relation iff they must remain occurrences of the same…
We prove that persistently finite algebras are not created by completions of algebras, in any ordered discriminator variety. A persistently finite algebra is one without infinite simple extensions. We prove that finite measurable relation…
We show that the theory of derivators (or, more generally, of fibered multiderivators) on all small categories is equivalent to this theory on partially ordered sets, in the following sense: Every derivator (more generally, every fibered…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
We study versions of Goodwillie's calculus of functors for indexing diagrams other than cubes. We in particular construct universal excisive approximations for a larger class of diagrams, which yields an extension of the Taylor tower. We…
We introduce a notion of the ``explanation" of one (generalized) probabilistic model by another as particular kind of span in the category $\Prob$ of probabilistic models and morphisms. We show that explanations compose under a standard…
Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
We propose a definition of an Euler characteristic for unbounded chain complexes by taking the (usual) Euler characteristics of successively longer parts of the complex, weighted inversely proportional to the length, and passing to the…
We produce a forcing extension of the constructible universe $\bL$ in which every universally measurable set of reals is $\uTDelta^{1}_{2}$, partially answering question CG from David Fremlin's problem list. The analogous result for…
Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…
We prove that in every ring of generalised power series with non-positive real exponents and coefficients in a field of characteristic zero, every series admits a factorisation into finitely many irreducibles of infinite support, the number…
A Universal Mapping Property is generally described as a characterization of an object up to a unique isomorphism by considering its relation to every other object; however, the term "by considering its relation to every other object" is…
There exists a dispute in philosophy, going back at least to Leibniz, whether is it possible to view the world as a network of relations and relations between relations with the role of objects, between which these relations hold, entirely…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
Let $\Lambda$ be a $\mathbb{Z}$-graded artin algebra. Two classical results of Gordon and Green state that if $\Lambda$ has only finitely many indecomposable gradable modules, up to isomorphism, then $\Lambda$ has finite representation…
The goal of this paper is to explicitly describe in terms of generators and relations the universal central extension of the infinite dimensional Lie algebra, $\mathfrak{g} \otimes \mathbb{C}[t,t^{-1},u]$ with finite dimensional simple Lie…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…
We elucidate a close connection between the Theory of Judgment Aggregation (more generally, Evaluation Aggregation), and a relatively young but rapidly growing field of universal algebra, that was primarily developed to investigate…