Related papers: Theorems of Alternatives for Substructural Logics

We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…

Existence theorem is proven for the generating equations of the split involution constraint algebra. The structure of the general solution is established, and the characteristic arbitrariness in generating functions is described.

We prove that there exist rational but not uniformly rational smooth algebraic varieties. The proof is based on computing a certain numerical obstruction developed in the case of compactifications of affine spaces. We show that for some…

Non-classical generalizations of classical modal logic have been developed in the contexts of constructive mathematics and natural language semantics. In this paper, we discuss a general approach to the semantics of non-classical modal…

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

We study \L o\'s's theorem in a choiceless context. We introduce some variants of \L o\'s's theorem. These variants seem weaker than \L o\'s's theorem, but we prove that these are equivalent to \L o\'s's theorem.

Using an alternative notion of good reduction, an analog of the Shafarevich theorem for elliptic curves is proved for morphisms of the projective line over number fields.

Suppose that G is a finite group and A is a subset of G such that 1_A has algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of subgroups of G, and L can be taken to be triply tower in O(M). This is a quantitative…

The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such…

In this short note we give an alternative proof of Glivenko's Theorem, stating that a formula $\phi$ is provable in classical propositional logic if and only if $\neg\neg\phi$ is provable in intuitionistic propositional logic. We work in…

We consider a model where an agent is must choose between alternatives that each provide only an imprecise description of the world (e.g. linguistic expressions). The set of alternatives is closed under logical conjunction and disjunction,…

We describe a new method of finding interpolants for classical logic using certain refutation system as a starting point. Refutation can be thought of as an alternative approach to the analysis of formal systems: instead of focusing on…

We prove the Tree Alternative Conjecture for the topological minor relation: letting $[T]$ denote the equivalence class of $T$ under the topological minor relation we show that: $|[T]| = 1$ or $|[T]|\geq \aleph_0$ and $\forall r\in V(T)$,…

We prove Abhyankar's Inertia Conjecture for the alternating group A_{p+2} on p+2 letters when p = 2 mod 3, by showing that every possible inertia group occurs for a (wildly ramified) A_{p+2}-Galois cover of the projective k-line branched…

In this paper, we intend to revisit Theorem 2 of [3] formulating it in a way that, weakening the hypotheses and, at the same time, highlighting the richer conclusion allowed by the proof, it can potentially be applicable to a broader range…

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

In R.D. Sorkin's framework for logic in physics a clear separation is made between the collection of unasserted propositions about the physical world and the affirmation or denial of these propositions by the physical world. The unasserted…

Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups. To do so, the…

We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…