Results 51 to 60 of about 5,524 (273)
Polarizing Double Negation Translations [PDF]
Double-negation translations are used to encode and decode classical proofs in intuitionistic logic. We show that, in the cut-free fragment, we can simplify the translations and introduce fewer negations.
A. Kolmogorov +14 more
core +4 more sources
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
The theories of apartness, equality, and n-stable equality are presented through contraction- and cut-free sequent calculi. By methods of proof analysis, a purely proof-theoretic characterization of the equality fragment of apartness is obtained.
Bianca Boretti, Sara Negri
doaj +1 more source
Sequent and Hypersequent Calculi for Abelian and Lukasiewicz Logics [PDF]
We present two embeddings of infinite-valued Lukasiewicz logic L into Meyer and Slaney's abelian logic A, the logic of lattice-ordered abelian groups. We give new analytic proof systems for A and use the embeddings to derive corresponding systems for L ...
Gabbay, D., Metcalfe, G., Olivetti, N.
core
The Varieties of Ought-implies-Can and Deontic STIT Logic [PDF]
STIT logic is a prominent framework for the analysis of multi-agent choice-making. In the available deontic extensions of STIT, the principle of Ought-implies-Can (OiC) fulfills a central role.
Lyon, Tim, van Berkel, Kees
core
ABSTRACT Background and Aims Wilms tumour (WT) has excellent event‐free and overall survival (OS). However, small differences exist between countries participating in the same international study. This led us to examine variation in adherence to protocol recommendations as a potential contributing factor.
Suzanne Tugnait +23 more
wiley +1 more source
Partial cut elimination for combinations of propositional multi-modal logics with past time
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
More efficient proof-search for sequents of temporal logic
The present paper deals with efficiency improvement of backward proof-search of sequents of propositional linear temporal logic, using a loop-type sequent calculus.
Romas Alonderis
doaj +1 more source
Systematic construction of natural deduction systems for many-valued logics [PDF]
A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables
Baaz, Matthias +2 more
core +2 more sources
Dual Systems of Sequents and Tableaux for Many-Valued Logics [PDF]
The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems.
Baaz, Matthias +2 more
core +3 more sources

