: This response to Lynn Jansen's critique of clinical pragmatism concentrates on two themes: (1) contrasting approaches to moral epistemology and (2) the connection between theory and practice in clinical ethics. Particular attention is paid to the status of principles and the role of consensus, with some closing speculations on how Dewey might view the current state of bioethics.

The use of growth attenuation therapy (GAT) is becoming more common in order to enable a family to care for a child with profound cognitive and physical disabilities (PCPD) as they age into adulthood. The first published study on the use of GAT was done with the family of a six-year-old girl with PCPD by Daniel Gunther and Douglas Diekema in Pediatrics in 2006. The ethical application of GAT generated considerable discussion on the use among children with PCPD in the (...) medical and ethics communities. This paper discusses the use of GAT for children with profound cognitive and physical disabilities from a Catholic bioethics perspective. (shrink)

The crash of two 737 MAX passenger aircraft in late 2018 and early 2019, and subsequent grounding of the entire fleet of 737 MAX jets, turned a global spotlight on Boeing’s practices and culture. Explanations for the crashes include: design flaws within the MAX’s new flight control software system designed to prevent stalls; internal pressure to keep pace with Boeing’s chief competitor, Airbus; Boeing’s lack of transparency about the new software; and the lack of adequate monitoring of Boeing by the (...) FAA, especially during the certification of the MAX and following the first crash. While these and other factors have been the subject of numerous government reports and investigative journalism articles, little to date has been written on the ethical significance of the accidents, in particular the ethical responsibilities of the engineers at Boeing and the FAA involved in designing and certifying the MAX. Lessons learned from this case include the need to strengthen the voice of engineers within large organizations. There is also the need for greater involvement of professional engineering societies in ethics-related activities and for broader focus on moral courage in engineering ethics education. (shrink)

: This paper presents a method of moral problem solving in clinical practice that is inspired by the philosophy of John Dewey. This method, called "clinical pragmatism," integrates clinical and ethical decision making. Clinical pragmatism focuses on the interpersonal processes of assessment and consensus formation as well as the ethical analysis of relevant moral considerations. The steps in this method are delineated and then illustrated through a detailed case study. The implications of clinical pragmatism for the use of principles in (...) moral problem solving are discussed. (shrink)

We show that the Turing degrees are not sufficient to measure the complexity of continuous functions on [0, 1]. Computability of continuous real functions is a standard notion from computable analysis. However, no satisfactory theory of degrees of continuous functions exists. We introduce the continuous degrees and prove that they are a proper extension of the Turing degrees and a proper substructure of the enumeration degrees. Call continuous degrees which are not Turing degrees non-total. Several fundamental results are proved: a (...) continuous function with non-total degree has no least degree representation, settling a question asked by Pour-El and Lempp; every non-computable f $\epsilon \mathcal{C}[0, 1]$ computes a non-computable subset of $\mathbb{N}$ ; there is a non-total degree between Turing degrees $a _\eqslantless_{\tau}$ b iff b is a PA degree relative to a; $\mathcal{S} \subseteq 2^{\mathbb{N}}$ is a Scott set iff it is the collection of f-computable subsets of $\mathbb{N}$ for some f $\epsilon \mathcal{C}[O, 1]$ of non-total degree; and there are computably incomparable f, g $\epsilon \mathcal{C}[0, 1]$ which compute exactly the same subsets of $\mathbb{N}$ . Proofs draw from classical analysis and constructive analysis as well as from computability theory. (shrink)

On 12 May 1962, a frail Douglas MacArthur delivered his final public speech to the cadets at the United States Military Academy. A West Point graduate himself, MacArthur served as Superintendent of...

Der folgende Artikel ist im Jahr 2003 unter dem Titel „Clinical Pragmatism: A Method of Moral Problem Solving“ in dem Sammelband „Pragmatic bioethics“ erschienen, welcher sich mit der Bedeutung der pragmatistischen Philosophie für die Praxis befasst. In dem vom Internisten und Bioethiker Joseph J. Fins, dem Thoraxchirurgen Matthew D. Bacchetta und dem Philosophen und Medizinethiker Franklin G. Miller verfassten Beitrag wird der pragmatistische Ansatz in der klinischen Ethik anhand eines Fallbeispiels gleichzeitig beschrieben, begründet und demonstriert. Obgleich die Denkrichtung (...) der pragmatistischen Philosophie sowohl wissenschaftstheoretisch wie praktisch hoch bedeutsam ist – ohne diese ist weder die heutige sozialwissenschaftliche Forschung noch die angewandte, insbesondere die klinische Ethik denkbar –, werden pragmatistische Ansätze im deutschsprachigen Raum bis heute eher rudimentär rezipiert. (shrink)

The literature on self-driving cars and ethics continues to grow. Yet much of it focuses on ethical complexities emerging from an individual vehicle. That is an important but insufficient step towards determining how the technology will impact human lives and society more generally. What must complement ongoing discussions is a broader, system level of analysis that engages with the interactions and effects that these cars will have on one another and on the socio-technical systems in which they are embedded. To (...) bring the conversation of self-driving cars to the system level, we make use of two traffic scenarios which highlight some of the complexities that designers, policymakers, and others should consider related to the technology. We then describe three approaches that could be used to address such complexities and their associated shortcomings. We conclude by bringing attention to the “Moral Responsibility for Computing Artifacts: The Rules”, a framework that can provide insight into how to approach ethical issues related to self-driving cars. (shrink)

A vision of a living code of ethics is proposed to counter the emphasis on negative phenomena in the study of organizational ethics. The living code results from the harmonious interaction of authentic leadership, five key organizational processes (attraction–selection–attrition, socialization, reward systems, decision-making and organizational learning), and an ethical organizational culture (characterized by heightened levels of ethical awareness and a positive climate regarding ethics). The living code is the cognitive, affective, and behavioral manifestation of an ethical organizational identity. We draw (...) on business ethics literature, positive organizational scholarship, and management literature to outline the elements of positive ethical organizations as those exemplary organizations consistently practicing the highest levels of organizational ethics. In a positive ethical organization, the right thing to do is the only thing to do. (shrink)

We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a function of incomplete degree that dominates almost all degrees. This answers a question of Dobrinen and Simpson, who showed that such functions are related to the proof-theoretic strength of the regularity of Lebesgue measure for Gδ sets. Our constructions essentially settle the reverse mathematical classification of this principle.

BackgroundThe U.S. Food and Drug Administration traditionally has kept confidential significant amounts of information relevant to the approval or non-approval of specific drugs, devices, and biologics and about the regulatory status of such medical products in FDA’s pipeline.ObjectiveTo develop practical recommendations for FDA to improve its transparency to the public that FDA could implement by rulemaking or other regulatory processes without further congressional authorization. These recommendations would build on the work of FDA’s Transparency Task Force in 2010.MethodsIn 2016-2017, we convened (...) a team of academic faculty from Harvard Medical School, Brigham and Women’s Hospital, Yale Medical School, Yale Law School, and Johns Hopkins Bloomberg School of Public Health to develop recommendations through an iterative process of reviewing FDA’s practices, considering the legal and policy constraints on FDA in expanding transparency, and obtaining insights from independent observers of FDA.ResultsThe team developed 18 specific recommendations for improving FDA’s transparency to the public. FDA could adopt all these recommendations without further congressional action.FundingThe development of the Blueprint for Transparency at the U.S. Food and Drug Administration was funded by the Laura and John Arnold Foundation. (shrink)

In dynamic epistemic logic and other fields, it is natural to consider relativization as an operator taking sentences to sentences. When using the ideas and methods of dynamic logic, one would like to iterate operators. This leads to iterated relativization. We are also concerned with the transitive closure operation, due to its connection to common knowledge. We show that for three fragments of the logic of iterated relativization and transitive closure, the satisfiability problems are fi1 11–complete. Two of these fragments (...) do not include transitive closure. We also show that the question of whether a sentence in these fragments has a finite (tree) model is fi0 01–complete. These results go via reduction to problems concerning domino systems. (shrink)

It is time for a new paper about open questions in the currently very active area of randomness and computability. Ambos-Spies and Kučera presented such a paper in 1999 [1]. All the question in it have been solved, except for one: is KL-randomness different from Martin-Löf randomness? This question is discussed in Section 6.Not all the questions are necessarily hard—some simply have not been tried seriously. When we think a question is a major one, and therefore likely to be hard, (...) we indicate this by the symbol ▶, the criterion being that it is of considerable interest and has been tried by a number of researchers. Some questions are close contenders here; these are marked by ▷. With few exceptions, the questions are precise. They mostly have a yes/no answer. However, there are often more general questions of an intuitive or even philosophical nature behind. We give an outline, indicating the more general questions.All sets will be sets of natural numbers, unless otherwise stated. These sets are identified with infinite strings over {0, 1}. Other terms used in the literature are sequence and real. (shrink)

In The Healer's Power, Howard Brody placed the concept of power at the heart of medicine's moral discourse. Struck by the absence of “power” in the prevailing vocabulary of medical ethics, yet aware of peripheral allusions to power in the writings of some medical ethicists, he intuited the importance of power from the silence surrounding it. He formulated the problem of the healer's power and its responsible use as “the central ethical problem in medicine.” Through the prism of power he (...) refracted a wide range of ethical problems, from informed consent to truth-telling, from confidentiality to futility, from the physician's fantasies to the physician's virtues. At times this prism shed new light on old problems, enabling us to see from an unexpected angle the elements of which the problem was composed. At other times it exposed issues of ethical significance that had been neglected in the bioethics literature. (shrink)

We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu [16], this proves that they coincide with the hyperimmune-free non-DNR degrees, which are also exactly the degrees that are low for weak 1-genericity. We also consider Low(M, Kurtz), the class of degrees a such that every element of M is a-Kurtz random. These are characterised when M is the class of Martin-Löf random, computably random, or Schnorr random reals. (...) We show that Low(ML, Kurtz) coincides with the non-DNR degrees, while both Low(CR, Kurtz) and Low(Schnorr, Kurtz) are exactly the non-high, non-DNR degrees. (shrink)

We consider effective versions of two classical theorems, the Lebesgue density theorem and the Denjoy–Young–Saks theorem. For the first, we show that a Martin-Löf random real z ∈ [0, 1] is Turing incomplete if and only if every effectively closed class.

1. A Profession of Faith -- 2. Who or What Decides, for Derrida : A Catastrophic Theory of Decision -- 3. Derrida's Destinerrance -- 4. The Late Derrida -- 5. Derrida's Remains -- 6. Derrida Enisled -- 7. Derrida's Special Theory of Performativity --8. "Don't Count Me In" : Derrida's Refraining -- 9. Derrida's Ethics of Irresponsibilization ; or, How to Get Irresponsible, in Two Easy Lessons -- 10. Derrida's Politics of Autoimmunity -- 11. Touching Derrida's Touching Nancy -- 12. (...) Absolute Mourning : It Is Jacques You Mourn For -- Notes -- Index. (shrink)

The question of what distinguishes moral problems from other problems is important to the study of the evolution and functioning of morality. Many researchers concerned with this topic have assumed, either implicitly or explicitly, that all moral problems are problems of cooperation. This assumption offers a response to the moral demarcation problem by identifying a necessary condition of moral problems. Characterizing moral problems as problems of cooperation is a popular response to this issue – especially among researchers empirically studying the (...) beginnings and limits of moral psychology. However, demarcating the moral in this way severely restricts the domain of moral problems. There are plenty of moral problems that aren’t simply problems of cooperation. In this paper I argue that understanding moral problems as problems of cooperation is too restrictive and offer an alternative way of demarcating moral from non-moral problems. Characterizing what makes a problem moral in terms of cooperation excludes a variety of problems that are ordinarily understood and responded to as moral. The alternative characterization that I propose is based on the American Indian/Native American concept of harmony. Using the concept of cooperation to demarcate the moral removes moral agents from their surroundings or contexts by assuming moral agency applies only to humans or other similarly evolved lifeforms. In contrast, using the concept of harmony allows for moral consideration to be granted to non-humans as well (e.g., non-human animals, plant life, ecosystems, etc.). (shrink)

We call A weakly low for K if there is a c such that $K^A(\sigma)\geq K(\sigma)-c$ for infinitely many σ; in other words, there are infinitely many strings that A does not help compress. We prove that A is weakly low for K if and only if Chaitin's Ω is A-random. This has consequences in the K-degrees and the low for K (i.e., low for random) degrees. Furthermore, we prove that the initial segment prefix-free complexity of 2-random reals is infinitely (...) often maximal. This had previously been proved for plain Kolmogorov complexity. (shrink)

This book demonstrates the presence of literature within speech act theory and the utility of speech act theory in reading literary works. Though the founding text of speech act theory, J. L. Austin's _How to Do Things with Words_, repeatedly expels literature from the domain of felicitous speech acts, literature is an indispensable presence within Austin's book. It contains many literary references but also uses as essential tools literary devices of its own: imaginary stories that serve as examples and imaginary (...) dialogues that forestall potential objections. _How to Do Things with Words_ is not the triumphant establishment of a fully elaborated theory of speech acts, but the story of a failure to do that, the story of what Austin calls a "bogging down." After an introductory chapter that explores Austin's book in detail, the two following chapters show how Jacques Derrida and Paul de Man in different ways challenge Austin's speech act theory generally and his expulsion of literature specifically. Derrida shows that literature cannot be expelled from speech acts—rather that what he calls "iterability" means that any speech act may be literature. De Man asserts that speech act theory involves a radical dissociation between the cognitive and positing dimensions of language, what Austin calls language's "constative" and "performative" aspects. Both Derrida and de Man elaborate new speech act theories that form the basis of new notions of responsible and effective politico-ethical decision and action. The fourth chapter explores the role of strong emotion in effective speech acts through a discussion of passages in Derrida, Wittgenstein, and Austin. The final chapter demonstrates, through close readings of three passages in Proust, the way speech act theory can be employed in an illuminating way in the accurate reading of literary works. (shrink)

We study reals with infinitely many incompressible prefixes. Call $A \in 2^{\omega}$ Kolmogorot random if $(\exists^{\infty}n) C(A \upharpoonright n) \textgreater n - \mathcal{O}(1)$ , where C denotes plain Kolmogorov complexity. This property was suggested by Loveland and studied by $Martin-L\ddot{0}f$ , Schnorr and Solovay. We prove that 2-random reals are Kolmogorov random. Together with the converse-proved by Nies. Stephan and Terwijn [11]-this provides a natural characterization of 2-randomness in terms of plain complexity. We finish with a related characterization of 2-randomness.

Drawing primarily from the cultural traditions and beliefs of the Muscogee peoples, I will provide an account of how harmony can play a foundational role in providing a structure to morality. In the process of providing this account, I will begin (§2) by defining two key Muscogee concepts: ‘energy’ (§2.1) and ‘harmony’ (§2.2). I will also explain how the relationship between these two concepts can provide a structure for morality. Then I will explain the conditions that make promoting harmony a (...) normative principle (§3) by explaining why promoting harmony is relevant to humans (§3.1) as well as a providing a prudential reason to promote harmony (§3.2). Finally, I will explain how harmony can be achieved (§4) by explaining two examples that highlight the importance of non-moral knowledge in promoting harmony. I will then conclude with some remarks about how the Muscogee concept of harmony relates to some contemporary metaethical concerns (§5). (shrink)

We examine the sequences A that are low for dimension, i.e. those for which the effective dimension relative to A is the same as the unrelativized effective dimension. Lowness for dimension is a weakening of lowness for randomness, a central notion in effective randomness. By considering analogues of characterizations of lowness for randomness, we show that lowness for dimension can be characterized in several ways. It is equivalent to lowishness for randomness, namely, that every Martin-Löf random sequence has effective dimension (...) 1 relative to A, and lowishness for K, namely, that the limit of KA/K is 1. We show that there is a perfect [Formula: see text]-class of low for dimension sequences. Since there are only countably many low for random sequences, many more sequences are low for dimension. Finally, we prove that every low for dimension is jump-traceable in order nε, for any ε > 0. (shrink)

We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k,l) and OVW(k,l) from the perspectives of reverse mathematics and effective mathematics. We give a statement of the Dual Ramsey Theorem for open colorings in second order arithmetic and formalize work of Carlson and Simpson [1] to show that this statement implies ACA 0 over RCA 0 . We show that neither VW(2,2) nor OVW(2,2) is provable in WKL 0 . These results give partial answers to questions posed by (...) Friedman and Simpson [3]. (shrink)

We study the degrees of bi-hyperhyperimmune sets. Our main result characterizes these degrees as those that compute a function that is not dominated by any ∆02 function, and equivalently, those that compute a weak 2-generic. These characterizations imply that the collection of bi-hhi Turing degrees is closed upwards.

We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that the maximal (...) value of ${\rm{\hat{\Omega }}}$ must be random, the minimal value must be Turing complete, and that ${\rm{\hat{\Omega }}}\left \oplus X{ \ge _T}\emptyset \prime$ for every X. We also obtain some machine-dependent results, including that for every $\varepsilon > 0$, there is a universal machine V such that ${{\rm{\hat{\Omega }}}_V}$ maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that $X{ \le _{tt}}{{\rm{\hat{\Omega }}}_V}\left$; and that there is a real X and a universal machine V such that ${{\rm{\Omega }}_V}\left$ is rational. (shrink)

There is a perfect thin class whose upward closure in the Turing degrees has full measure . Thus, in the Muchnik lattice of classes, the degree of 2-random reals is comparable with the degree of some perfect thin class. This solves a question of Simpson [S. Simpson, Mass problems and randomness, Bulletin of Symbolic Logic 11 1–27].

The tower number ${\mathfrak t}$ and the ultrafilter number $\mathfrak {u}$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of $\omega $ and the almost inclusion relation $\subseteq ^*$ between such subsets. We consider analogs of these cardinal characteristics in computability theory.We say that a sequence $(G_n)_{n \in {\mathbb N}}$ of computable sets is a tower if $G_0 = {\mathbb N}$, $G_{n+1} \subseteq ^* G_n$, and $G_n\smallsetminus G_{n+1}$ is infinite for each n. (...) A tower is maximal if there is no infinite computable set contained in all $G_n$. A tower ${\left \langle {G_n}\right \rangle }_{n\in \omega }$ is an ultrafilter base if for each computable R, there is n such that $G_n \subseteq ^* R$ or $G_n \subseteq ^* \overline R$ ; this property implies maximality of the tower. A sequence $(G_n)_{n \in {\mathbb N}}$ of sets can be encoded as the “columns” of a set $G\subseteq \mathbb N$. Our analogs of ${\mathfrak t}$ and ${\mathfrak u}$ are the mass problems of sets encoding maximal towers, and of sets encoding towers that are ultrafilter bases, respectively. The relative position of a cardinal characteristic broadly corresponds to the relative computational complexity of the mass problem. We use Medvedev reducibility to formalize relative computational complexity, and thus to compare such mass problems to known ones.We show that the mass problem of ultrafilter bases is equivalent to the mass problem of computing a function that dominates all computable functions, and hence, by Martin’s characterization, it captures highness. On the other hand, the mass problem for maximal towers is below the mass problem of computing a non-low set. We also show that some, but not all, noncomputable low sets compute maximal towers: Every noncomputable (low) c.e. set computes a maximal tower but no 1-generic $\Delta ^0_2$ -set does so.We finally consider the mass problems of maximal almost disjoint, and of maximal independent families. We show that they are Medvedev equivalent to maximal towers, and to ultrafilter bases, respectively. (shrink)

We give two new characterizations of K-triviality. We show that if for all Y such that Ω is Y-random, Ω is -random, then A is K-trivial. The other direction was proved by Stephan and Yu, giving us the first titular characterization of K-triviality and answering a question of Yu. We also prove that if A is K-trivial, then for all Y such that Ω is Y-random, ≡LRY. This answers a question of Merkle and Yu. The other direction is immediate, so (...) we have the second characterization of K-triviality.The proof of the first characterization uses a new cupping result. We prove that if A≰LRB, then for every set X there is a B-random set Y such that X is computable from Y⊕A. (shrink)

We study the sets that are computable from both halves of some (Martin–Löf) random sequence, which we call 1/2-bases. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e. elements. It is a proper subideal of the K-trivial sets. We characterize 1/2-bases as the sets computable from both halves of Chaitin’s Ω, and as the sets that obey the cost function c(x,s)=Ωs−Ωx−−−−−−−√. Generalizing these results yields a dense hierarchy of (...) subideals in the K-trivial degrees: For k<n, let Bk/n be the collection of sets that are below any k out of n columns of some random sequence. As before, this is an ideal generated by its c.e. elements and the random sequence in the definition can always be taken to be Ω. Furthermore, the corresponding cost function characterization reveals that Bk/n is independent of the particular representation of the rational k/n, and that Bp is properly contained in Bq for rational numbers p<q. These results are proved using a generalization of the Loomis–Whitney inequality, which bounds the measure of an open set in terms of the measures of its projections. The generality allows us to analyze arbitrary families of orthogonal projections. As it turns out, these do not give us new subideals of the K-trivial sets; we can calculate from the family which Bp it characterizes. We finish by studying the union of Bp for p<1; we prove that this ideal consists of the sets that are robustly computable from some random sequence. This class was previously studied by Hirschfeldt [D. R. Hirschfeldt, C. G. Jockusch, R. Kuyper and P. E. Schupp, Coarse reducibility and algorithmic randomness, J. Symbolic Logic81(3) (2016) 1028–1046], who showed that it is a proper subclass of the K-trivial sets. We prove that all such sets are robustly computable from Ω, and that they form a proper subideal of the sets computable from every (weakly) LR-hard random sequence. We also show that the ideal cannot be characterized by a cost function, giving the first such example of a Σ03 subideal of the K-trivial sets. (shrink)

There has been little discussion about how to act when uncertain about the existence of moral reasons in general. In this paper I will argue that despite being uncertain about the existence of moral reasons, someone can still have a practical reason to act in a particular way. This practical reason is morally relevant because it will have an impact on whether we’re making the correct moral decision. This practical reason will result from a principle of decision-making that can be (...) used when someone is agnostic about the existence of moral reasons. The aims of this paper include explicitly beginning the discussion about this topic and advocating for a principle of moral decision-making that can be used despite being metaethically agnostic. (shrink)