相关论文: An Intermediate Logic Contained in Medvedev's Logi…
In this first of two papers, we explain in detail the simplest example of a broader set of relations between apparently very different theories. Our example relates $\mathfrak{su}(2)$ $\mathcal{N}=4$ super Yang-Mills (SYM) to a theory we…
We review a minimum set of notions from our previous paper on structural properties of SAT at arXiv:0802.1790 that will allow us to define and discuss the "complete internal independence" of a decision problem. This property is strictly…
Matching logic is a general formal framework for reasoning about a wide range of theories, with particular emphasis on programming language semantics. Notably, the intermediate language of the K semantics framework is an extension of…
Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…
Considering the general linear Lie superalgebra $\mathfrak{gl}(m|n)=\mathfrak{gl}(m|n)_{\bar{\bar 0}}\oplus \mathfrak{gl}(m|n)_{\bar{\bar 1}}$ over $\mathbb{C}$, we first formulate a super version of Vust theorem associated with a principal…
The paper explores properties of {\L}ukasiewicz mu-calculus, a version of the quantitative/probabilistic modal mu-calculus containing both weak and strong conjunctions and disjunctions from {\L}ukasiewicz (fuzzy) logic. We show that this…
We introduce an infinitary first order linear logic with least and greatest fixed points. To ensure cut elimination, we impose a validity condition on infinite derivations. Our calculus is designed to reason about rich signatures of…
We study the finite model property of subframe logics with expressible transitive reflexive closure modality. For $m>0$, let $\mathrm{L}_m$ be the logic defined by axiom $\lozenge^{m+1} p\to \lozenge p\vee p$. We construct filtrations for…
Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
In this paper, we present a new necessary and sufficient condition for which the supremum exists with respect to the logic order. Moreover, we give out a new and much simpler representation of the supremum with respect to the order, our…
Dummett's logic LC is intuitionistic logic extended with Dummett's axiom: for every two statements the first implies the second or the second implies the first. We present a natural deduction and a Curry-Howard correspondence for…
A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…
Cubical type theory provides a constructive justification to certain aspects of homotopy type theory such as Voevodsky's univalence axiom. This makes many extensionality principles, like function and propositional extensionality, directly…
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…
We suggest an alternative approach to deconfine N =1 SU(N) supersymmetric gauge theory with a symmetric tensor, fundamentals, anti-fundamentals, and no superpotential. It is found that although the dual prescription derived by this new…
We give a transport proof of a discrete version of the displacement convexity of entropy on integers (Z), and get, as a consequence, two discrete forms of the Pr{\'e}kopa-Leindler Inequality : the Four Functions Theorem of Ahlswede and…
Utility representations of preference relations in symmetric topological spaces have the advantage of fully characterising these relations. But, this is not true in the case of representations of preference relations that are mostly…
Combining higher-order abstract syntax and (co)induction in a logical framework is well known to be problematic. Previous work described the implementation of a tool called Hybrid, within Isabelle HOL, which aims to address many of these…
We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where the…