scholarly journals Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality

2019 ◽  
pp. 1
Author(s):  
Norihiro Kamide
Keyword(s):  
Cut Elimination ◽  
Modal Extension ◽  
Connexive Logic

scholarly journals Axiomatization of Some Basic and Modal Boolean Connexive Logics

2021 ◽  
Author(s):  
Mateusz Klonowski
Keyword(s):  
Possible Worlds ◽  
Modus Ponens ◽  
Boolean Logic ◽  
Possible Worlds Semantics ◽  
Canonical Models ◽  
Tableau Systems ◽  
Modal Extension ◽  
Connexive Logic ◽  
Axiomatic Systems

AbstractBoolean connexive logic is an extension of Boolean logic that is closed under Modus Ponens and contains Aristotle’s and Boethius’ theses. According to these theses (i) a sentence cannot imply its negation and the negation of a sentence cannot imply the sentence; and (ii) if the antecedent implies the consequent, then the antecedent cannot imply the negation of the consequent and if the antecedent implies the negation of the consequent, then the antecedent cannot imply the consequent. Such a logic was first introduced by Jarmużek and Malinowski, by means of so-called relating semantics and tableau systems. Subsequently its modal extension was determined by means of the combination of possible-worlds semantics and relating semantics. In the following article we present axiomatic systems of some basic and modal Boolean connexive logics. Proofs of completeness will be carried out using canonical models defined with respect to maximal consistent sets.

Risperidone-treated Children and Adolescents with Behavioral Disorders: Do Drug Dose and Patients’ Gender and Age Relate to Drug and Metabolite Plasma Levels?

2017 ◽  
Vol 41 (S1) ◽  
pp. S104-S104
Author(s):  
D. Piacentino ◽  
M. Grözinger ◽  
A. Saria ◽  
F. Scolati ◽  
D. Arcangeli ◽  
...  
Keyword(s):  
Regression Analysis ◽  
Children And Adolescents ◽  
Behavioral Disorders ◽  
Plasma Levels ◽  
Linear Models ◽  
Parent Drug ◽  
Drug Dose ◽  
Cut Elimination ◽  
Younger Patients ◽  
Gender And Age

IntroductionBehavioral disorders, such as conduct disorder, influence choice of treatment and its outcome. Less is known about other variables that may have an influence.Objectives/AimsWe aimed to measure the parent drug and metabolite plasma levels in risperidone-treated children and adolescents with behavioral disorders and investigate the role of drug dose and patients’ gender and age.MethodsWe recruited 115 children/adolescents with DSM-5 behavioral disorders (females = 24; age range: 5–18 years) at the Departments of Psychiatry of the Hospitals of Bolzano, Italy, and Innsbruck, Austria. We measured risperidone and its metabolite 9-hydroxyrisperidone plasma levels and the parent drug-to-metabolite ratio in the plasma of all patients by using LC-MS/MS. A subsample of 15 patients had their risperidone doses measured daily. We compared risperidone and 9-hydroxyrisperidone plasma levels, as well as risperidone/9-hydroxyrisperidone ratio, in males vs. females and in younger (≤ 14 years) vs. older (15–18 years) patients by using Mann-Whitney U test. We fitted linear models for the variables “age” and “daily risperidone dose” by using log-transformation, regression analysis and applying the R2 statistic.ResultsFemales had significantly higher median 9-hydroxyrisperidone plasma levels (P = 0.000). Younger patients had a slightly lower median risperidone/9-hydroxyrisperidone ratio (P = 0.052). At the regression analysis, daily risperidone doses and metabolite, rather than parent drug–plasma levels were correlated (R2 = 0.35).ConclusionsGender is significantly associated with plasma levels, with females being slower metabolizers than males. Concerning age, younger patients seem to be rapid metabolizers, possibly due to a higher activity of CYP2D6. R2 suggests a clear-cut elimination of the metabolite.Disclosure of interestThe authors have not supplied their declaration of competing interest.

A proof of the cut-elimination theorem in simple type theory

1973 ◽  
Vol 38 (2) ◽  
pp. 215-226
Author(s):  
Satoko Titani
Keyword(s):  
Boolean Algebra ◽  
Type Theory ◽  
Arbitrary Number ◽  
Formal System ◽  
Cut Elimination ◽  
Simple Type ◽  
Inductive Definition ◽  
Simple Type Theory ◽  
Maximal Ideals ◽  
Definition Of

In [4], I introduced a quasi-Boolean algebra, and showed that in a formal system of simple type theory, from which the cut rule is omitted, wffs form a quasi-Boolean algebra, and that the cut-elimination theorem can be formulated in algebraic language. In this paper we use the result of [4] to prove the cut-elimination theorem in simple type theory. The theorem was proved by M. Takahashi [2] in 1967 by using the concept of Schütte's semivaluation. We use maximal ideals of a quasi-Boolean algebra instead of semivaluations.The logical system we are concerned with is a modification of Schütte's formal system of simple type theory in [1] into Gentzen style.Inductive definition of types.0 and 1 are types.If τ1, …, τn are types, then (τ1, …, τn) is a type.Basic symbols.a1τ, a2τ, … for free variables of type τ.x1τ, x2τ, … for bound variables of type τ.An arbitrary number of constants of certain types.An arbitrary number of function symbols with certain argument places.

Relating Semantics for Connexive Logic

2020 ◽  
pp. 49-65
Author(s):  
Jacek Malinowski ◽  
Rafał Palczewski
Keyword(s):  
Connexive Logic

Cut-Elimination for SBL

2020 ◽  
pp. 265-298
Author(s):  
Toshiyasu Arai
Keyword(s):  
Cut Elimination
Sign in / Sign up

Export Citation Format

Share Document