A Hilbert-style version of an implicational logic can be represented by a set of axiom schemes and modus ponens or by the corresponding axioms, modus ponens and substitution. Certain logics, for example the intuitionistic implicational logic, can also be represented by axioms and the rule of condensed detachment, which combines modus ponens with a minimal form of substitution. Such logics, for example intuitionistic implicational logic, are said to be D-complete. For certain weaker logics, the version based on condensed detachment and (...) axioms (the condensed version of the logic) is weaker than the original. In this paper we prove that the relevant logic T→, and any logic of which this is a sublogic, is D-complete. (shrink)

This paper traces the development of parental rights to accept or to refuse treatment for a defective newborn infant in the United Kingdom and in the United States of America; its main purpose is to explore the common trends from which an acceptable policy may be derived. It is probable that the British law on parental decision-making in respect of infants suffering from Down's syndrome is to be found in the civil case of In Re B rather than in the (...) criminal case of R v Arthur. United States court decisions are strongly influenced by constitutional law and reflect the right to personal privacy. The position on each side of the Atlantic seems very similar but this similarity includes a sense of uncertainty as to legal responsibility. There is a case for agreed guidelines and a suggested format is offered for consideration. (shrink)

In classical and intuitionistic arithmetics, any formula implies a true equation, and a false equation implies anything. In weaker logics fewer implications hold. In this paper we rehearse known results about the relevant arithmetic R, and we show that in linear arithmetic LL by contrast false equations never imply true ones. As a result, linear arithmetic is desecsed. A formula A which entails 0 = 0 is a secondary equation; one entailed by 0 6= 0 is a secondary unequation. A (...) system of formal arithmetic is secsed if every extensional formula is either a secondary equation or a secondary unequation. We are indebted to the program MaGIC for the simple countermodel SZ7, on which 0 = 1 is not a secondary formula. This is a small but signi cant success for automated reasoning. (shrink)

In this consensus report by a diverse group of academics who conduct and/or are concerned about social and behavioral genomics (SBG) research, the authors recount the often‐ugly history of scientific attempts to understand the genetic contributions to human behaviors and social outcomes. They then describe what the current science—including genomewide association studies and polygenic indexes—can and cannot tell us, as well as its risks and potential benefits. They conclude with a discussion of responsible behavior in the context of SBG research. (...) SBG research that compares individuals within a group according to a “sensitive” phenotype requires extra attention to responsible conduct and to responsible communication about the research and its findings. SBG research (1) on sensitive phenotypes that (2) compares two or more groups defined by (a) race, (b) ethnicity, or (c) genetic ancestry (where genetic ancestry could easily be misunderstood as race or ethnicity) requires a compelling justification to be conducted, funded, or published. All authors agree that this justification at least requires a convincing argument that a study's design could yield scientifically valid results; some authors would additionally require the study to have a socially favorable risk‐benefit profile. (shrink)

Due to natural selection pressure, certain aspects of memory may have been selected to give humans a survival advantage. Research has demonstrated that processing information for survival relevance leads to better item memory (i.e., the content of information) compared to control conditions. The current study investigates the effects of survival processing on context memory (i.e., memory for peripheral episodic details) and item memory to better understand when the survival processing memory advantage emerges. In this study, participants viewed objects in either (...) a plausible color, for example a red apple, or in an implausible color, such as a green pie. We chose this color plausibility manipulation because color is a detail that conveys information about the fitness of an item. After studying items in either a survival or moving (control) condition, participants made item memory judgments (did you see this item before?), and two context memory judgments: color context (in which color did you see this item?), and source context (in which condition did you see this item?). Results indicated better item memory for materials processed in the survival relative to moving condition. Critically, for color context there was a condition by plausibility interaction, where memory was best for plausibly colored items in the survival processing condition. There was no difference, however, in source context memory between the survival and moving conditions. These results suggest the survival processing memory advantage extends to some contextual details, but only those details that tap into the survival utility of items, such as color. (shrink)

After having defined the KARO logic for specifying intelligent agents in earlier work we now turn to the question how to realise agents specified in the KARO framework. To this end we look at agent programming languages that we have defined, and investigate how programs in these languages can be linked to the KARO logic.

Trust has been identified as an indicator within Social Quality theory. As an important component of social quality, trust has become increasingly important in modern society because literature suggests that trust in a number of democratic countries is declining. Modern technologies and specialties are often beyond the understanding of lay individuals and thus, the need for trusting relations between lay individuals and organizations/individuals has grown. The purpose of the study was to examine the extent to which Australians (dis)trust individuals and (...) organizations/institutions. A national postal survey was conducted with 1,044 respondents recruited using the electronic white pages directory. Findings from multivariate analyses suggest that income, age, sex, and health status are associated with trust in groups of individuals and trust in organizations/institutions. The findings highlight populations where trust needs to be (re)built. Future government policy and practice should utilize these findings as a means of facilitating social quality. (shrink)

The development and utility of genetically modified crops for smallholders around the world is controversial. Critical questions include what traits and crops are to be developed; how they can be adapted to smallholders’ ecological, social and economic contexts; which dissemination channels should be used to reach smallholders; and which policy environments will enable the greatest benefits for smallholders and the rural poor. A key question is how the voices of smallholders who have experience with or desire to use GM technologies (...) enter the larger debate. Africa has the greatest number of smallholders and poor with the least exposure to GM crops. Because of the well-established use of GM crops in South Africa by commercial farmers, we formed a community of practice involving smallholders, extension, researchers, non-profits and agribusiness in KwaZulu-Natal to examine the conditions under which GM crops are used by smallholders, how smallholders interact with GM technologies and what insights smallholders and other stakeholders can provide regarding these questions. One of the advantages of the CoP approach is that it brings stakeholders together in a non-hierarchical way that encourages new ways of thinking and new partnerships. Such interaction around a specific project can enhance the voice of smallholders in a variety of ways. In our project, smallholder participants have increased their knowledge and can make better decisions about GM technologies, which had been barriers for them. Notably, they have also improved their knowledge of maize production practices, accessed new practice networks, and met new researchers and resource providers. They are now being integrated into these networks in a way that should improve their livelihoods and make the wants and needs of smallholders better known. Such knowledge and experience has improved their voice in agriculture and rural development discussions. (shrink)

While outcomes for children with T-cell acute lymphoblastic leukemia have improved dramatically, survival rates for patients with relapsed/refractory disease remain dismal. Prior studies indicate that glucocorticoid resistance is more common than resistance to other chemotherapies at relapse. In addition, failure to clear peripheral blasts during a prednisone prophase correlates with an elevated risk of relapse in newly diagnosed patients. Here we show that intrinsic GC resistance is present at diagnosis in early thymic precursor T-ALLs as well as in a subset (...) of non-ETP T-ALLs. GC-resistant non-ETP T-ALLs are characterized by strong induction of JAK/STAT signaling in response to interleukin-7 stimulation. Removing IL7 or inhibiting JAK/STAT signaling sensitizes these T-ALLs, and a subset of ETP T-ALLs, to GCs. The combination of the GC dexamethasone and the JAK1/2 inhibitor ruxolitinib altered the balance between pro- and anti-apoptotic factors in samples with IL7-dependent GC resistance, but not in samples with IL7-independent GC resistance. Together, these data suggest that the addition of ruxolitinib or other inhibitors of IL7 receptor/JAK/STAT signaling may enhance the efficacy of GCs in a biologically defined subset of T-ALL.Leukemia advance online publication, 30 May 2017; doi:10.1038/leu.2017.136. (shrink)

Based on the relevant logic R, the system R# was proposed as a relevant Peano arithmetic. R# has many nice properties: the most conspicuous theorems of classical Peano arithmetic PA are readily provable therein; it is readily and effectively shown to be nontrivial; it incorporates both intuitionist and classical proof methods. But it is shown here that R# is properly weaker than PA, in the sense that there is a strictly positive theorem QRF of PA which is unprovable in R#. (...) The reason is interesting: if PA is slightly weakened to a subtheory P+, it admits the complex ring C as a model; thus QRF is chosen to be a theorem of PA but false in C. Inasmuch as all strictly positive theorems of R# are already theorems of P+, this nonconservativity result shows that QRF is also a nontheorem of R#. As a consequence, Ackermann's rule γ is inadmissible in R#. Accordingly, an extension of R# which retains its good features is desired. The system R##, got by adding an omega-rule, is such an extension. Central question: is there an effectively axiomatizable system intermediate between R# and R##, which does formalize arithmetic on relevant principles, but also admits γ in a natural way? (shrink)

In this paper, we shall confine ourselves to the study of sentential constants in the system R of relevant implication.In dealing with the behaviour of the sentential constants in R, we shall think of R itself as presented in three stages, depending on the level of truth-functional involvement.

Modus ponens provides the central theme. There are laws, of the form A→C. A logic L collects such laws. Any datum A provides input to the laws of L. The central ternary relation R relates theories L,T and U, where U consists of all of the outputs C got by applying modus ponens to major premises from L and minor premises from T. Underlying this relation is a modus ponens product operation on theories L and T, whence RLTU iff LTU. (...) These ideas have been expressed, especially with Routley, as worlds semantics for relevant and other substructural logics.Worlds are best demythologized as theories, subject to truth-functional and other constraints. The chief constraint is that theories are taken as closed under logical entailment, which clearly begs the question if we are using the semantics to determine which theory L is Logic itself. Instead we draw the modal logicians’ conclusion—there are many substructural logics, each with its appropriate ternary relational postulates.Each logic L gives rise to a Calculus of L-theories, on which particular candidate logical axioms have the combinatorial properties expected from the well-known Curry–Howard isomorphism . We apply their bubbling lemma, updating the Fools Model of Combinatory Logic at the pure → level for the system BT. We make fusion an explicit connective, proving a combinator correspondence theorem. Having taken relevant → as a left residual for , we explore its right residual mate →r. Finally we concentrate on and prove a finite model property for the classical minimal relevant logic CB, a conservative extension of the minimal positive relevant logic B+. (shrink)

In Entailment, Anderson and Belnap motivated their modification E of Ackermann’s strenge Implikation Π Π’ as a logic of relevance and necessity. The kindred system R was seen as relevant but not as modal. Our systems of Peano arithmetic R# and omega arithmetic R## were based on R to avoid fallacies of relevance. But problems arose as to which arithmetic sentences were (relevantly) true. Here we base analogous systems on E to solve those problems. Central to motivating E is the (...) rejection of fallacies of modality. Our slogan here for this is, “No diamonds entail any boxes.” Form the strenge Peano arithmetic E# like R#, adding appropriate forms of the Peano axioms to Ackermann’s E.. (shrink)

Although the system T of ticket entailment is obviously related to its cousins E and R , it is motivated along quite distinctive lines in Anderson and Belnap [1975]. It would seem, accordingly, that T is more nearly akin to the system P W studied in Martin [1978] than to E and R. The result presented here, however, at least suggests the contrary.

The system R## of "true" relevant arithmetic is got by adding the ω-rule "Infer VxAx from AO, A1, A2, ...." to the system R# of "relevant Peano arithmetic". The rule ⊃E (or "gamma") is admissible for R##. This contrasts with the counterexample to ⊃E for R# (Friedman & Meyer, "Whither Relevant Arithmetic"). There is a Way Up part of the proof, which selects an arbitrary non-theorem C of R## and which builds by generalizing Henkin and Belnap arguments a prime (...) theory T which still lacks C. (The key to the Way Up is a Witness Protection Program, using the ω-rule.) But T may be TOO BIG, whence there is a Way Down argument that produces a better theory TR, such that R## ⊆ TR ⊆ T. (The key to the Way Down is a Metavaluation, on which membership in T is combined with ordinary truth-functional conditions to determine TR.) The result is a theory that is Just Right, whence it never happens that A ⊃ C and A are theorems of R## but C is a non-theorem. (shrink)

The system R## of "true" relevant arithmetic is got by adding the ω-rule "Infer VxAx from AO, A1, A2, ...." to the system R# of "relevant Peano arithmetic". The rule ⊃E (or "gamma") is admissible for R##. This contrasts with the counterexample to ⊃E for R# (Friedman & Meyer, "Whither Relevant Arithmetic"). There is a Way Up part of the proof, which selects an arbitrary non-theorem C of R## and which builds by generalizing Henkin and Belnap arguments a prime (...) theory T which still lacks C. (The key to the Way Up is a Witness Protection Program, using the ω-rule.) But T may be TOO BIG, whence there is a Way Down argument that produces a better theory TR, such that R## ⊆ TR ⊆ T. (The key to the Way Down is a Metavaluation, on which membership in T is combined with ordinary truth-functional conditions to determine TR.) The result is a theory that is Just Right, whence it never happens that A ⊃ C and A are theorems of R## but C is a non-theorem. (shrink)

C I Lewis showed up Down Under in 2005, in e-mails initiated by Allen Hazen of Melbourne. Their topic was the system Hazen called FL (a Funny Logic), axiomatized in passing in Lewis 1921. I show that FL is the system MEN of material equivalence with negation. But negation plays no special role in MEN. Symbolizing equivalence with → and defining ∼A inferentially as A→f, the theorems of MEN are just those of the underlying theory ME of pure material equivalence. (...) This accords with the treatment of negation in the Abelian l-group logic A of Meyer and Slaney (Abelian logic. Abstract, Journal of Symbolic Logic 46, 425–426, 1981), which also defines ∼A inferentially with no special conditions on f. The paper then concentrates on the pure implicational part AI of A, the simple logic of Abelian groups. The integers Z were known to be characteristic for AI, with every non-theorem B refutable mod some Zn for finite n. Noted here is that AI is pre-tabular, having the Scroggs property that every proper extension SI of AI, closed under substitution and detachment, has some finite Zn as its characteristic matrix. In particular FL is the extension for which n = 2 (Lewis, The structure of logic and its relation to other systems. The Journal of Philosophy 18, 505–516, 1921; Meyer and Slaney, Abelian logic. Abstract. Journal of Symbolic Logic 46, 425–426, 1981; This is an abstract of the much longer paper finally published in 1989 in G. G. Priest, R. Routley and J. Norman, eds., Paraconsistent logic: essays on the inconsistent, Philosophica Verlag, Munich, pp. 245–288, 1989). (shrink)

C I Lewis showed up Down Under in 2005, in e-mails initiated by Allen Hazen of Melbourne. Their topic was the system Hazen called FL (a Funny Logic), axiomatized in passing in Lewis 1921. I show that FL is the system MEN of material equivalence with negation. But negation plays no special role in MEN. Symbolizing equivalence with → and defining ∼A inferentially as A→f, the theorems of MEN are just those of the underlying theory ME of pure material equivalence. (...) This accords with the treatment of negation in the Abelian l-group logic A of Meyer and Slaney (Abelian logic. Abstract, Journal of Symbolic Logic 46, 425–426, 1981), which also defines ∼A inferentially with no special conditions on f. The paper then concentrates on the pure implicational part AI of A, the simple logic of Abelian groups. The integers Z were known to be characteristic for AI, with every non-theorem B refutable mod some Zn for finite n. Noted here is that AI is pre-tabular, having the Scroggs property that every proper extension SI of AI, closed under substitution and detachment, has some finite Zn as its characteristic matrix. In particular FL is the extension for which n = 2 (Lewis, The structure of logic and its relation to other systems. The Journal of Philosophy 18, 505–516, 1921; Meyer and Slaney, Abelian logic. Abstract. Journal of Symbolic Logic 46, 425–426, 1981; This is an abstract of the much longer paper finally published in 1989 in G. G. Priest, R. Routley and J. Norman, eds., Paraconsistent logic: essays on the inconsistent, Philosophica Verlag, Munich, pp. 245–288, 1989). (shrink)

Sentential constants have been part of the R environment since Church [1]. They have had diverse uses in explicating relevant ideas and in sim- plifying them technically. Of most interest have been the Ackermann pair of constants t; f, functioning conceptually as a least truth, and as a greatest , under the ordering of propositions under true impli- cation. Also interesting have been the Church constants F; T, functioning similarly as least greatest propositions.