Related papers: Theorems of Alternatives for Substructural Logics
This note serves two purposes. Firstly, we construct a counterexample to show that the statement on the convergence of the alternating direction method of multipliers (ADMM) for solving linearly constrained convex optimization problems in a…
This work presents the deductive system Double Propositional Logic, LD, along with the semantics of possible worlds that characterize it. LD includes an alternate affirmation operator and an alternate negation operator and is not valid for…
We intend to investigate the metalogical property of 'omitting types' for a wide variety of quantifier logics (that can also be seen as multimodal logics upon identifying existential quantifiers with modalities syntactically and…
We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
Propositional logic serves as a fundamental cornerstone in mathematical logic. This paper delves into a semiring characterization of propositional logic, employing the Gr\"oebner-Shirshov basis theory to furnish an algebraic framework for…
This paper is mainly devoted to a structure study of Hom-alternative algebras . Equivalent conditions for Hom-alternative algebras being solvable, simple and semi-simple are displayed. Moreover some results about Hom-alternative bimodule…
Taking an algebraic perspective on the basic structures of Rough Concept Analysis as the starting point, in this paper we introduce some varieties of lattices expanded with normal modal operators which can be regarded as the natural rough…
I defend my arguments in quant-ph/9806002, which have recently been criticized by L. Vaidman (quant-ph/9811092). I emphasize that the correct usage of the ABL rule applies not to a genuine counterfactual statement but rather to a…
The paper investigates from a proof-theoretic perspective various non-contractive logical systems circumventing logical and semantic paradoxes. Until recently, such systems only displayed additive quantifiers (Gri\v{s}in, Cantini). Systems…
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
We study Polynomial Lawvere logic PL, a logic defined over the Lawvere quantale of extended positive reals with sum as tensor, to which we add multiplication, thereby obtaining a semiring structure. PL is designed for complex quantitative…
A series of associative algebras $A_n(V)$ for a vertex operator algebra $V$ over an arbitrary algebraically closed field and nonnegative integers $n$ are constructed such that there is a one to one correspondence between irreducible…
Implementations of known reductions of the Strong Real Jacobian Conjecture (SRJC), to the case of an identity map plus cubic homogeneous or cubic linear terms, and to the case of gradient maps, are shown to preserve significant algebraic…
We use the notion of generalized connection over a bundle map in order to present an alternative approach to sub-Riemannian geometry. Known concepts, such as normal and abnormal extremals, will be studied in terms of this new formalism. In…
Demailly, Ein and Lazarsfeld \cite{DEL} proved the subadditivity theorem for multiplier ideals, which states the multiplier ideal of the product of ideals is contained in the product of the individual multiplier ideals, on non-singular…
Recently, data abstraction has been studied in the context of separation logic, with noticeable practical successes: the developed logics have enabled clean proofs of tricky challenging programs, such as subject-observer patterns, and they…
A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e.…
One advantage of paraconsistent logic is that it can deal with inconsistencies without making the system trivial. However, unlike classical propositional calculus, its deductive system is limited, and the meaning of paraconsistent negation…
In this paper we introduce modules over both left and right Hom-alternative algebras. We give some constructions of left and right Hom-alternative modules and give various properties of both, as well as examples. Then, we prove that…