Results 41 to 50 of about 580,256 (322)
Tautology Elimination, Cut Elimination, and S5
Logic and Logical Philosophy, 2017 Tautology elimination rule was successfully applied in automated deduction and recently considered in the framework of sequent calculi where it is provably equivalent to cut rule. In this paper we focus on the advantages of proving admissibility of tautology elimination rule instead of cut for sequent calculi.
openaire +3 more sources
Partial cut elimination for combinations of propositional multi-modal logics with past time
Lietuvos Matematikos Rinkinys, 2011 We consider combinations of nine propositional multi-modal logics with propositional discrete linear time temporal logic with past time. For these combinations, we present sound and complete Gentzen-type sequent calculi with a restricted cut rule.
Jūratė Sakalauskaitė
doaj +1 more source
The Basics of Display Calculi [PDF]
, 2017 The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem.
Eckhardt, Timo +3 more
core +2 more sources
On Combining Intuitionistic and S4 Modal Logic
Bulletin of the Section of LogicWe address the problem of combining intuitionistic and S4 modal logic in a non-collapsing way inspired by the recent works in combining intuitionistic and classical logic.
João Rasga, Cristina Sernadas
doaj +1 more source
Composite power system reliability evaluation using modified minimal cut set approach
Alexandria Engineering Journal, 2018 The composite power system reliability analysis is generally based on minimal path or cut enumeration, tracing of power flow paths from which the related reliability indices are calculated.
T. Bharath Kumar +2 more
doaj +1 more source
A New Arithmetically Incomplete First- Order Extension of Gl All Theorems of Which Have Cut Free Proofs [PDF]
, 2016 Reference [12] introduced a novel formula to formula translation tool (“formulators”) that enables syntactic metatheoretical investigations of first-order modal logics, bypassing a need to convert them first into Gentzen style logics in order to rely on ...
Tourlakis, George
core +1 more source
On Nested Sequents for Constructive Modal Logics [PDF]
Logical Methods in Computer Science, 2015 We present deductive systems for various modal logics that can be obtained from the constructive variant of the normal modal logic CK by adding combinations of the axioms d, t, b, 4, and 5.
Lutz Strassburger +2 more
doaj +1 more source
Logique et Analyse, 2018 This is an exposition of Novikov's cut-elimination procedure for a Hilbert-style formulation of the first-order predicate calculus, which depends on a property of formulas introduced by him, called 'regularity'. A comparison with other methods is outlined.
openaire +2 more sources
Cut elimination by unthreading
Archive for Mathematical Logic, 2023 AbstractWe provide a non-Gentzen, though fully syntactical, cut-elimination algorithm for classical propositional logic. The designed procedure is implemented on $$\textsf{GS4}$$ GS 4 , the one-sided version of Kleene’s sequent system $$\textsf{G4}$$
openaire +4 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács +8 more
wiley +1 more source