Results 21 to 30 of about 2,879,484 (330)
, 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.
Toshiyasu Arai
openalex +3 more sources
Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
Electronic Proceedings in Theoretical Computer ScienceWe consider modal logic extended with the well-known temporal operator'eventually'and provide a cut-elimination procedure for a cyclic sequent calculus that captures this fragment.
Bahareh Afshari, Johannes Kloibhofer
semanticscholar +2 more sources
Comparison of the pharmacokinetic profiles of three triterpenoids after oral administration of a cucurbitacin tablet and nanosuspension by UHPLC-MS/MS [PDF]
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 +2 more sources
Quick cut-elimination for strictly positive cuts [PDF]
Annals of Pure and Applied Logic, 2010 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.
Toshiyasu Arai
openalex +4 more sources
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logic in Computer Science, 2022 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
semanticscholar +1 more source
Cut Elimination in Nested Sequents for Intuitionistic Modal Logics [PDF]
Foundations of Software Science and Computation Structure, 2013 Lutz Straßburger
semanticscholar +2 more sources
Elimination and cut-elimination in multiplicative linear logic [PDF]
, 2022 We associate to every proof structure in multiplicative linear logic an ideal which represents the logical content of the proof as polynomial equations. We show how cut-elimination in multiplicative proof nets corresponds to instances of the Buchberger algorithm for computing Gröbner bases in elimination theory.
Daniel Murfet, William Troiani
openalex +3 more sources
Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic [PDF]
Logical Methods in Computer Science, 2023 This paper introduces the exponential substitution calculus (ESC), a new presentation of cut elimination for IMELL, based on proof terms and building on the idea that exponentials can be seen as explicit substitutions.
Beniamino Accattoli
doaj +1 more source
Cut-Free Gentzen Sequent Calculi for Tense Logics
Axioms, 2023 The cut-free single-succedent Gentzen sequent calculus GKt for the minimal tense logic Kt is introduced. This sequent calculus satisfies the displaying property.
Zhe Lin, Minghui Ma
doaj +1 more source
Algebraic Aspects of Cut Elimination [PDF]
Studia Logica, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Belardinelli, Francesco +2 more
openaire +2 more sources