“Basic equality” is the thesis that all (or nearly all) human beings are equal in moral status. Widespread interpersonal differences among humans make the task of justifying basic equality notoriously difficult. One strategy for circumventing this difficulty is to identify some morally significant binary (“all-or-nothing”) property that all humans have. This strategy seems promising: if the basis of equality is binary, then those who have it have it equally. However, skeptics have argued against this strategy on the grounds that a (...) proper defense of basic equality requires that we identify a morally significant property that can vary among humans but does not in fact vary. This paper examines various ways in which this skeptical argument can be motivated and concludes that they all fail. (shrink)

ABSTRACT:In the last two decades it has become increasingly common to advocate for a complete ban on the sale of cigarettes. One reason in favor of such a ban is egalitarian: differences in the prevalence of smoking between socioeconomic groups go a long way in explaining health inequality, and a complete ban might be effective in reducing this inequality. However, a complete ban might also be objectionable on egalitarian grounds if issued with a discriminatory intent or if it is selectively (...) paternalistic. This article argues that a complete ban is likely to be guilty of both, especially when one of its aims is to reduce unequal rates of smoking between groups. A complete ban on the sale of cigarettes thus exhibits a curious feature: in aiming to reduce inequality it threatens to be inegalitarian. This is characteristic of a wider class of public health policies that deserves further attention by egalitarians. (shrink)

Human brain organoids (HBOs) are novel entities that may exhibit unique forms of cognitive potential. What moral status, if any, do they have? Several authors propose that consciousness may hold the answer to this question. Others identify various _kinds of_ consciousness as crucially important for moral consideration, while leaving open the challenge of determining whether HBOs have them. This paper aims to make progress on these questions in two ways. First, it proposes a framework for thinking about the moral status (...) of entities other than paradigmatic persons. This framework identifies four qualities that ground moral status: evaluative stance, self-directedness, agency, and other-directedness. Second, we speculate on ways in which these qualities are relevant to dimensions of conscious experience that have been, or could be, identified in nonhuman animals. We further explore how these approaches could be adapted for use in HBOs, and argue that such studies, or something similar to them, will have to be performed if we wish to have empirical indications that HBOs have consciousness of a morally significant kind. We end by proposing that in our current scientific and epistemic situation, it is too soon to attribute any moral status to HBOs, but that this might change in the future. (shrink)

The present study tested the existence of a cognitive schema that guides people's evaluations of the likelihood that observed problem-solving processes will succeed. The hypothesised schema consisted of attributes that were found to distinguish between retrospective case reports of successful and unsuccessful real world problem solving (Lipshitz & Bar Ilan, 1996). Participants were asked to evaluate the likelihood of success of identical cases of problem solving that differed in the presence or absence of diagnosis, the selection of appropriate or (...) inappropriate solutions, and the pairing of diagnosis with appropriate or non-appropriate solutions. Consistent with the proposition, diagnosis affected perceived likelihood of success, albeit only when solution quality was held constant, and appropriate diagnosis with a compatible solution produced higher perceived likelihood of success than appropriate diagnosis with incompatible solutions. In addition, results showed that solution quality played a significant role, and that compatibility with a six-phase rational model of problem solving played no role in judging likelihood of success. (shrink)

Replacing logical coherence by effectiveness as criteria of rationality, Gigerenzer et al. show that simple heuristics can outperform comprehensive procedures (e.g., regression analysis) that overload human limited information processing capacity. Although their work casts long overdue doubt on the normative status of the Rational Choice Paradigm, their methodology leaves open its relevance as to how decisions are actually made.

This paper presents an integrative framework for analyzing decisions. Three generic modes of decision making are identified: consequential choice , matching and reassessment . The three generic modes are compared on a common set of attributes, and the conditions for their proper use are outlined. Two case analyses illustrate how the framework can be used to analyze specific decisions from multiple perspectives.

The eukaryotic cell is partitioned by membranes into spatially and functionally discrete subcellular organelles. In addition, the cytoplasm itself is partitioned into discrete subregions that carry out specific functions. Such compartmentation can be achieved by localizing proteins and RNAs to different subcellular regions. This review will focus on localized RNAs, with a particular emphasis on RNA localization mechanisms and on the possible biological functions of localization of these RNAs. In recent years, an increasing number of localized RNAs have been identified (...) in a variety of cell types among many animal species. Emphasis here will be on localized RNAs in the most intensively studied systems – Drosophila and Xenopus eggs and early embryos. (shrink)

We use a new construction of an o-minimal structure, due to Lipshitz and Robinson, to answer a question of van den Dries regarding the relationship between arbitrary o-minimal expansions of real closed fields and structures over the real numbers. We write a first order sentence which is true in the Lipshitz-Robinson structure but fails in any possible interpretation over the field of real numbers.

Church's thesis, that all reasonable definitions of “computability” are equivalent, is not usually thought of in terms of computability by acontinuouscomputer, of which the general-purpose analog computer (GPAC) is a prototype. Here we prove, under a hypothesis of determinism, that the analytic outputs of aC∞GPAC are computable by a digital computer.In [POE, Theorems 5, 6, 7, and 8], Pour-El obtained some related results. (The proof there of Theorem 7 depends on her Theorem 2, for which the proof in [POE] is (...) incorrect, but for which a correct proof is given in [LIR]. Also, the proof in [POE] of Theorem 8 depends on the unproved assertion that a solution of an algebraic differential equation must be analytic on an open subset of its domain. However, this assertion was later proved in [BRR].) As in [POE], we reduce the problem to a problem about solutions of certain systems of algebraic differential equations (ADE's). If such a system is nonsingular (i.e. if the “separant” does not vanish along the given solution), then the argument is very easy (see [VSD] for an even simpler situation), so that the essential difficulties arise fromsingularsystems. Our main tools in handling these difficulties are drawn from the excellent (and difficult) paper [DEL] by Denef and Lipshitz. The author especially wants to thank Leonard Lipshitz for his kind help in the preparation of the present paper.We emphasize here that our proof of the simulation result applies only to the GPAC as described below. The GPAC's form a natural subclass of the class of all analog computers, and are based on certain idealized components (“black boxes”), mostly associated with the technology of past decades. One can easily envisage other kinds of black boxes of an input-output character that would lead to different kinds of analog computers. (For example, one could incorporate delays, or spatial integrators in addition to the present temporal integrators, etc.) Whether digital simulation is possible for these “extended” analog computers poses a rich and challenging set of research questions. (shrink)

When [Formula: see text] is a finite field, [J. Becker, J. Denef and L. Lipshitz, Further remarks on the elementary theory of formal power series rings, in Model Theory of Algebra and Arithmetic, Proceedings Karpacz, Poland, Lecture Notes in Mathematics, Vol. 834 (Springer, Berlin, 1979)] observed that the total residue map [Formula: see text], which picks out the constant term of the Laurent series, is definable in the language of rings with a parameter for [Formula: see text]. Driven by (...) this observation, we study the theory [Formula: see text] of valued fields equipped with a linear form [Formula: see text] which restricts to the residue map on the valuation ring. We prove that [Formula: see text] does not admit a model companion. In addition, we show that [Formula: see text] is undecidable whenever [Formula: see text] is an infinite field. As a consequence, we get that [Formula: see text] is undecidable, where [Formula: see text] maps [Formula: see text] to its complex residue at [Formula: see text]. (shrink)

We continue the study of a theory which is a valued analogue of the theory of regular rings studied by Carson, Lipshitz and Saracino, characterize it as the model companion of the theory of Prüfer rings, and prove its decidability. We then link it to the theory of p.p. rings developed by Weispfenning and show that it admits quantifier elimination in a related language.

Extending the language of rings to include predicates for Jacobson radical relations, we show that the theory of regular rings defined by Carson, Lipshitz and Saracino is the model completion of the theory of semisimple rings. Removing the requirement on the Jacobson radical (reduced to {0}), we prove that the theory of rings with no nilpotents does not admit a model companion relative to this augmented language.

The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper. This theorem also has other consequences in the geometry of definable sets. The method of proving quantifier elimination in this paper for an analytic language does not require the algebraic quantifier elimination theorem of Weispfenning, unlike (...) the customary method of proof used in similar earlier analytic quantifier elimination theorems. (shrink)