G. A. Cohen, in his ‘The Structure of Proletarian Unfreedom,’ addresses the classical Marxist claim that workers are forced to sell their labour power under capitalism. This claim has been the object of much debate and controversy. Cohen brings his very considerable analytical skills to bear on this question with the result that he supports, in distinctive but non-conflicting ways, both sides of the controversy. On Cohen’s analysis this claim is ambiguous, i.e., the term ‘proletariat’ has two importantly different senses. (...) In the distributive sense, workers need not be coerced, but in the collective sense, they are coerced, i.e., each individual worker is free to leave the working class, but the class of workers' as a whole does not possess a similar freedom. In this paper, I will argue that Cohen’s argument does not establish that the proletariat qua individuals are not forced to sell their labour power. It will also be argued that, in fac;t, there is no definite answer to the question of whether or not workers are forced to sell their labour power. Freedom and coercion are matters of degree, for the relevant range of cases, and, hence, it is not appropriate to ask whether or not the workers are coerced. I will, however, attempt to show that, contrary to the spirit of Cohen’s thesis, proletariat as individuals suffer from a diminished degree of freedom in the sale of their labour power. (shrink)

Robert richman tries to defend a justified-True-Belief analysis of knowledge by attacking the assumption that a justified belief can be false. But, Although 'p is justified but false' is incoherent if asserted about the way things actually are, It is not incoherent if asserted about a supposed situation. And critics of a justified-True-Belief analysis need only do the latter.

One reasonably familiar argument for epistemological scepticism maintains that knowledge requires foundations and that we rarely, if ever, have such foundations. The conclusion of this argument is that we rarely, if ever, have knowledge. A second, less ambitious sceptical argument is that philosophers cannot justifiably say that they have knowledge unless their statement is based on foundations and that we never have such foundations. The conclusion of this argument is not that we never have knowledge, but that philosophers are never (...) justified in saying that they have knowledge. The scepticism is Pyrrhonic, rather than Academic, and merely attempts to counter knowledge assertions, not establish that they are false. It tries to show that in most cases the best response we can give to ‘Do we have knowledge?’ is to remain indifferent. (shrink)

In a critical study of some recent action theory Professor James Tomberlin [7] makes some insightful and suggestive remarks concerning the by now well known problem of "Smith and the airplane" formulated by Keith Lehrer and Richard Taylor [3]. While these remarks do significantly advance our knowledge of the nature of the problem, I would like to try to show why the strategy they indicate does not lead to a solution that represents any improvement on the one developed in [1], (...) [8] and [2].The problem of Smith and the airplane is posed by the following apparent inconsistency. Suppose it is now shortly before 3:30 and Smith is at a country airport. The 3:30 plane is the only possible means whereby Smith can arrive at the city at 4:00. There is nothing to prevent Smith from leaving on the 3:30 plane, but he in fact does not do so: Then each of the following statements are true. (shrink)

In ‘Can and Might’, Professor K. W. Rankin has presented three arguments that purport to refute the equivalence, ‘A is causally possible for P if and only if A is within P's power’. The first two arguments are attributed to Richard Taylor, and the third is Professor Rankin's own. I will argue that none of these three arguments effectively refutes the above equivalence. My arguments are not to be construed as simply a rebuttal of Professor Rankin's paper since he also (...) appears to have some doubts about Taylor's arguments and I refrain from comment on other aspects of his paper except these three arguments. I conclude with some general remarks on. (shrink)

The first major legislation of the new Scottish Parliament is an Education Act which has a dramatic impact on the General Teaching Council for Scotland. The Act has implications for the influence of teacher unions over the Council, for the dismissal of teachers who are deemed to be incompetent, and for the continuing professional development of teachers. Relationships between teachers and government are thus fundamentally changed by the new Parliament and its processes.

Over the past century, animal agriculture in the United States has transformed from a system of small, family farms to a largely industrialized model—often known as ‘industrial farm animal production’ (IFAP). This model has successfully produced a large supply of cheap meat, eggs and dairy products, but at significant costs to animal welfare, the environment, the risk of zoonotic disease, the economic and social health of rural communities, and overall food abundance. Over the past 40 years, numerous critiques of IFAP (...) have been published, for both academic and non-academic audiences, mostly focusing on our obligations to animals. Here we offer a comprehensive critique of IFAP, focusing not only on our obligations to animals, but also important environmental, social, economic, and public health concerns. Our cumulative argument proceeds in five steps: (1) we briefly review the structure and key characteristics of IFAP; (2) we review the adverse effects of IFAP; (3) we review the historical development and positive rationale for IFAP; (4) we summarize previous moral critiques of IFAP, as well as defenses of it; and (5) we offer a moral critique of IFAP based on the common morality, and in particular on a principle of nonmaleficence, which we take to be the least controversial argument. (shrink)

In this article, I make the case for the continued relevance of Plato’s Timaeus. I begin by sketching Allan Bloom’s picture of the natural sciences today in The Closing of the American Mind, according to which the natural sciences are, objectionably, increasingly specialized and have ejected humans qua humans from their purview. I argue that Plato’s Timaeus, despite the falsity of virtually all of its scientific claims, provides a model for how we can pursue scientific questions in a comprehensive way (...) that stresses their connections to other disciplines, including the humanities, and that puts humanity qua humanity back in the picture. I then argue that being led by Plato’s philosophy to return humanity conceptually to the natural world can improve our thinking regarding climate change and other important environmental crises. (shrink)

Chapter INTRODUCTION Charles Sanders Peirce is quickly becoming the dominant figure in the history of American philosophy. The breadth and depth of his work ...

The partial ordering of Medvedev reducibility restricted to the family of Π0 1 classes is shown to be dense. For two disjoint computably enumerable sets, the class of separating sets is an important example of a Π0 1 class, which we call a ``c.e. separating class''. We show that there are no non-trivial meets for c.e. separating classes, but that the density theorem holds in the sublattice generated by the c.e. separating classes.

The American thinker Charles Sanders Peirce, best known as the founder of pragmatism, has been influential not only in the pragmatic tradition but more recently in the philosophy of science and the study of semiotics, or sign theory. Strands of System provides an accessible overview of Peirce's systematic philosophy for those who are beginning to explore his thinking and its import for more recent trends in philosophy.

Abstract.The partial ordering of Medvedev reducibility restricted to the family of Π01 classes is shown to be dense. For two disjoint computably enumerable sets, the class of separating sets is an important example of a Π01 class, which we call a ``c.e. separating class''. We show that there are no non-trivial meets for c.e. separating classes, but that the density theorem holds in the sublattice generated by the c.e. separating classes.

Cenzer, D., R. Downey, C. Jockusch and R.A. Shore, Countable thin Π01 classes, Annals of Pure and Applied Logic 59 79–139. A Π01 class P {0, 1}ω is thin if every Π01 subclass of P is the intersection of P with some clopen set. Countable thin Π01 classes are constructed having arbitrary recursive Cantor- Bendixson rank. A thin Π01 class P is constructed with a unique nonisolated point A and furthermore A is of degree 0’. It is shown that no (...) set of degree ≥0” can be a member of any thin Π01 class. An r.e. degree d is constructed such that no set of degree d can be a member of any thin Π01 class. It is also shown that between any two distinct comparable r.e. degrees, there is a degree that contains a set which is of rank one in some thin Π01 class. It is shown that no maximal set can have rank one in any Π01 class, while there exist maximal sets of rank 2. The connection between Π01 classes, propositional theories and recursive Boolean algebras is explored, producing several corollaries to the results on Π01 classes. For example, call a recursive Boolean algebra thin if it has no proper nonprincipal recursive ideals. Then no thin recursive Boolean algebra can have a maximal ideal of degree ≥0”. (shrink)

This paper is a continuation of the authors' work , where the main problem considered was whether a given recursive structure is recursively isomorphic to a polynomial-time structure. In that paper, a recursive Abelian group was constructed which is not recursively isomorphic to any polynomial-time Abelian group. We now show that if every element of a recursive Abelian group has finite order, then the group is recursively isomorphic to a polynomial-time group. Furthermore, if the orders are bounded, then the group (...) is recursively isomorphic to a polynomial-time group with universe A being the set of tally representations of natural numbers Tal = s{;1s};* or the set of binary representations of the natural numbers Bin. We also construct a recursive Abelian group with all elements of finite order but which has elements of arbitrary large finite order which is not isomorphic to any polynomial-time group with universe Tal or Bin. Similar results are obtained for structures , where f is a permutation on the set A. (shrink)

A brief exploration of the nature of, and motivations for, contemporary forms of metaethical quietism. Also outlines some of the prominent objections to such positions and discusses some of the limitations of these objections from the quietist's perspective.

I defend what may loosely be called an eliminativist account of causation by showing how several of the main features of causation, namely asymmetry, transitivity, and necessitation, arise from the combination of fundamental dynamical laws and a special constraint on the macroscopic structure of matter in the past. At the microscopic level, the causal features of necessitation and transitivity are grounded, but not the asymmetry. At the coarse-grained level of the macroscopic physics, the causal asymmetry is grounded, but not the (...) necessitation or transitivity. Thus, at no single level of description does the physics justify the conditions that are taken to be constitutive of causation. Nevertheless, if we mix our reasoning about the microscopic and macroscopic descriptions, the structure provided by the dynamics and special initial conditions can justify the folk concept of causation to a significant extent. I explain why our causal concept works so well even though at bottom it is comprised of a patchwork of principles that don't mesh well. (shrink)

The central problem considered in this paper is whether a given recursive structure is recursively isomorphic to a polynomial-time structure. Positive results are obtained for all relational structures, for all Boolean algebras and for the natural numbers with addition, multiplication and the unary function 2x. Counterexamples are constructed for recursive structures with one unary function and for Abelian groups and also for relational structures when the universe of the structure is fixed. Results are also given which distinguish primitive recursive structures, (...) exponential-time structures and structures with honest witnesses. (shrink)

In order to improve our understanding of the components that reflect functionally important processes during reward anticipation and consumption, we used principle components analyses (PCA) to separate and quantify averaged ERP data obtained from each stage of a modified monetary incentive delay (MID) task. Although a small number of recent ERP studies have reported that reward and loss cues potentiate ERPs during anticipation, action preparation, and consummatory stages of reward processing, these findings are inconsistent due to temporal and spatial overlap (...) between the relevant electrophysiological components. Our results show three components following cue presentation are sensitive to incentive cues (N1, P3a, P3b). In contrast to previous research, reward‐related enhancement occurred only in the P3b, with earlier components more sensitive to break‐even and loss cues. During feedback anticipation, we observed a lateralized centroparietal negativity that was sensitive to response hand but not cue type. We also show that use of PCA on ERPs reflecting reward consumption successfully separates the reward positivity from the independently modulated feedback‐P3. Last, we observe for the first time a new reward consumption component: a late negativity distributed over the left frontal pole. This component appears to be sensitive to response hand, especially in the context of monetary gain. These results illustrate that the time course and sensitivities of electrophysiological activity that follows incentive cues do not follow a simple heuristic in which reward incentive cues produce enhanced activity at all stages and substages. (shrink)

Several diagrams and tables from review articles during the Ox-Phos Controversy serve as an occasion to assess the nature of competition in models of theory choice in science. Many models follow "Super-Bowl" principles of polar, either-or, winner-take-all competition. A significant alternative highlighted by this episode, however, is the differentiation of domains. Incommensurability and the partial divergence of overlapping domains serve both as signals and context for shifting frameworks of competition. Appropriate strategies may thus help researchers diagnose the status of competition (...) and shape their research accordingly. (shrink)

A Π01 class is an effectively closed set of reals. We study properties of these classes determined by cardinality, measure and category as well as by the complexity of the members of a class P. Given an effective enumeration {Pe:e < ω} of the Π01 classes, the index set I for a certain property is the set of indices e such that Pe has the property. For example, the index set of binary Π01 classes of positive measure is Σ02 complete. (...) Various notions of boundedness are discussed and classified. For example, the index set of the recursively bounded classes is Σ03 complete and the index set of the recursively bounded classes which have infinitely many recursive members is Π04 complete. Consideration of the Cantor-Bendixson derivative leads to index sets in the transfinite levels of the hyperarithmetic hierarchy. (shrink)

We describe here an interdisciplinary lab science course for non-majors using the history of science as a curricular guide. Our experience with diverse instructors underscores the importance of the teachers and classroom dynamics, beyond the curriculum. Moreover, the institutional political context is central: are courses for non-majors valued and is support given to instructors to innovate? Two sample projects are profiled.

I highlight a category of experiment-what I am calling 'demonstrations'-that differs in justificatory mode and argumentative role from the more familiar 'crucial tests'. 'Tests' are constructed such that alternative results are equally and symmetrically informative; they help discriminate between alternative solutions within a problem-field, where questions are shared. 'Demonstrations' are notably asymmetrical (for example, "failures" are often not telling), yet they are effective, if not "crucial," in interparadigm dispute, to legitimate questions themselves. The Ox-Phos Controversy in bioenergetics serves as an (...) integral case study. (shrink)

This paper continues joint work of the authors with P. Clote, R. Soare and S. Wainer (Annals of Pure and Applied Logic, vol. 31 (1986), pp. 145--163). An element x of the Cantor space 2 ω is said have rank α in the closed set P if x is in $D^\alpha(P)\backslash D^{\alpha + 1}(P)$ , where D α is the iterated Cantor-Bendixson derivative. The rank of x is defined to be the least α such that x has rank α in (...) some Π 0 1 set. The main result of the five-author paper is that for any recursive ordinal λ + n (where λ is a limit and n is finite), there is a point with rank λ + n which is Turing equivalent to O (λ + 2n) . All ranked points constructed in that paper are Π 0 2 singletons. We now construct a ranked point which is not a Π 0 2 singleton. In the previous paper the points of high rank were also of high hyperarithmetic degree. We now construct ▵ 0 2 points with arbitrarily high rank. We also show that every nonrecursive RE point is Turing equivalent to an RE point of rank one and that every nonrecursive ▵ 0 2 point is Turing equivalent to a hyperimmune point of rank one. We relate Clote's notion of the height of a Π 0 1 singleton in the Baire space with the notion of rank. Finally, we show that every hyperimmune point x is Turing equivalent to a point which is not ranked. (shrink)

We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE presentations and we show that the groups ${\mathbb {Z}, Z(p^{\infty})}$ , and the additive group of the rationals have LOGSPACE presentations over a standard universe such as the tally representation and the binary representation of the natural numbers. We also study the effective categoricity of such groups. For (...) example, we give conditions are given under which two isomorphic LOGSPACE structures will have a linear space isomorphism. (shrink)

Important examples of $\Pi^0_1$ classes of functions $f \in {}^\omega\omega$ are the classes of sets (elements of ω 2) which separate a given pair of disjoint r.e. sets: ${\mathsf S}_2(A_0, A_1) := \{f \in{}^\omega2 : (\forall i < 2)(\forall x \in A_i)f(x) \neq i\}$ . A wider class consists of the classes of functions f ∈ ω k which in a generalized sense separate a k-tuple of r.e. sets (not necessarily pairwise disjoint) for each k ∈ ω: ${\mathsf S}_k(A_0,\ldots,A_k-1) := (...) \{f \in {}^\omega k : (\forall i < k) (\forall x \in A_i) f(x) \neq i\}$ . We study the structure of the Medvedev degrees of such classes and show that the set of degrees realized depends strongly on both k and the extent to which the r.e. sets intersect. Let ${\mathcal S}^m_k$ denote the Medvedev degrees of those ${\mathsf S}_k(A_0,\ldots,A_{k-1})$ such that no m + 1 sets among A 0,...,A k-1 have a nonempty intersection. It is shown that each ${\mathcal S}^m_k$ is an upper semi-lattice but not a lattice. The degree of the set of k-ary diagonally nonrecursive functions $\mathsf{DNR}_k$ is the greatest element of ${\mathcal S}^1_k$ . If 2 ≤ l < k, then 0 M is the only degree in ${\mathcal S}^1_l$ which is below a member of ${\mathcal S}^1_k$ . Each ${\mathcal S}^m_k$ is densely ordered and has the splitting property and the same holds for the lattice ${\mathcal L}^m_k$ it generates. The elements of ${\mathcal S}^m_k$ are exactly the joins of elements of ${\mathcal S}^1_i$ for $\lceil{k \over m}\rceil \leq i \leq k$. (shrink)

This article examines peirce's technical use of metaphor. in doing so it looks at certain aspects of his semiotics and, in particular, his division of signs into icons, indexes, and symbols. the upshoot is that, for peirce, metaphor plays a central role in artistic thought while analogy is central to scientific thought.

Assigning the moniker stakeholder to the planet has stirred a rather interesting debate in recent years. Proponents have insisted that the Earth is both the ultimate source of economic resources and the ultimate sink for economic wastes, meaning that it “affects or is affected by the achievement of the organization’s objectives” (Freeman, 1984, p. 46). They have said that giving the Earth stakeholder status can effectively tie the ecological health of the planet to the economic survival of the firm, and (...) they have demonstrated this by focusing primarily on the economic benefits which can accrue to firms that effectively respond to the ecological concerns of regulators, consumers, investors, lenders, insurers, and so forth. However, others have questioned assigning the Earth stakeholder status. They have said that doing so convolutes the definition of stakeholder too much by expanding it to something other than “person[s] and groups” (Freeman, 1984, p. 46), and they have said that referring to the planet as a stakeholder is an idealistic view which defies the realities of the relationship between economic activity and the Entropy Law. Regardless of the side, the arguments in this debate have focused primarily at the economic level. Does the Earth’s central place in humanity’s economic survival suffice to give it stakeholder status? Does the Earth have voices on boards of directors? Is the underlying assumption made by those who advocate giving the Earth stakeholder status—that economic activity is ecologically sustainable—truly reflective of the relationship between economics and entropy? However, for us this debate took an interesting turn away from the economic level at the 1997 Ruffin Lectures in Business Ethics when Ian Mitroff said, “The Earth is a stakeholder, but it is a spiritual stakeholder.”. (shrink)

The problem of when a recursive graph has a recursive k-coloring has been extensively studied by Bean, Schmerl, Kierstead, Remmel, and others. In this paper, we study the polynomial time analogue of that problem. We develop a number of negative and positive results about colorings of polynomial time graphs. For example, we show that for any recursive graph G and for any k, there is a polynomial time graph G′ whose vertex set is {0,1}* such that there is an effective (...) degree preserving correspondence between the set of k-colorings of G and the set of k-colorings of G′ and hence there are many examples of k-colorable polynomial time graphs with no recursive k-colorings. Moreover, even though every connected 2-colorable recursive graph is recursively 2-colorable, there are connected 2-colorable polynomial time graphs which have no primitive recursive 2-coloring. We also give some sufficient conditions which will guarantee that a polynomial time graph has a polynomial time or exponential time coloring. (shrink)