Related papers: A logical implication between two conjectures on m…
Given two finite matroids on the same ground set, a celebrated result of Edmonds says that the ground set can be partitioned into two disjoint subsets in a manner that there is a common independent set in both matroids whose intersection…
We consider field theory side of new multiple Seiberg dualities conjectured within superconformal index matching approach. We study the case of SU(2) supersymmetric QCD and find that the numerous conjectured duals are different faces of…
I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…
Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this…
The permanent versus determinant conjecture is a major problem in complexity theory that is equivalent to the separation of the complexity classes VP_{ws} and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a…
By the Choi matrix criteria it is easy to determine if a specific linear matrix map is completely positive, but to establish whether a linear matrix map is positive is much less straightforward. In this paper we consider classes of linear…
The paper studies hereditarily complete superintuitionistic deductive systems, that is, the deductive system which logic is an extension of the intuitionistic propositional logic. It is proven that for deductive systems a criterion of…
We define a bi-directional embedding between hypersequent calculi and a subclass of systems of rules (2-systems). In addition to showing that the two proof frameworks have the same expressive power, the embedding allows for the recovery of…
This note formally defines the concept of coinductive validity of judgements, and contrasts it with inductive validity. For both notions it shows how a judgement is valid iff it has a formal proof. Finally, it defines and illustrates the…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.
Positive semidefinite Hermitian matrices that are not fully specified can be completed provided their underlying graph is chordal. If the matrix is positive definite the completion can be uniquely characterized as the matrix that maximizes…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…
In this paper we discuss contrastive explanations for formal argumentation - the question why a certain argument (the fact) can be accepted, whilst another argument (the foil) cannot be accepted under various extension-based semantics. The…
A logic is said to admit an equational completeness theorem when it can be interpreted into the equational consequence relative to some class of algebras. We characterize logics admitting an equational completeness theorem that are either…
We give one more proof of the fact that symplectic matrices over real and complex fields have determinant one. While this has already been proved many times, there has been lasting interest in finding an elementary proof. Our result is…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
We give conditions for when the tensor product of two positive maps between matrix algebras is a positive map. This happens when one map belongs to a symmetric mapping cone and the other to the dual cone. Necessary and sufficient conditions…
Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…