Wana Manitpisitkul1, Sabrina Lee2, Matthew Cooper31Department of Pharmacy, University of Maryland Medical Center, Baltimore, MD, USA; 2Solid Organ Transplant Program, University of Utah Health Care, Salt Lake City, UT, USA; 3Department of Surgery, University of Maryland School of Medicine, Baltimore, MD, USA: Addition of mycophenolate mofetil to calcineurin-based immunosuppressive therapy has led to a significant improvement in graft survival and reduction of acute rejection in renal transplant recipients. However, in clinical practice, MMF dose reduction, interruption, or discontinuation due to hematological (...) and gastrointestinal side-effects occurred in up to 50% of the patients. Large retrospective analyses have demonstrated that patients requiring MMF dose manipulation due to adverse events experienced a higher rate of rejection and graft loss. Enteric-coated mycophenolate sodium was developed with the goal of improving upper GI side-effects. Here, we review the efficacy and safety of EC-MPS in de novo kidney transplant recipient, and in stable renal transplant patients who were converted from MMF. The changes in GI-related adverse events using patient-reported outcome instruments are also reviewed.Keywords: enteric-coated mycophenolate sodium, mycophenolate mofetil, kidney transplant, efficacy, gastrointestinal tolerability. (shrink)

Inborn errors of vitamin B12 (cobalamin) metabolism are associated with homocystinuria and methylmalonic aciduria, either alone or in combination. A number of these disorders have provided the first evidence for the existence of important steps in the transport or metabolism of cobalamin in eukaryotic cells. Eight complementation classes have been defined on the basis of somatic cell hybridization studies. Although the majority of patients present in infancy or early childhood, some are not diagnosed until adolescence or later. For some of (...) these disorders, prenatal diagnosis and therapy with cobalamin during pregnancy has been attempted. Although only males have been described with cblE disease, all of these disorders are presumed to be autosomal recessive in inheritance. The clinical and laboratory aspects of the different complementation classes (cblA–cblG) are reviewed here. (shrink)

There is growing political pressure for farmers to use more sustainable agricultural practices to protect people and the planet. The farming press could encourage farmers to adopt sustainable practices through its ability to manipulate discourse and spread awareness by changing the salience of issues or framing topics in specific ways. We sought to understand how the UK farming press framed sustainable agricultural practices and how the salience of these practices changed over time. We combined a media content analysis of the (...) farming press alongside 60 qualitative interviews with farmers and agricultural advisors to understand whether the farming press influenced farmers to try more sustainable practices. Salience of sustainable agricultural practices grew between 2009 and 2020. Many of the practices studied were framed by the press around economic and agronomic aspects, and farmer respondents said the most common reasons for trying sustainable agricultural practices were for economic and agronomic reasons. The farming press tended to use more positive rather than negative tones when covering sustainable agricultural practices. Respondents used the farming press as a source of information, though many did not fully trust these outlets as they believed the farming press were mouthpieces for agribusinesses. Whilst a minority of farmers stated they were motivated to try a new sustainable agricultural practice after learning about it in the farming press, this was rare. Instead, the farming press was used by respondents to raise their awareness about wider agricultural topics. We reflect on the role and power given to agribusinesses by the farming press and what this means for agricultural sustainability. (shrink)

Logicians and theoretical physicists will also benefit from this book.

By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.

We show that there exists a properly Σ2 minimal degree b, and moreover that b can be chosen to join with 0′ to 0″ – so that b is a 0″ complement for every degree a such that 0′ ≤ a < 0″.

We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.

The logical properties of the 'if-then' connective of ordinary English differ markedly from the logical properties of the material conditional of classical, two-valued logic. This becomes apparent upon examination of arguments in conversational English which involve (noncounterfactual) usages of if-then'. A nonclassical system of propositional logic is presented, whose conditional connective has logical properties approximating those of 'if-then'. This proposed system reduces, in a sense, to the classical logic. Moreover, because it is equivalent to a certain nonstandard three-valued logic, its (...) decision procedure is almost as efficient as that of the classical logic. It therefore provides a rational and convenient system in which to formalize English arguments. (shrink)

Computability theory concerns information with a causal–typically algorithmic–structure. As such, it provides a schematic analysis of many naturally occurring situations. Emil Post was the first to focus on the close relationship between information, coded as real numbers, and its algorithmic infrastructure. Having characterised the close connection between the quantifier type of a real and the Turing jump operation, he looked for more subtle ways in which information entails a particular causal context. Specifically, he wanted to find simple relations on reals (...) which produced richness of local computability-theoretic structure. To this extent, he was not just interested in causal structure as an abstraction, but in the way in which this structure emerges in natural contexts. Post’s programme was the genesis of a more far reaching research project. In this article we will firstly review the history of Post’s programme, and look at two interesting developments of Post’s approach. The first of these developments concerns the extension of the core programme, initially restricted to the Turing structure of the computably enumerable sets of natural numbers, to the Ershov hierarchy of sets. The second looks at how new types of information coming from the recent growth of research into randomness, and the revealing of unexpected new computability-theoretic infrastructure. We will conclude by viewing Post’s programme from a more general perspective. We will look at how algorithmic structure does not just emerge mathematically from information, but how that emergent structure can model the emergence of very basic aspects of the real world. (shrink)

The formal systems of logic have ordinarily been regarded as independent of biology, but recent developments in evolutionary theory suggest that biology and logic may be intimately interrelated. In this book, William Cooper outlines a theory of rationality in which logical law emerges as an intrinsic aspect of evolutionary biology. This biological perspective on logic, though at present unorthodox, could change traditional ideas about the reasoning process. Cooper examines the connections between logic and evolutionary biology and illustrates how (...) logical rules are derived directly from evolutionary principles, and therefore have no independent status of their own. Laws of decision theory, utility theory, induction, and deduction are reinterpreted as natural consequences of evolutionary processes. Cooper's connection of logical law to evolutionary theory ultimately results in a unified foundation for an evolutionary science of reason. It will be of interest to professionals and students of philosophy of science, logic, evolutionary theory, and cognitive science. (shrink)

Computability theory originated with the seminal work of Gödel, Church, Turing, Kleene and Post in the 1930s. This theory includes a wide spectrum of topics, such as the theory of reducibilities and their degree structures, computably enumerable sets and their automorphisms, and subrecursive hierarchy classifications. Recent work in computability theory has focused on Turing definability and promises to have far-reaching mathematical, scientific, and philosophical consequences. Written by a leading researcher, Computability Theory provides a concise, comprehensive, and authoritative introduction to contemporary (...) computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The book includes both the standard material for a first course in computability and more advanced looks at degree structures, forcing, priority methods, and determinacy. The final chapter explores a variety of computability applications to mathematics and science. Computability Theory is an invaluable text, reference, and guide to the direction of current research in the field. Nowhere else will you find the techniques and results of this beautiful and basic subject brought alive in such an approachable and lively way. (shrink)

We prove the following three theorems on the enumeration degrees of ∑20 sets. Theorem A: There exists a nonzero noncuppable ∑20 enumeration degree. Theorem B: Every nonzero Δ20enumeration degree is cuppable to 0′e by an incomplete total enumeration degree. Theorem C: There exists a nonzero low Δ20 enumeration degree with the anticupping property.

By constructing a maximal incomplete d.r.e. degree, the nondensity of the partial order of the d.r.e. degrees is established. An easy modification yields the nondensity of the n-r.e. degrees and of the ω-r.e. degrees.

A fundamental philosophical question that arises in connection with evolutionary theory is whether the fittest patterns of behavior are always the most rational. Are fitness and rationality fully compatible? When behavioral rationality is characterized formally as in classical decision theory, the question becomes mathematically meaningful and can be explored systematically by investigating whether the optimally fit behavior predicted by evolutionary process models is decision-theoretically coherent. Upon investigation, it appears that in nontrivial evolutionary models the expected behavior is not always in (...) accord with the norms of the standard theory of decision as ordinarily applied. Many classically irrational acts, e.g. betting on the occurrence of one event in the knowledge that the probabilities favor another, can under certain circumstances constitute adaptive behavior.One interesting interpretation of this clash is that the criterion of rationality offered by classical decision theory is simply incorrect (or at least incomplete) as it stands, and that evolutionary theory should be called upon to provide a more generally applicable theory of rationality. Such a program, should it prove feasible, would amount to the logical reduction of the theory of rational choice to evolutionary theory. (shrink)

_Philosophy: The Classic Readings_ provides a comprehensive, single-volume collection of the greatest works of philosophy from ancient to modern times. Draws on both Eastern and Western philosophical traditions Arranged chronologically within parts on Ethics, Epistemology, Metaphysics, Philosophy of Religion, and Political Philosophy Features original readings from more than a hundred of the world's great philosophers - from Lao Tzu, Confucius, the Buddha, Plato, Śamkara, Aquinas, al-Ghazāli, Kant, and Kierkegaard, to Wittgenstein, Heidegger, Sartre, Arendt, and Quine and many others Provides an (...) extensive Timeline of Philosophy for situating historical figures and lines of thought. (shrink)

Computability theory concerns information with a causal–typically algorithmic–structure. As such, it provides a schematic analysis of many naturally occurring situations. Emil Post was the first to focus on the close relationship between information, coded as real numbers, and its algorithmic infrastructure. Having characterised the close connection between the quantifier type of a real and the Turing jump operation, he looked for more subtle ways in which information entails a particular causal context. Specifically, he wanted to find simple relations on reals (...) which produced richness of local computability-theoretic structure. To this extent, he was not just interested in causal structure as an abstraction, but in the way in which this structure emerges in natural contexts. Post’s programme was the genesis of a more far reaching research project. In this article we will firstly review the history of Post’s programme, and look at two interesting developments of Post’s approach. The first of these developments concerns the extension of the core programme, initially restricted to the Turing structure of the computably enumerable sets of natural numbers, to the Ershov hierarchy of sets. The second looks at how new types of information coming from the recent growth of research into randomness, and the revealing of unexpected new computability-theoretic infrastructure. We will conclude by viewing Post’s programme from a more general perspective. We will look at how algorithmic structure does not just emerge mathematically from information, but how that emergent structure can model the emergence of very basic aspects of the real world. (shrink)

We show that every nonzero $\Delta _{2}^{0}$ e-degree bounds a minimal pair. On the other hand, there exist $\Sigma _{2}^{0}$ e-degrees which bound no minimal pair.

In 1962 a mimeographed sheet of paper fell into my possession. It had been prepared by Ernest Adams of the Philosophy Department at Berkeley as a handout for a colloquim. Headed 'SOME FALLACIES OF FORMAL LOGIC' it simply listed eleven little pieces of reasoning, all in ordinary English, and all absurd. I still have the sheet, and quote a couple of the arguments here to give the idea. • If you throw switch S and switch T, the motor will start. (...) There fore, either if you throw switch S the motor will start, or, if you throw switch T the motor will start. • It is not the case that if John passes history he will graduate. Therefore, John will pass history. The disconcerting thing about these inferences is, of course, that under the customary truth-functional interpretation of and, or, not, and if-then, they are supposed to be valid. What, if anything, is wrong? At first I was not disturbed by the examples. Having at that time consider able personal commitment to rationality in general and formal logic in par ticular, I felt it my duty and found myself easily able (or so I thought) to explain away most of them. But on reflection I had to admit that my expla nations had an ad hoc character, varying suspiciously from example to example. (shrink)

A proof is given that 0′ is definable in the structure of the degrees of unsolvability. This answers a long-standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator.

It is shown that there exists a low2 Harrington non-splitting base-that is, a low2 computably enumerable (c.e.) degree a such that for any c.e. degrees x, y, if $0' = x \vee y$ , then either $0' = x \vee a$ or $0' = y \vee a$ . Contrary to prior expectations, the standard Harrington non-splitting construction is incompatible with the $low_{2}-ness$ requirements to be satisfied, and the proof given involves new techniques with potentially wider application.