Results 71 to 80 of about 578,113 (185)
Multirole logic and multiparty channels [PDF]
, 2017 We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles), and the notion of negation is generalized to endomorphisms on this underlying set. In
Wu, Hanwen, Xi, H.
core
Intuitionistic fixed point theories over Heyting arithmetic [PDF]
, 2010 In this paper we show that an intuitionistic theory for fixed points is conservative over the Heyting arithmetic with respect to a certain class of formulas. This extends partly the result of mine.
Arai, Toshiyasu
core
Syntactic cut-elimination for common knowledge
Annals of Pure and Applied Logic, 2009 The logic of common knowledge has been formulated by Alberucci and Jäger in a sequential system with a rule of infinite premises so as to enjoy completeness, from which then follows the cut-elimination theorem indirectly. There are also several variations of the logic formulated in cut-free sequential systems but a syntactical cut-elimination proof has
Brünnler, Kai, Studer, Thomas
openaire +2 more sources
Frontiers in PharmacologyIntroductionCucurbitacin, a class of triterpenoid compounds isolated from Pedicellus Melo, possesses various biological activities and is the primary active component of cucurbitacin tablets (CUT) used to treat chronic hepatitis and primary liver cancer.
Chun-nan Zhang +8 more
doaj +1 more source
Cut Elimination, Identity Elimination, and Interpolation in Super-Belnap Logics [PDF]
Studia Logica, 2017 We develop a Gentzen-style proof theory for super-Belnap logics (extensions of the four-valued Dunn-Belnap logic), expanding on an approach initiated by Pynko. We show that just like substructural logics may be understood proof-theoretically as logics which relax the structural rules of classical logic but keep its logical rules as well as the rules of
openaire +3 more sources
Sharpened lower bounds for cut elimination [PDF]
, 2010 We present sharpened lower bounds on the size of cut free proofs for first-order logic. Prior lower bounds for eliminating cuts from a proof established superexponential lower bounds as a stack of exponentials, with the height of the stack proportional ...
Buss, Samuel R. +1 more
core
Bulletin of the Section of LogicA many-valued modal logic, called linear abelian modal logic \(\rm {\mathbf{LK(A)}}\) is introduced as an extension of the abelian modal logic \(\rm \mathbf{K(A)}\). Abelian modal logic \(\rm \mathbf{K(A)}\) is the minimal modal extension of the logic of
Hamzeh Mohammadi
doaj +1 more source
Quick cut-elimination for strictly positive cuts
Annals of Pure and Applied Logic, 2011 In this paper we show that the intuitionistic theory for finitely many iterations of strictly positive operators is a conservative extension of the Heyting arithmetic. The proof is inspired by the quick cut-elimination due to G. Mints. This technique is also applied to fragments of Heyting arithmetic.
openaire +3 more sources
Cut elimination for the unified logic
Annals of Pure and Applied Logic, 1993 The Unified Logic, \(\text{\textbf{LU}}\), is introduced by \textit{J.-Y. Girard} [ibid. 59, 201-217 (1993; Zbl 0781.03044)]. Its sequent is of the form \(\Gamma;\Gamma'\lvdash \Delta';\Delta\), where the outer zone \(\langle\Gamma,\Delta\rangle\) has the linear logic maintenance, and the inner \(\langle\Gamma',\Delta'\rangle\) the classical one. Among
openaire +3 more sources
On the elimination of quantifier-free cuts
Theoretical Computer Science, 2011 When investigating the complexity of cut-elimination in first-order logic, a natural subproblem is the elimination of quantifier-free cuts. So far, the problem has only been considered in the context of general cut-elimination, and the upper bounds that have been obtained are essentially double exponential. In this note, we observe that a method due to
openaire +3 more sources