The first set of case studies on animal use, this volume offers a thorough, up-to-date exploration of the moral issues related to animal welfare. Its main purpose is to examine how far it is ethically justifiable to harm animals in order to benefit mankind. An excellent introduction provides a framework for the cases and sets the background of philosophical and moral concepts underlying the subject. Sixteen original, previously unpublished essays cover controversies associated with the human use of animals in a (...) broad range of contexts, including biomedical, behavioral, and wildlife research, cosmetic safety testing, education, the food industry, commerce, and animal use as pets and in religious practices. Scientific research is accorded the closest scrutiny. The authors represent a wide range of expertise within their specialized areas of research--physiology, public policy, ethics, philosophy, law, veterinary science, and psychology. The careful analysis of each case makes it possible to elevate the discourse beyond over-simplified positions, and to demonstrate the complexity of the issues. The Human Use of Animals will be welcomed by students and faculty in law, philosophy, ethics, public policy, religion, medicine, and veterinary medicine. It will also interest activists in the animal protection movement, and members of animal protection organizations and Institutional Animal Care and Use Committees. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Kennedy Institute of Ethics Journal 11.1 (2001) 113 [Access article in PDF] Letters Rats, Mice, and Birds and the Animal Welfare Act Madam:In the September 2000 issue of the Kennedy Institute of Ethics Journal, I argued for the inclusion of laboratory rats, mice, and birds under provisions of the Animal Welfare Act (AWA). This act sets humane standards for animals used in biomedical experimentation, but these three species are (...) excluded despite the fact that they comprise 90 percent of all animals used. Recent actions have been taken on this issue that temporarily maintain the status quo of exclusion.On 25 September 2000, a legal suit brought by the Alternatives Research Development Fund was settled out of court when the U.S. Department of Agriculture agreed that the AWA enforcement regulations should be extended to rats, mice, and birds. This was a significant victory heralded by the animal protection movement and some sections of the scientific community. Federal Court Judge Ellen S. Huvelle dismissed motions by pro-animal research groups to block this agreement.But the tide soon turned. On 11 October, a last-minute amendment to the USDA appropriations bill submitted by the Senate Appropriations Committee chair Thad Cochran (R-Miss.) precluded the department from spending any funds in the coming fiscal year to effect this change. This amendment had been drafted by the National Association for Biomedical Research and passed to the University of Mississippi to be forwarded to Cochran. This now congressionally approved amendment postponed for a year any action to implement the legal agreement. USDA plans to initiate the formal rule-making process for rats, mice, and birds by 1 October 2001. F. Barbara Orlans Senior Research Fellow Kennedy Institute of Ethics Georgetown University Washington, DC... (shrink)

: A major shortcoming of the Animal Welfare Act is its exclusion of the species most-used in experimentation-rats, mice, and birds. Considerations of justice dictate that extension of the law to these three species is the morally right thing to do. A brief history of how these species came to be excluded from the laws protecting laboratory animals is also provided, as well as discussion of the implications and significance of expanding the law.

Laboratory animals, being vulnerable subjects, need the protection provided by adequate ethical review. This review falls primarily to Institutional Animal Care and Use Committees. A review committee's first duty is to identify which procedures ethically are unacceptable irrespective of any knowledge that might be derived. Examples are provided. These projects should be disapproved. Then, "on balance" judgments are assessed that weigh the animal harms against the potential benefits to humans. Several countries (but not the United States) use a classification system (...) for ranking the degree of animal pain and distress. This type of assessment is essential for careful ethical analysis. Another way to enhance ethical discussion is to strive for a more balanced perspective of different viewpoints among members of decision making committees. Inclusion of representatives of animal welfare organizations and a greater proportion on nonanimal researchers would likely achieve this objective. (shrink)

The articles collected in this special issue were originally presented at two workshops entitled "Ethical Issues of Animal Research" sponsored by Georgetown University's Kennedy Institute of Ethics and Indiana University's Poynter Center for the Study of Ethics and American Institution. Some of the most prominent and influential thinkers in the field present their diverse views.

In his challenging article, Steneck (1997) criticized the creation of the Institutional Animal Care and Use Committee (IACUC) system established by the 1985 amendments to the Animal Welfare Act. He saw the IACUC review and approval of biomedical and behavioral research with animals as an unnecessary "reassignment" of duties from existing animal care programs to IACUC committees. He argued that the committees are unable to do the work expected of them for basically three reasons: (a) the membership lacks the expertise (...) in matters relevant to animal research and care, (b) there exists an inherent and disabling conflict of interest, and (c) the committee's operational base of authority is alien to academic culture and violates essential aspects of academic freedom. In addition, he found that the system is burdensome, requiring enormous expenditures of time and money that inappropriately diverts resources away from the business of scientific discovery. We dispute several aspects of Steneck's historical account and the coherence of his proposals. We believe his proposals, if followed, would be a step back into a failed past. (shrink)

We study arithmetic and hyperarithmetic degrees of categoricity. We extend a result of E. Fokina, I. Kalimullin, and R. Miller to show that for every computable ordinal $\alpha$, $\mathbf{0}^{}$ is the degree of categoricity of some computable structure $\mathcal{A}$. We show additionally that for $\alpha$ a computable successor ordinal, every degree $2$-c.e. in and above $\mathbf{0}^{}$ is a degree of categoricity. We further prove that every degree of categoricity is hyperarithmetic and show that the index set of structures with degrees (...) of categoricity is $\Pi_{1}^{1}$-complete. (shrink)

The Rainbow Ramsey Theorem is essentially an "anti-Ramsey" theorem which states that certain types of colorings must be injective on a large subset (rather than constant on a large subset). Surprisingly, this version follows easily from Ramsey's Theorem, even in the weak system RCA₀ of reverse mathematics. We answer the question of the converse implication for pairs, showing that the Rainbow Ramsey Theorem for pairs is in fact strictly weaker than Ramsey's Theorem for pairs over RCA₀. The separation involves techniques (...) from the theory of randomness by showing that every 2-random bounds an ω-model of the Rainbow Ramsey Theorem for pairs. These results also provide as a corollary a new proof of Martin's theorem that the hyperimmune degrees have measure one. (shrink)

We investigate the complexity of isomorphisms of computable structures on cones in the Turing degrees. We show that, on a cone, every structure has a strong degree of categoricity, and that degree of categoricity is${\rm{\Delta }}_\alpha ^0 $-complete for someα. To prove this, we extend Montalbán’sη-system framework to deal with limit ordinals in a more general way. We also show that, for any fixed computable structure, there is an ordinalαand a cone in the Turing degrees such that the exact complexity (...) of computing an isomorphism between the given structure and another copy${\cal B}$in the cone is a c.e. degree in${\rm{\Delta }}_\alpha ^0\left$. In each of our theorems the cone in question is clearly described in the beginning of the proof, so it is easy to see how the theorems can be viewed as general theorems with certain effectiveness conditions. (shrink)

To reduce sex differences in employment outcomes, we must examine them in the context of the sex-gender hierarchy. The conventional explanation for wage gap—job segregation—is incorrect because it ignores men's incentive to preserve their advantages and their ability to do so by establishing the rules that distribute rewards. The primary method through which all dominant groups maintain their hegemony is by differentiating the subordinate group and defining it as inferior and hence meriting inferior treatment. My argument implies that neither sex-integrating (...) jobs nor implementing comparable worth will markedly improve women's employment status because men can subvert these mechanisms or even change the rules by which rewards are allocated. As evidence, I show that occupational integration has failed to advance women appreciably, and I argue that comparable worth is not likely to be much more effective. Instead, we must seek political analyses and political solutions. (shrink)

We analyze the degree spectra of structures in which different types of immunity conditions are encoded. In particular, we give an example of a structure whose degree spectrum coincides with the hyperimmune degrees. As a corollary, this shows the existence of an almost computable structure of which the complement of the degree spectrum is uncountable.

We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomic theory with all types of the theory computable, we show that for every degree d with 0 0, (...) T has a d-decidable model omitting the nonprincipal types listed by L. (shrink)

Tarski defined a way of assigning to each Boolean algebra, B, an invariant inv(B) ∈ In, where In is a set of triples from ℕ, such that two Boolean algebras have the same invariant if and only if they are elementarily equivalent. Moreover, given the invariant of a Boolean algebra, there is a computable procedure that decides its elementary theory. If we restrict our attention to dense Boolean algebras, these invariants determine the algebra up to isomorphism. In this paper we (...) analyze the complexity of the question "Does B have invariant x?" For each x ∈ In we define a complexity class Γx that could be either Σⁿ, Πⁿ, Σⁿ ∧ Πⁿ, or Πω+1 depending on x, and we prove that the set of indices for computable Boolean algebras with invariant x is complete for the class Γx. Analogs of many of these results for computably enumerable Boolean algebras were proven in earlier works by Selivanov. In a more recent work, he showed that similar methods can be used to obtain the results for computable ones. Our methods are quite different and give new results as well. As the algebras we construct to witness hardness are all dense, we establish new similar results for the complexity of various isomorphism problems for dense Boolean algebras. (shrink)

A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model U of T decidable in X. It is easy to see that $X = 0\prime$ is prime bounding. Denisov claimed that every $X <_{T} 0\prime$ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets $X \leq_{T} 0\prime$ are exactly the sets which are not $low_2$ . Recall that (...) X is $low_2$ if $X\prime\prime$ $\leq_{T} 0\prime$ . To prove that a $low_2$ set X is not prime bounding we use a $0\prime$ -computable listing of the array of sets { Y : Y $\leq_{T}$ X } to build a CAD theory T which diagonalizes against all potential X-decidable prime models U of T. To prove that any $non-low_{2}$ ; X is indeed prime bounding, we fix a function f $\leq_T$ X that is not dominated by a certain $0\prime$ -computable function that picks out generators of principal types. Given a CAD theory T. we use f to eventually find, for every formula $\varphi (\bar{x})$ consistent with T, a principal type which contains it, and hence to build an X-decidable prime model of T. We prove the prime bounding property equivalent to several other combinatorial properties, including some related to the limitwise monotonic functions which have been introduced elsewhere in computable model theory. (shrink)

We study for each computably bounded $\Pi ^0_1$ class P the set of degrees of c.e. paths in P. We show, amongst other results, that for every c.e. degree a there is a perfect $\Pi ^0_1$ class where all c.e. members have degree a. We also show that every $\Pi ^0_1$ set of c.e. indices is realized in some perfect $\Pi ^0_1$ class, and classify the sets of c.e. degrees which can be realized in some $\Pi ^0_1$ class as exactly (...) those with a computable representation. (shrink)

Fraïssé studied countable structures S through analysis of the age of S i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fraïssé limit. We also show that degree spectra of relations on a sufficiently nice Fraïssé limit are always upward closed unless the relation is definable by (...) a quantifier-free formula. We give some sufficient or necessary conditions for a Fraïssé limit to be spectrally universal. As an application, we prove that the computable atomless Boolean algebra is spectrally universal. (shrink)

In this paper, we give a characterization of the strong degrees of categoricity of computable structures greater or equal to [Formula: see text]. They are precisely the treeable degrees — the least degrees of paths through computable trees — that compute [Formula: see text]. As a corollary, we obtain several new examples of degrees of categoricity. Among them we show that every degree [Formula: see text] with [Formula: see text] for [Formula: see text] a computable ordinal greater than [Formula: see (...) text] is the strong degree of categoricity of a rigid structure. Using quite different techniques we show that every degree [Formula: see text] with [Formula: see text] is the strong degree of categoricity of a structure. Together with the above example this answers a question of Csima and Ng. To complete the picture we show that there is a degree [Formula: see text] with [Formula: see text] that is not the degree of categoricity of a rigid structure. (shrink)

The terms of the upper and lower central series of a nilpotent computable group have computably enumerable Turing degree. We show that the Turing degrees of these terms are independent even when restricted to groups which admit computable orders.

Culturally different connotations of basic concepts challenge the comparative study of religion. Do persons in Germany or in the United States refer to the same concepts when talking about ‘spirituality’ and ‘religion’? Does it make a difference how they identify themselves? The Bielefeld-Chattanooga Cross-Cultural Study on ‘Spirituality’ includes a semantic differential approach for the comparison of self-identified “neither religious nor spiritual”, “religious”, and “spiritual” persons regarding semantic attributes attached to the concepts ‘religion’ and ‘spirituality’ in each research context. Results show (...) that ‘spirituality’ is used as a broader concept than ‘religion’. Regarding religion, semantics attributed by self-identified religious persons differ significantly from those of the spiritual persons. The ‘spiritual’ and the ‘religious’ groups agree on semantics attributed to spirituality but differ from the ‘neither spiritual nor religious’ group. Qualifications of differences and agreements become visible from the comparison between the United States and Germany. It is argued for the semantically sensitive study of culturally situated ‘spiritualities’. (shrink)

We show that Sacks' and Shoenfield's analogs of jump inversion fail for both tt- and wtt-reducibilities in a strong way. In particular we show that there is a ${\mathrm{\Delta }}_{2}^{0}$ set B > tt ∅′ such that there is no c.e. set A with A′ ≡ wtt B. We also show that there is a ${\mathrm{\Sigma }}_{2}^{0}$ set C > tt ∅′ such that there is no ${\mathrm{\Delta }}_{2}^{0}$ set D with D′ ≡ wtt C.

This study investigates whether and how sex and race affect access to and rewards for job authority, using 1980 survey data for 1,216 employed workers. The authors examine whether, net of human-capital characteristics, sex and race affect access to and compensation for job authority. In addition, the authors examine whether the translation of credentials into authority and earnings varies depending on workers' sex or race.

The current model of adult neurogenesis in mammals suggests that adult‐born neurons are generated by stem cells that undergo long‐term self‐renewal, and that a lifetime supply of stem cells resides in the brain. In contrast, it has recently been demonstrated that adult‐born neurons in crayfish are generated by precursors originating in the immune system. This is particularly interesting because studies done many years ago suggest that a similar mechanism might exist in rodents and humans, with bone marrow providing stem cells (...) that can generate neurons. However, the relevance of these findings for natural mechanisms underlying adult neurogenesis in mammals is not clear, because of uncertainties at many levels. We argue here that the recent findings in crayfish send a strong signal to re‐examine existing data from rodents and humans, and to design new experiments that will directly test the contributions of the immune system to adult neurogenesis in mammals. (shrink)

Culturally different connotations of basic concepts challenge the comparative study of religion. Do persons in Germany or in the United States refer to the same concepts when talking about ‘spirituality’ and ‘religion’? Does it make a difference how they identify themselves? The Bielefeld-Chattanooga Cross-Cultural Study on ‘Spirituality’ includes a semantic differential approach for the comparison of self-identified “neither religious nor spiritual”, “religious”, and “spiritual” persons regarding semantic attributes attached to the concepts ‘religion’ and ‘spirituality’ in each research context. Results show (...) that ‘spirituality’ is used as a broader concept than ‘religion’. Regarding religion, semantics attributed by self-identified religious persons differ significantly from those of the spiritual persons. The ‘spiritual’ and the ‘religious’ groups agree on semantics attributed to spirituality but differ from the ‘neither spiritual nor religious’ group. Qualifications of differences and agreements become visible from the comparison between the United States and Germany. It is argued for the semantically sensitive study of culturally situated ‘spiritualities’. (shrink)

A Turing degree d is homogeneous bounding if every complete decidable (CD) theory has a d-decidable homogeneous model A, i.e., the elementary diagram De (A) has degree d. It follows from results of Macintyre and Marker that every PA degree (i.e., every degree of a complete extension of Peano Arithmetic) is homogeneous bounding. We prove that in fact a degree is homogeneous bounding if and only if it is a PA degree. We do this by showing that there is a (...) single CD theory T such that every homogeneous model of T has a PA degree. (shrink)

Topologists Nabutovsky and Weinberger discovered how to embed computably enumerable (c.e.) sets into the geometry of Riemannian metrics modulo diffeomorphisms. They used the complexity of the settling times of the c.e. sets to exhibit a much greater complexity of the depth and density of local minima for the diameter function than previously imagined. Their results depended on the existence of certain sequences of c.e. sets, constructed at their request by Csima and Soare, whose settling times had the necessary dominating properties. (...) Although these computability results had been announced earlier, their proofs have been deferred until this paper. Computably enumerable sets have long been used to prove undecidability of mathematical problems such as the word problem for groups and Hilbert's Tenth Problem. However, this example by Nabutovsky and Weinberger is perhaps the first example of the use of c.e. sets to demonstrate specific mathematical or geometric complexity of a mathematical structure such as the depth and distribution of local minima. (shrink)

Contemporary organizations often reciprocate to society for using resources and for affecting stakeholders by engaging in corporate social responsibility. It has been shown that CSR has a positive impact on employee attitudes. However, not all employees may react equally strongly to CSR practices. Based on socio-emotional selectivity theory, we contend that the effect of CSR on employee satisfaction will be more pronounced for older than for younger employees, because CSR practices address those emotional needs and goals that are prioritized when (...) people’s future time perspective decreases. In one multi-source field study and one experimental study, we demonstrate that CSR indeed has a stronger positive effect on employee satisfaction for older relative to younger employees. Accordingly, engaging in CSR can be an attractive tool for organizations that aim to keep their aging workforce satisfied with their job. (shrink)

To each computable enumerable (c.e.) set A with a particular enumeration {As}s∈ω, there is associated a settling function mA(x), where mA(x) is the last stage when a number less than or equal to x was enumerated into A. One c.e. set A is settling time dominated by another set B (B >st A) if for every computable function f, for all but finitely many x, mB(x) > f(m₄(x)). This settling-time ordering, which is a natural extension to an ordering of the (...) idea of domination, was first introduced by Nabutovsky and Weinberger in [3] and Soare [6]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the <st ordering. We show that it is not invariant under computable isomorphism, that any countable partial ordering embeds into it, that there are maximal and minimal sets, and that two c.e. sets need not have an inf or sup in the ordering. We also examine a related ordering, the strong settling-time ordering where we require for all computable f and g, for almost all x, mB(x) > f(mA(g(x))). (shrink)

A real is called properly n-generic if it is n-generic but not n+1-generic. We show that every 1-generic real computes a properly 1-generic real. On the other hand, if m > n ≥ 2 then an m-generic real cannot compute a properly n-generic real.

Between 1993 and 2002, 39 clinical trial staff were investigated for scientific misconduct by the Office of Research Integrity (ORI). Analysis of ORI case records reveals practices regarding workload, training and supervision that enable misconduct. Considering the potential effects on human subjects protection, quality and reliability of data, and the trustworthiness of the clinical research enterprise, regulations or guidance on use of clinical trial staff ought to be available. Current ORI regulations do not hold investigators or institutions responsible for supervision (...) and training of clinical trial staff. Given the important issues at stake, the definition of research misconduct should encompass the intentional or negligent mismanagement of scientific projects. Individual institutions and professional associations not only can but should adopt stricter standards of conduct than those reflected in federal regulations. (shrink)

A strong degree of categoricity is a Turing degree [Formula: see text] such that there is a computable structure [Formula: see text] that is [Formula: see text]-computably categorical (there is a [Formula: see text]-computable isomorphism between any two computable copies of [Formula: see text]), and such that there exist two computable copies of [Formula: see text] between which every isomorphism computes [Formula: see text]. The question of whether every [Formula: see text] degree is a strong degree of categoricity has been (...) of interest since the first paper on this subject. We answer the question in the affirmative, by constructing an example. (shrink)

The role that class and ethnicity played in the self-fashioning of the professional men of letters who shaped fifteenth-century Spain's humanist project has been the subject of intense scholarly scrutiny for over fifty years. It was José Antonio Maravall who first demonstrated that the so-called letrados had a “conciencia estamental,” a class consciousness derived from their indispensable roles as administrators, advisors, diplomats, and chroniclers in the service of the crown. Subsequent scholarship showed that part of letrado self-consciousness resulted from the (...) hostility of Old Christian noblemen toward these ambitious non-noble, university-trained men, many of them New Christians or conversos. One way in which the aristocracy stigmatized the intellectual pursuits of the letrados was in fact to call those endeavors “Jewish.”. (shrink)