Working in ZF + DC with no additional use of the axiom of choice, we show how to iterate the extended ultrapower construction of Spector . This generalizes the technique of iterated ultrapowers to choiceless set theory. As an application, we prove the following theorem: Assume V = LU[κ] + “κ is λ-supercompact with normal ultrafilter U” + DC. Then for every sufficiently large regular cardinal ρ, there exists a set-generic extension V[G] of the universe in which there (...) exists for some σ a set S ρ for which one can define an elementary embedding j mapping V to LD[S], where D is the filter in V[G] generated by the closed unbounded filter on ρ. Moreover, we have j = ρ, j = σ, j) = S according to LD[S]), and j = D ∩ LD[S] i s a normal ultrafilter in LD[S] on ρ. (shrink)

In [10] Friedman showed that is a conservative extension of <ε0for-sentences wherei= min, i.e.,i= 2, 3, 4 forn= 0, 1, 2 +m. Feferman [5], [7] and Tait [11], [12] reobtained this result forn= 0, 1 and even with instead of. Feferman and Sieg established in [9] the conservativeness of over <ε0for-sentences for alln. In each paper, different methods of proof have been used. In particular, Feferman and Sieg showed how to apply familiar proof-theoretical techniques by passing through languages with Skolem (...) functionals.In this paper we study the same choice principles in the presence of theBar Rule, which permits one to infer the scheme of transfinite induction on a primitive recursive relation ≺ when it has been proved that ≺ is wellfounded. The main result characterizes + as a conservative extension of a system of the autonomously iterated-comprehension axiom for-sentences. Forn= 0 this has been proved by Feferman in the form that + is a conservative extension of <Γ0; this was first done in [8] by use of the Gödel functional interpretation for the stronger systemZω+μ+ + and then more recently by the simpler methods of [9]. Jäger showed how the latter methods could also be used to obtain the general result of Theorem 1 below. (shrink)

This paper presents an abstract-algebraic formulation of action facilitating reasoning about two opposing agents. Two dual nondeterministic choice operators are formulated abstract-algebraically: angelic (or user) choice and demonic (or system) choice. Iteration operators are also defined. As an application, Hoare-style correctness rules are established by means of the algebra. A negation operator is also discussed.

In this contribution we analyze how the actions of rational agents feed back on their beliefs. We present two agent-based computer simulations studying complex social interactions in which agents that follow utility maximizing strategies thereby deteriorate their own long-term quality of beliefs. We take these results as a starting point to discuss the complex relationship between rational action couched in terms of maximizing utility and the emergence of informational inequalities.

Two of the major problems in AGM-style belief revision, namely the difficulties in accounting for iterated change and for Ramsey test conditionals, have satisfactory solutions in descriptor revision. In descriptor revision, the input is a metalinguistic sentence specifying the success condition of the operation. The choice mechanism selects one of the potential outcomes in which the success condition is satisfied. Iteration of this operation is unproblematic. Ramsey test conditionals can be introduced without giving rise to the paradoxical results (...) that they generate in other systems. In addition to standard Ramsey test conditionals, a more general variant of epistemic conditionals is defined, representing statements of the form ”if the belief state is changed to satisfy condition A then it will satisfy condition B”. An axiomatic characterization of such descriptor conditionals is presented. It is related in intricate ways to the KLM postulates for cumulative reasoning. (shrink)

In (Hertwig et al. , 2003) Hertwig et al. draw a distinction between decisions from experience and decisions from description. In a decision from experience an agent does not have a summary description of the possible outcomes or their likelihoods. A career choice, deciding whether to back up a computer hard drive, cross a busy street, etc., are typical examples of decisions from experience. In such decisions agents can rely only of their encounters with the corresponding prospects. By contrast, (...) an agent furnished with information sources such as drug-package inserts or mutual-fund brochures—all of which describe risky prospects—will often make decisions from description. In (Hertwig et al. , 2003) it is shown (empirically) that decisions from experience and decisions from description can lead to dramatically different choice behavior. Most of these results (summarized and analyzed in (Hertwig, 2009)) are concerned with the role of risk in decision making. This article presents some preliminary results concerning the role of uncertainty in decision-making. We focus on Ellsberg’s two-color problem and consider a chance setup based on double sampling. We report empirical results which indicate that decisions from description where subjects select between a clear urn, the chance setup based on double sampling and Ellsberg’s vague urn, are such that subjects perceive the chance setup at least as an intermediate option between clear and vague choices (and there is evidence indicating that the double sampling chance setup is seen as operationally indistinguishable from the vague urn). We then suggest how the iterated chance setup can be used in order to study decisions from experience in the case of uncertainty. (shrink)

How should deontologists approach decision-making under uncertainty, for an iterated decision problem? In this paper I explore the shortcomings of a simple expected value approach, using a novel example to raise questions about attitudes to risk, the moral significance of tiny probabilities, the independent moral reasons against imposing risks, the morality of sunk costs, and the role of agent-relativity in iterated decision problems.

An important approach to game theory is to examine the consequences of beliefs that agents may have about each other. This paper investigates respect for public preferences. Consider an agent A who believes that B strictly prefers an option a to an option b. Then A respects B’s preference if A assigns probability 1 to the choice of a given that B chooses a or b. Respect for public preferences requires that if it is common belief that B prefers (...) a to b, then it is common belief that all other agents respect that preference. Along the lines of Blume, Brandenburger and Dekel [3] and Asheim [1], I treat respect for public preferences as a constraint on lexicographic probability systems. The main result is that given respect for public preferences and perfect recall, players choose in accordance with Iterated Backward Inference. Iterated Backward Inference is a procedure that generalizes standard backward induction reasoning for games of both perfect and imperfect information. From Asheim’s characterization of proper rationalizability [1] it follows that properly rationalizable strategies are consistent with respect for public preferences; hence strategies eliminated by Iterated Backward Inference are not properly rationalizable. (shrink)

Surveying and criticising attitudes towards the role and strength of the iterative conception of set—widely seen as the justificatory basis of Zermelo-Fraenkel set theory with Choice—this paper highlights a tension in both contemporary and historic accounts of the iterative conception’s justificatory role: on the one hand its advocates wish to claim that it justifies ZFC, but on the other hand they abstain from stating whether the preconditions for such justification exists. Expanding the number of axioms that the conception is (...) standardly charged with failing to justify, in the forms of the Emptyset and Powerset, this paper aims to extend the critique that the iterative conception does not justify ZFC to its subsystems. Exploring the historic and contemporary relationship between the iterative conception and set theory, the paper then attempts to defuse strategies that avoid the problems of intrinsic justification by weakening the iterative conception’s role to the ‘motivational’ or ‘heuristic’ by showing that what the iterative conception has been seen to motivate has changed over time. It is suggested that the conjunction of these arguments seriously weakens the programme of reasoning on an ‘atheoretic’ notion of set. (shrink)

This paper argues for several related theses. First, the epistemological position that knowledge requires safe belief can be motivated by views in the philosophy of science, according to which good explanations show that their explananda are robust. This motivation goes via the idea—recently defended on both conceptual and empirical grounds—that knowledge attributions play a crucial role in explaining successful action. Second, motivating the safety requirement in this way creates a choice point—depending on how we understand robustness, we'll end up (...) with different conceptions of safety in epistemology. Lastly, and most controversially, there's an attractive choice at this point that will not vindicate some of the most influential applications of the safety-theoretic framework in epistemology, e.g., Williamson's arguments against the KK principle, and luminosity. (shrink)

Paul Grice has given an account of conversational implicatures that hinges on the hypothesis that communication is a cooperative activity performed by rational agents which pursue a common goal. The attempt to derive Grice’s principles from game theory is a natural step, since its aim is to predict the behaviour of rational agents in situations where the outcome of one agent’s choice depends also on the choices of others. Generalised conversational implicatures, and in particular scalar ones, offer an ideal (...) test bed for this working hypothesis, since with this kind of implicatures the alternative choices available to the agents are less dependent on context, and they can be derived from the meanings of the sentences employed. Some rival game-theoretic accounts of the same phenomena will be criticised. The present paper shows that scalar implicatures can be explained using iterated admissibility, but that some of these need an additional assumption in order to be accounted for. (shrink)

In referendum elections, voters are often required to register simultaneous votes on multiple proposals. The separability problem occurs when a voter’s preferred outcome on one proposal depends on the outcomes of other proposals. This type of interdependence can lead to unsatisfactory or even paradoxical election outcomes, such as a winning outcome that is the last choice of every voter. Here we propose an iterative voting scheme that allows voters to revise their voting strategies based on the outcomes of previous (...) iterations. Using a robust computer simulation, we investigate the potential of this approach to solve the separability problem. (shrink)

An important approach to game theory is to examine the consequences of beliefs that rational agents may have about each other. This paper considers respect for public preferences. Consider an agent A who believes that B strictly prefers an option a to an option b. Then A respects B’s preference if A considers the choice of a “infinitely more likely” than the choice of B; equivalently, if A assigns probability 1 to the choice of a given that (...) B chooses a or b. Respect for public preferences requires that if it is common belief that B prefers a to b, then it is common belief that all other agents respect that preference. Along the lines of Blume, Brandenburger and Dekel [4] and Asheim [1], I treat respect for public preferences as a constraint on lexicographic probability systems. The main result is that if respect for public preferences and perfect recall obtains, then players choose in accordance with Iterated Backward Inference. Iterated Backward Inference is a procedure that generalizes standard backward induction reasoning for games of both perfect and imperfect information. From Asheim’s characterization of proper rationalizability [1] it follows that properly rationalizable strategies are consistent with respect for public preferences; hence strategies eliminated by Iterated Backward Inference are not properly rationalizable. (shrink)

The need to establish a definitive list of the works of Psellos, one of the most important and neglected Byzantine authors, has long been recognized, as have the difficulties facing this task. The works themselves number in the hundreds, are found in hundreds of manuscripts, and have not all been published. There is no standard system of Latin titles by which to refer to them (cf. Plutarch's Moralia). The editions themselves are sometimes inaccessible, and the secondary bibliography has been produced (...) in at least half a dozen languages. Between 1995 and 1998, and in ignorance of Moore's (M.) ongoing project, I prepared two bibliographies, one of the editions of Psellos' works and one of secondary literature, which I announced in my study of the Chronographia. I did not include publications pre-1800 and I did not actually produce a list of Psellos' works, only of their modern editions, listed under the editor's name and referring their contents to the corresponding text in the Teubner series (where available, otherwise giving the Greek title). This latter choice was a concession to the habit that prevails in our field of citing texts by the page number of the latest edition rather than by title and section or line number. This makes footnotes unhelpful (it is often unclear what kind of text is being cited), and makes them obsolete when new editions appear. Moreover, it reveals a certain lack of respect for the text as work of literature, implying that all “pages” are one undifferentiated mass of “information” that does not have a purpose, identity, or shape of its own. (shrink)

Consistency with the formal Church’s thesis, for short CT, and the axiom of choice, for short AC, was one of the requirements asked to be satisfied by the intensional level of a two-level foundation for constructive mathematics as proposed by Maietti and Sambin From sets and types to topology and analysis: practicable foundations for constructive mathematics, Oxford University Press, Oxford, 2005). Here we show that this is the case for the intensional level of the two-level Minimalist Foundation, for short (...) MF, completed in 2009 by the second author. The intensional level of MF consists of an intensional type theory à la Martin-Löf, called mTT. The consistency of mTT with CT and AC is obtained by showing the consistency with the formal Church’s thesis of a fragment of intensional Martin-Löf’s type theory, called \, where mTT can be easily interpreted. Then to show the consistency of \ with CT we interpret it within Feferman’s predicative theory of non-iterative fixpoints \ by extending the well known Kleene’s realizability semantics of intuitionistic arithmetics so that CT is trivially validated. More in detail the fragment \ we interpret consists of first order intensional Martin-Löf’s type theory with one universe and with explicit substitution rules in place of usual equality rules preserving type constructors -rule which is not valid in our realizability semantics). A key difficulty encountered in our interpretation was to use the right interpretation of lambda abstraction in the applicative structure of natural numbers in order to model all the equality rules of \ correctly. In particular the universe of \ is modelled by means of \-fixpoints following a technique due first to Aczel and used by Feferman and Beeson. (shrink)

We show that the Axiom of Dependent Choice,, holds in countably iterable, passive premice constructed over their reals which satisfy the Axiom of Determinacy,, in a background universe. This generalizes an argument of Kechris for using Steel's analysis of scales in mice. In particular, we show that for any and any countable set of reals A so that and, we have that.

Boersma’s (1997, 1998) Gradual Learning Algorithm (GLA) performs a sequence of slight re-rankings of the constraint set triggered by mistakes on the incoming stream of data. Data consist of underlying forms paired with the corresponding winner forms. At each iteration, the algorithm needs to complete the current data pair with a corresponding loser form. Tesar and Smolensky (Linguist Inq 29:229–268, 1998) suggest that this current loser should be set equal to the winner predicted by the current ranking. This paper develops (...) a new argument for Tesar and Smolensky’s proposal, based on the GLA’s factorizability. The underlying typology often encodes non-interacting phonological processes, so that it factorizes into smaller typologies that encode a single process each. The GLA should be able to take advantage of this factorizability, in the sense that a run of the algorithm on the original typology should factorize into independent runs on the factor typologies. Factorizability of the GLA is guaranteed provided the current loser is set equal to the current prediction, providing new support for Tesar and Smolensky’s proposal. (shrink)

I discuss the ubiquity of power law distributions in language organisation (and elsewhere), and argue against Miller’s (The mating mind: How sexual choice shaped the evolution of human nature, William Heinemann, London, 2000) argument that large vocabulary size is a consequence of sexual selection. Instead I argue that power law distributions are evidence that languages are best modelled as dynamical systems but raise some issues for models of iterated language learning.

Rational choice and other accounts of trust base it in objective assessments of the risks and benefits of trusting. But rational subjects must choose in the light of what knowledge they have, and that knowledge determines their capacities for trust. This is an epistemological issue, but not at the usual level of the philosophy of knowledge. Rather, it is an issue of pragmatic rationality for a given actor. It is commonly argued that trust is inherently embedded in iterated, (...) thick relationships. But such relationships are merely one source of relevant knowledge in a street-level epistemological account. Early experience may heavily influence later capacity for trust. For example, bad experience may lead to lower levels of trust and therefore fewer opportunities for mutual gain. (shrink)

§1. Iterated Gödelian extensions of theories. The idea of iterating ad infinitum the operation of extending a theory T by adding as a new axiom a Gödel sentence for T, or equivalently a formalization of “T is consistent”, thus obtaining an infinite sequence of theories, arose naturally when Godel's incompleteness theorem first appeared, and occurs today to many non-specialists when they ponder the theorem. In the logical literature this idea has been thoroughly explored through two main approaches. One is (...) that initiated by Turing in his “ordinal logics” and taken very much further in Feferman's work on transfinite progressions, which also introduced the more general study of extensions by reflection principles, of which consistency statements are a special case. This approach starts from an assignment of theories to ordinal notations, and extracts sequences of theories through a suitable choice of a path in the set of ordinal notations. The second approach, illustrated in particular by the work of Schmerl and Beklemishev, starts instead from a suitably well-behaved primitive recursive well-ordering, which is used to define a sequence of theories. This second approach has led to precise results about the relative proof-theoretical strength of sequences of theories obtained by iterating different reflection principles. The Turing-Feferman approach, on the other hand, lends itself well to an investigation in qualitative and philosophical terms of the relevance of such iterated reflection extensions to mathematical knowledge, in particular because of two developments associated with this approach. (shrink)

The axiom of dependent choice ( $\mathsf {DC}$ ) and the axiom of countable choice ( ${\mathsf {AC}}_\omega $ ) are two weak forms of the axiom of choice that can be stated for a specific set: $\mathsf {DC} ( X )$ asserts that any total binary relation on X has an infinite chain, while ${\mathsf {AC}}_\omega ( X )$ asserts that any countable collection of nonempty subsets of X has a choice function. It is well-known (...) that $\mathsf {DC} \Rightarrow {\mathsf {AC}}_\omega $. We study for which sets and under which hypotheses $\mathsf {DC} ( X ) \Rightarrow {\mathsf {AC}}_\omega ( X )$, and then we show it is consistent with $\mathsf {ZF}$ that there is a set $A \subseteq \mathbb {R}$ for which $\mathsf {DC} ( A )$ holds, but ${\mathsf {AC}}_\omega ( A )$ fails. (shrink)

The Braess Paradox (BP) is a counterintuitive finding that degrading a network that is susceptible to congestion may decrease the equilibrium travel cost for each of its users. We illustrate this paradox with two networks: a basic network with four alternative routes from a single origin to a single destination, and an augmented network with six alternative routes. We construct the equilibrium solutions to these two networks, which jointly give rise to the paradox, and subject them to experimental testing. Our (...) purpose is to test the generality of the BP when the network is enriched as well as the effects of the information provided to the network users when they conclude their travel. To this end, we compare experimentally two information conditions when each of the two networks is iterated in time. Under public monitoring each user is accurately informed of the route choices and payoffs of all the users, whereas under private monitoring she is only informed of her own payoff. Under both information conditions, over iterations of the basic and augmented games, aggregate route choices converge to equilibrium. (shrink)

We deal with the ranking problem of the nodes in a directed graph. The bilateral relationships specified by a directed graph may reflect the outcomes of a sport competition, the mutual reference structure between websites, or a group preference structure over alternatives. We introduce a class of scoring methods for directed graphs, indexed by a single nonnegative parameter α. This parameter reflects the internal slackening of a node within an underlying iterative process. The class of so-called internal slackening scoring methods, (...) denoted by λα, consists of the limits of these processes. It is seen that λ0 extends the invariant scoring method, while λ∞ extends the fair bets scoring method. Method λ1 corresponds with the existing λ-scoring method of Borm et al. (Ann Oper Res 109(1):61–75, 2002) and can be seen as a compromise between λ0 and λ∞. In particular, an explicit proportionality relation between λα and λ1 is derived. Moreover, the internal slackening scoring methods are applied to the setting of social choice situations where they give rise to a class of social choice correspondences that refine both the Top cycle correspondence and the Uncovered set correspondence. (shrink)

Most approaches to iterated belief revision are accompanied by some motivation for the use of the proposed revision operator (or family of operators), and typically encode enough information in the epistemic state of an agent for uniquely determining one-step revision. But in those approaches describing a family of operators there is usually little indication of how to proceed uniquely after the first revision step. In this paper we contribute towards addressing that deficiency by providing a formal framework which goes (...) beyond the first revision step in two ways. First, the framework is obtained by enriching the epistemic state of an agent starting from the following intuitive idea: we associate to each world x two abstract objects x⁺ and x⁻, and we assume that, in addition to preferences over the set of worlds, we are given preferences over this set of objects as well. The latter can be considered as meta-information encoded in the epistemic state which enables us to go beyond the first revision step of the revision operator being applied, and to obtain a unique set of preferences over worlds. We then extend this framework to consider, not only the revision of preferences over worlds, but also the revision of this extended structure itself. We look at some desirable properties for revising the structure and prove the consistency of these properties by giving a concrete operator satisfying all of them. Perhaps more importantly, we show that this framework has strong connections with two other types of constructions in related areas. Firstly, it can be seen as a special case of preference aggregation which opens up the possibility of extending the frame-work presented here into a full-fledged framework for preference aggregation and social choice theory. Secondly, it is related to existing work on the use of interval orderings in a number of different contexts. (shrink)

1. Philosophical background: iteration, ineffability, reflection. There are at least two heuristic motivations for the axioms of standard set theory, by which we mean, as usual, first-order Zermelo–Fraenkel set theory with the axiom of choice (ZFC): the iterative conception and limitation of size (see Boolos, 1989). Each strand provides a rather hospitable environment for the hypothesis that the set-theoretic universe is ineffable, which is our target in this paper, although the motivation is different in each case.

Achieving food system sustainability is one of the more pressing challenges of this century. Over the last decades, experts from diverse disciplines and intellectual traditions have worked to document the critical threats to food system sustainability and to define an appropriate agenda for action. Nevertheless, these efforts have tended to focus selectively on only a few components of the food system or have tended to be framed in particular discourses. Depending on the point of departure, what aspects of the food (...) system are considered threatened, and what must be sustained, can differ greatly between perspectives. In this article, we draw from systems-thinking and social-ecological systems concepts to focus on the underlying process-related attributes that could support a more sustainable food system. We then examine the support for specific system attributes in six different knowledge domains addressing sustainable agriculture and food. From this review, we identify five system attributes—diversity, modularity, transparency, innovation and congruence—that are repeatedly featured in the different knowledge domains as critical aspects of food system sustainability. We argue that in the face of considerable complexity and high uncertainty, these attributes can serve as a guide to conceptualizing food system choices adaptively and iteratively. (shrink)

Many of us believe (1) Saving a life is more important than averting any number of headaches. But what about risky cases? Surely: (2) In a single choice, if the risk of death is low enough, and the number of headaches at stake high enough, one should avert the headaches rather than avert the risk of death. And yet, if we will face enough iterations of cases like that in (2), in the long run some of those small risks (...) of serious harms will surely eventuate. And yet: (3) Isn't it still permissible for us to run these repeated risks, despite that knowledge? After all, if it were not, then many of the risky activities that we standardly think permissible would in fact be impermissible. Nobody has yet offered a principle that can accommodate all of 1-3. In this paper, I show that we can accommodate all of these judgements, by taking into account both ex ante and ex post perspectives. In doing so, I clear aside an important obstacle to a viable deontological decision theory. (shrink)

Relational agency is pivotal for understanding how language teachers seek and utilize relational resources in different contexts and grow to be agents of change amid various educational challenges. This study explored how three university teachers of Chinese as a second language enacted their relational agency to enhance their research capacity and sustain their professional development. Data on their personal network development was collected through concentric circle interviews, life-history interviews and written reflections over three months. Thematic analysis was adopted for iterative (...) coding and interpretation of the data. The findings revealed that teachers’ personal networks provided them with value guidance, emotional support and academic support, which exerted differential levels of impact on them to make agentic choices and actions. The study suggests that personal network analysis may serve as a suitable theoretical lens to achieve a multi-layered understanding of relational agency. The study also calls for more efforts to create learning opportunities and spaces in the relational context for teachers to build their career as agentic academics in language teacher education and development programs. (shrink)

(Penultimate Draft). I consider common ground in its evolutionary context and argue for several claims. First, common ground is widely (though not universally) distributed among social animals. Second, the use of common ground is favored (i.e. is predicted to emerge and subsequently persist) among populations of animals whose members face recurrent interdependent decision-making problems in which the benefit of their courses of action are contingent on the variable choices of their stable social partner(s). Third, humans deploy cognitive and social mechanisms (...) for establishing and updating common ground that are not deployed by other living animals—the use of common ground has not only persisted within the human lineage but been amplified as well. Finally, I suggest that some of these points count against the iterative construal of common ground. In its place, I propose an alternative psychological construal of common ground in terms of what I will call reciprocal responsiveness. (shrink)

As inductive decision-making procedures, the inferences made by machine learning programs are subject to underdetermination by evidence and bear inductive risk. One strategy for overcoming these challenges is guided by a presumption in philosophy of science that inductive inferences can and should be value-free. Applied to machine learning programs, the strategy assumes that the influence of values is restricted to data and decision outcomes, thereby omitting internal value-laden design choice points. In this paper, I apply arguments from feminist philosophy (...) of science to machine learning programs to make the case that the resources required to respond to these inductive challenges render critical aspects of their design constitutively value-laden. I demonstrate these points specifically in the case of recidivism algorithms, arguing that contemporary debates concerning fairness in criminal justice risk-assessment programs are best understood as iterations of traditional arguments from inductive risk and demarcation, and thereby establish the value-laden nature of automated decision-making programs. Finally, in light of these points, I address opportunities for relocating the value-free ideal in machine learning and the limitations that accompany them. (shrink)

Achieving food system sustainability is one of the more pressing challenges of this century. Over the last decades, experts from diverse disciplines and intellectual traditions have worked to document the critical threats to food system sustainability and to define an appropriate agenda for action. Nevertheless, these efforts have tended to focus selectively on only a few components of the food system or have tended to be framed in particular discourses. Depending on the point of departure, what aspects of the food (...) system are considered threatened, and what must be sustained, can differ greatly between perspectives. In this article, we draw from systems-thinking and social-ecological systems concepts to focus on the underlying process-related attributes that could support a more sustainable food system. We then examine the support for specific system attributes in six different knowledge domains addressing sustainable agriculture and food. From this review, we identify five system attributes—diversity, modularity, transparency, innovation and congruence—that are repeatedly featured in the different knowledge domains as critical aspects of food system sustainability. We argue that in the face of considerable complexity and high uncertainty, these attributes can serve as a guide to conceptualizing food system choices adaptively and iteratively. (shrink)

We examine George Boolos's proposed abstraction principle for extensions based on the limitation-of-size conception, New V, from several perspectives. Crispin Wright once suggested that New V could serve as part of a neo-logicist development of real analysis. We show that it fails both of the conservativeness criteria for abstraction principles that Wright proposes. Thus, we support Boolos against Wright. We also show that, when combined with the axioms for Boolos's iterative notion of set, New V yields a system equivalent to (...) full Zermelo-Fraenkel set theory with a principle of global choice. This advances Boolos's longstanding interest in the foundations of set theory. (shrink)

This article considers the objection to abortion that a woman who voluntarily engages in sexual activity is responsible for her fetus and so cannot have an abortion. The conclusion argued for is that the conceptions of responsibility that can ground the objection that are considered do not necessitate a requirement on the part of a pregnant woman to carry her pregnancy to term. Thus, the iterations of the responsibility objection presented cannot be used to curtail reproductive choice.

Many people in the developing world access essential health services either partially or primarily through programs run by international non-governmental organizations (INGOs). Given that such programs are typically designed and run by Westerners, and funded by Western countries and their citizens, it is not surprising that such programs are regarded by many as vehicles for Western cultural imperialism. In this chapter, I consider this phenomenon as it emerges in the context of development and humanitarian aid programs, particularly those delivering medical (...) treatment, nutrition and access to clean water. I argue that in order to avoid contributing to cultural imperialism, INGOs have a duty to ensure that they do not offer services in a way that requires their beneficiaries to choose between accessing essential health services and violating or otherwise undermining traditional norms and practices which have significance for their beneficiaries. Following Onora O'Neill, I argue that offers requiring such a choice are effectively “unrefuseable” and so coercive. INGOs therefore, must avoid making such offers, and can accomplish this by means of an iterated process of reciprocal negotiation under conditions of equality, in which both the INGOs’ and the beneficiaries’ deep values and concerns play a role. In essence, I claim that employing such a process is a requirement of procedural justice, given the non-ideal conditions in which INGOs must operate. (shrink)

For the modern set theorist the empty set Ø, the singleton {a}, and the ordered pair 〈x, y〉 are at the beginning of the systematic, axiomatic development of set theory, both as a field of mathematics and as a unifying framework for ongoing mathematics. These notions are the simplest building locks in the abstract, generative conception of sets advanced by the initial axiomatization of Ernst Zermelo [1908a] and are quickly assimilated long before the complexities of Power Set, Replacement, and (...) class='Hi'>Choice are broached in the formal elaboration of the ‘set of’f {} operation. So it is surprising that, while these notions are unproblematic today, they were once sources of considerable concern and confusion among leading pioneers of mathematical logic like Frege, Russell, Dedekind, and Peano. In the development of modern mathematical logic out of the turbulence of 19th century logic, the emergence of the empty set, the singleton, and the ordered pair as clear and elementary set-theoretic concepts serves as amotif that reflects and illuminates larger and more significant developments in mathematical logic: the shift from the intensional to the extensional viewpoint, the development of type distinctions, the logical vs. the iterative conception of set, and the emergence of various concepts and principles as distinctively set-theoretic rather than purely logical. Here there is a loose analogy with Tarski's recursive definition of truth for formal languages: The mathematical interest lies mainly in the procedure of recursion and the attendant formal semantics in model theory, whereas the philosophical interest lies mainly in the basis of the recursion, truth and meaning at the level of basic predication. Circling back to the beginning, we shall see how central the empty set, the singleton, and the ordered pair were, after all. (shrink)

Talents often play a significant role in our personal and social lives. For example, our talents may shape the choices we make and the goods that we value, making them central to the creation of a meaningful life. Differences in the level of talents also affect how social institutions are structured, and how social goods and resources are distributed. Despite their normative importance, it is surprising that talents have not yet received substantial philosophical analysis in their own right. As a (...) result, the current literature is rife with conceptual ambiguity: a talent is referred to as all of a skill, potential, ability, capacity, endowment, and a natural gift. In response to this confusion, in this paper I develop an account of what a talent is, based on the debate concerning the metaphysics of ability and dispositions. I argue for a position that I call ‘talent dispositionalism’: S has a talent for skill A in circumstances C iff S has the general disposition to excellently develop and maintain A when, in circumstances C, she tries to excellently develop and maintain A. On this account, a talent is not the skill itself, but a general iterated ability for the excellent development and up-keep of a particular skill, constituted by an agent’s dispositional properties. I defend the account against four objections usually levelled against traditional dispositionalist theories of ability, and highlight some ways the account may influence debates in other areas of philosophical inquiry. (shrink)

In many real-world gambles, a non-trivial amount of time passes before the uncertainty is resolved but after a choice is made. An individual may have a preference between gambles with identical probability distributions over final outcomes if they differ in the timing of resolution of uncertainty. In this domain, utility consists not only of the consumption of outcomes, but also the psychological utility induced by an unresolved gamble. We term this utility anxiety. Since a reflective decision maker may want (...) to include anxiety explicitly in analysis of unresolved lotteries, a multiple-outcome model for evaluating lotteries with delayed resolution of uncertainty is developed. The result is a rank-dependent utility representation (e.g., Quiggin, 1982), in which period weighting functions are related iteratively. Substitution rules are proposed for evaluating compound temporal lotteries. The representation is appealing for a number of reasons. First, probability weights can be interpreted as the cognitive attention allocated to certain outcomes. Second, the model disaggregates strength of preference from temporal risk aversion and thus provides some insight into the old debate about the relationship between von Neumann–Morgenstern utility functions and strength of preference value functions. (shrink)

This paper develops a version of the self-refutation argument against relativism in the teeth of the prevailing response by relativists: that this argument begs the question against them. It is maintained that although weaker varieties of relativism are not self-refuting, strong varieties are faced by this argument with a choice between making themselves absolute (one thing is absolutely true - relativism); or reflexive (relativism is 'true for' the relativist). These positions are in direct conflict. The commonest response, Reflexive Relativism, (...) is shown to be vulnerable to an iterated version of the self-refutation argument. As a result, Reflexive Relativism possesses only the appearance of content, being either incoherent, or a regressively disguised version of Absolute Relativism. Concluding remarks on Absolute Relativism acknowledge this to be a bare, formal possibility, but claim that in fact it must represent one of a range of weaker varieties of relativism that alone remain tenable. (shrink)