Related papers: Theorems of Alternatives for Substructural Logics

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

We use a simple geometric argument and small cancellation properties of link groups to prove that alternating links are non-trivial. This proof uses only classic results in topology and combinatorial group theory.

Cut-elimination is the bedrock of proof theory with a multitude of applications from computational interpretations to proof analysis. It is also the starting point for important meta-theoretical investigations including decidability,…

A geometric approach to Sundman transformation defined by basic functions for systems of second-order differential equations is developed and the necessity of a change of the tangent structure by means of the function defining the Sundman…

In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…

A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…

We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…

We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…

We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

It is shown that every multiplicative right Hom-alternative algebra is both Hom-power associative and Hom-Jordan admissible. Multiplicative right Hom-alternative algebras admit Albert-type decompositions with respect to idempotents.…

There is a unique variant of Absolute Parallelism, which is very simple as it has no free parameters: nothing (nor D=5) can be changed if to keep the theory safe from emerging singularities of solutions. On the contrary, eternal solutions…

We present an auxiliary space theory that provides a unified framework for analyzing various iterative methods for solving linear systems that may be semidefinite. By interpreting a given iterative method for the original system as an…

We establish an arithmeticity vs. non-linearity alternative for irreducible lattices in suitable product groups, such as for instance products of topologically simple groups. This applies notably to a (large class of) Kac-Moody groups. The…

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

We prove several basic extension theorems for reductive group schemes. We also prove that each Lie algebra with a perfect Killing form over a commutative $\dbZ$-algebra, is the Lie algebra of an adjoint group scheme.

This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs…

This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…