Related papers: Compactness in Constructive Mathematics via Affine…

We review some basic facts on vector fields, in the complex-analytic setting, thus, obtaining a rationality result and an extension of the Birkhoff-Grothendieck theorem, as follows: (1) Let $Z$ be a compact complex manifold endowed with a…

A common problem in various applications is the additive decomposition of the output of a function with respect to its input variables. Functions with binary arguments can be axiomatically decomposed by the famous Shapley value. For the…

We use intuitive results from algebraic topology and intersection theory to clarify the pullback action on cohomology by compositions of rational maps. We use these techniques to prove a simple sufficient criterion for functoriality of a…

We show that intuitionistic logic is deductively equivalent to Connexive Heyting Logic (CHL), hereby introduced as an example of a strong connexive logic with intuitive semantics. We use the reverse algebraisation paradigm: CHL is presented…

Hybrid logic is a modal logic with additional operators specifying nominals and is highly expressive. For example, there is no formula corresponding to the irreflexivity of Kripke frames in basic modal logic, but there is in hybrid logic.…

Cumulative logics are studied in an abstract setting, i.e., without connectives, very much in the spirit of Makinson's early work. A powerful representation theorem characterizes those logics by choice functions that satisfy a weakening of…

In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…

We study functions of least gradient as well as related superminimizers and solutions of obstacle problems in metric spaces that are equipped with a doubling measure and support a Poincar\'e inequality. We show a standard weak Harnack…

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of…

Focusing, introduced by Jean-Marc Andreoli in the context of classical linear logic, defines a normal form for sequent calculus derivations that cuts down on the number of possible derivations by eagerly applying invertible rules and…

The conjugacy of split Cartan subalgebras in the finite dimensional simple case (Chevalley) and in the symmetrizable Kac-Moody case (Peterson-Kac) are fundamental results of the theory of Lie algebras. Among the Kac-Moody Lie algebras the…

Subresiduated lattices were introduced during the decade of 1970 by Epstein and Horn as an algebraic counterpart of some logics with strong implication previously studied by Lewy and Hacking. These logics are examples of subuintuitionistic…

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…

We adapt methods from the theory of complex semisimple Lie algebras to develop a root theory for a class of simple $\mathbb{Z}_2 \times \mathbb{Z}_2$-graded (color) Lie algebras, which we call basic. As an application, assuming that the…

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

We give a new proof of a theorem of Mints that the positive fragment of minimal predicate logic is decidable. The idea of the proof is to replace the eigenvariable condition of sequent calculus by an appropriate scoping mechanism. The…

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

In this paper, we use purely complex analytic techniques to prove two results of the first author which were hitherto given only probabilistic proofs. A general form of the Phragm\'en-Lindel\"of principle states that if the…