Results 31 to 40 of about 578,113 (185)
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2000 Presents new proofs of cut elimination for intuitionistic, classical and linear sequent calculi. In all cases, the proofs proceed by three nested structural inductions, avoiding the explicit use of multi-sets and termination measures on sequent derivations.
openaire +1 more source
An Investigation into the Multi-Pass Radial-Mode Micro Abrasive Air Jet Turning of Fused-Silica Rods
Machines, 2023 With the increased requirement of miniaturization structures on hard and brittle substrates, micro abrasive air jet turning technology has become a promising machining technology for manufacturing miniaturization structures.
Ruibo Yang +4 more
doaj +1 more source
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
Cut-elimination for the modal Grzegorczyk logic via non-well-founded proofs
, 2017 We present a sequent calculus for the modal Grzegorczyk logic Grz allowing non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs.Comment: WOLLIC'17, 12 pages, 1 ...
A Avron +5 more
core +1 more source
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
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 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
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
, 2020 In this paper we give a terminating cut-elimination procedure for a logic calculus SBL. SBL corresponds to the second order arithmetic Pi^{1}_{2}-Separation and Bar Induction.
openaire +2 more sources