Related papers: Theorems of Alternatives for Substructural Logics
For finite-dimensional linear semigroups which leave a proper cone invariant it is shown that irreducibility with respect to the cone implies the existence of an extremal norm. In case the cone is simplicial a similar statement applies to…
In this paper, we propose non-commutative analogues of infimum and supremum with the help of algebraic orthogonality.
We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…
The classical Artin--Whaples approximation theorem allows to simultaneously approximate finitely many different elements of a field with respect to finitely many pairwise inequivalent absolute values. Several variants and generalizations…
In this paper, we address the problem of change in an abstract argumentation system. We focus on a particular change: the addition of a new argument which interacts with previous arguments. We study the impact of such an addition on the…
We consider Delone sets with finite local complexity. We characterize validity of a subadditive ergodic theorem by uniform positivity of certain weights. The latter can be considered to be an averaged version of linear repetitivity. In this…
This work is motivated by a paper of Davenport and Schmidt, which treats the question of when Dirichlet's theorems on the rational approximation of one or of two irrationals can be improved and if so, by how much. We consider a…
A theorem, usually attributed to Barr, yields that (A) geometric implications deduced in classical L_{\infty\omega} logic from geometric theories also have intuitionistic proofs. Barr's theorem is of a topos-theoretic nature and its proof…
We study the lattice of extensions of four-valued Belnap--Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and…
We provide a new realisability model based on orthogonality for the multiplicative fragment of linear logic, both in presence of generalised axioms (MLL*) and in the standard case (MLL). The novelty is the definition of cut elimination for…
Non-Archimedean mathematics (in particular, nonstandard analysis) allows to construct some useful models to study certain phenomena arising in PDE's; for example, it allows to construct generalized solutions of differential equations and…
Assumption-based Argumentation (ABA) is a well-known structured argumentation formalism, whereby arguments and attacks between them are drawn from rules, defeasible assumptions and their contraries. A common restriction imposed on ABA…
We explain how the Riemann-Roch theorem for divisors on an abelian variety $A$ is related to the reduced norms of the Wedderburn components of $\operatorname{End}^0(A)$ the $\mathbb{Q}$-endomorphism algebra of $A$. We then describe…
In this note we refine the alternativity in some bifurcation theorems of Rabinowitz type, and then improve a few of results in Lu (2022) [17].
We revisit Haagerup's enigmatic reduction theorem \cite[Theorems 2.1 \& 3.1]{HJX} showing how that theorem may be extended to general von Neumann algebras $\M$ equipped with an arbitrary faithful normal semifinite weight in a manner which…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
In this paper we derive structure theorems that characterize the spaces of linear and non-linear differential operators that preserve finite dimensional subspaces generated by polynomials in one or several variables. By means of the useful…
In this paper, we introduce a family of topological spaces that captures the existence of preservation theorems. The structure of those spaces allows us to study the relativisation of preservation theorems under suitable definitions of…
Variational analysis provides the theoretical foundations and practical tools for constructing optimization algorithms without being restricted to smooth or convex problems. We survey the central concepts in the context of a concrete but…
This paper presents four theorems that connect continuity postulates in mathematical economics to solvability axioms in mathematical psychology, and ranks them under alternative supplementary assumptions. Theorem 1 connects notions of…