The Nash axiom is a basic property of consistency in choice. This paper proposes weaker versions of the axiom and examines their logical implications. In particular, we demonstrate that weak Nash axioms are useful to understand the relationship between the Nash axiom and the path independence axiom. We provide an application of weak Nash axioms to the no-envy approach. We present a possibility result and an impossibility result.

In set theory without the Axiom of Choice, we consider Ingleton’s axiom which is the ultrametric counterpart of the Hahn–Banach axiom. We show that in ZFA, i.e., in the set theory without the Axiom of Choice weakened to allow “atoms,” Ingleton’s axiom does not imply the Axiom of Choice. We also prove that in ZFA, the “multiple choice” axiom implies the Krein–Milman axiom. We deduce that, in ZFA, the (...) conjunction of the Hahn–Banach, Ingleton and Krein–Milman axioms does not imply the Axiom of Choice. (shrink)

That choice principles ‘change the logic’ when added to constructive systems is significant for contemporary metaphysics. However, many are surprised by these results, having learned that the Axiom of Choice (AC) is constructively valid. Indeed, even among specialists there were, until recently, reasons for puzzlement-rival versions of Intuitionistic Type Theory, one where (AC) is valid, another where it implies classical logic. This paper accessibly explains the situation, puts the issues in a broader setting by considering other (...) class='Hi'>choice principles, and draws philosophical morals for the understanding of quantification, choice principles, and the prospects for constructivism. (shrink)

We consider choice correspondences that assign a subset to every choice set of alternatives, where the total set of alternatives is an arbitrary finite or infinite set. We focus on the relations between several extensions of the condition of independence of irrelevant alternatives on one hand, and conditions on the revealed preference relation on sets, notably the weak axiom of revealed preference, on the other hand. We also establish the connection between the condition of independence of irrelevant (...) alternatives and so-called strong sets; the latter characterize a social choice correspondence satisfying independence of irrelevant alternatives. (shrink)

Mathematical investigation, when done well, can confer understanding. This bare observation shouldn’t be controversial; where obstacles appear is rather in the effort to engage this observation with epistemology. The complexity of the issue of course precludes addressing it tout court in one paper, and I’ll just be laying some early foundations here. To this end I’ll narrow the field in two ways. First, I’ll address a specific account of explanation and understanding that applies naturally to mathematical reasoning: the view proposed (...) by Philip Kitcher and Michael Friedman of explanation or understanding as involving the unification of theories that had antecedently appeared heterogeneous. For the second narrowing, I’ll take up one specific feature (among many) of theories and their basic concepts that is sometimes taken to make the theories and concepts preferred: in some fields, for some problems, what is counted as understanding a problem may involve finding a way to represent the problem so that it (or some aspect of it) can be visualized. The final section develops a case study which exemplifies the way that this consideration – the potential for visualizability – can rationally inform decisions as to what the proper framework and axioms should be. The discussion of unification (in sections 3 and 4) leads to a mathematical analogue of Goodman’s problem of identifying a principled basis for distinguishing grue and green. Just as there is a philosophical issue about how we arrive at the predicates we should use when making empirical predictions, so too there is an issue about what properties best support many kinds of mathematical reasoning that are especially valuable to us. The issue becomes pressing via an examination of some physical and mathematical cases that make it seem unlikely that treatments of unification can be as straightforward as the philosophical literature has hoped. Though unification accounts have a grain of truth (since a phenomenon (or cluster of phenomena) called “unification” is in fact important in many cases) we are far from an analysis of what “unification” is.. (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)

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to $\mathsf {DC}$ -preserving symmetric submodels of forcing extensions. Hence, $\mathsf {ZF}+\mathsf {DC}$ not only provides the right framework for developing classical analysis, but is also the right base theory over which to safeguard truth in analysis from the independence phenomenon in the (...) presence of large cardinals. We also investigate some basic consequences of the Proper Forcing Axiom in $\mathsf {ZF}$, and formulate a natural question about the generic absoluteness of the Proper Forcing Axiom in $\mathsf {ZF}+\mathsf {DC}$ and $\mathsf {ZFC}$. Our results confirm $\mathsf {ZF} + \mathsf {DC}$ as a natural foundation for a significant portion of “classical mathematics” and provide support to the idea of this theory being also a natural foundation for a large part of set theory. (shrink)

In this paper we discuss a particular example of the passage from the informal, but rigorous description of a concept to the axiomatic formulation of principles holding for the concept; in particular, we look at the principles of continuity and lawlike choice in the theory of lawless sequences. Our discussion also leads to a better understanding of the rôle of the so-called density axiom for lawless sequences.

This article provides a systematic analysis of social choice theory without the Pareto principle, by revisiting the method of Murakami Yasusuke. This article consists of two parts. The first part investigates the relationship between rationality of social preference and the axioms that make a collective choice rule either Paretian or anti-Paretian. In the second part, the results in the first part are applied to obtain impossibility results under various rationality requirements of social preference, such as S-consistency, quasi-transitivity, semi-transitivity, (...) the interval-order property, and acyclicity. (shrink)

We study whether it is possible to generalise Seidenfeld et al.’s representation result for coherent choice functions in terms of sets of probability/utility pairs when we let go of Archimedeanity. We show that the convexity property is necessary but not sufficient for a choice function to be an infimum of a class of lexicographic ones. For the special case of two-dimensional option spaces, we determine the necessary and sufficient conditions by weakening the Archimedean axiom.

It has long been known that in the context of axiomatic second-order logic (SOL), Hume’s Principle (HP) is mutually interpretable with “the universe is Dedekind infinite” (DI). In this paper, we offer a more fine-grained analysis of the logical strength of HP, measured by deductive implications rather than interpretability. Our main result is that HP is not deductively conservative over SOL + DI. That is, SOL + HP proves additional theorems in the language of pure second-order logic that are not (...) provable from SOL + DI alone. Arguably, then, HP is not just a pure axiom of infinity, but rather it carries additional logical content. On the other hand, we show that HP is \(\Pi ^1_1\) conservative over SOL + DI, and that HP is conservative over SOL + DI + “the universe is well ordered” (WO). Next, we show that SOL + HP does not prove any of the simplest and most natural versions of the axiom of choice, including WO and weaker principles. Lastly, we discuss other axioms of infinity. We show that HP does not prove the Splitting or Pairing principles (axioms of infinity stronger than DI). (shrink)

I propose a revision of Cantor’s account of set size that understands comparisons of set size fundamentally in terms of surjections rather than injections. This revised account is equivalent to Cantor's account if the Axiom of Choice is true, but its consequences differ from those of Cantor’s if the Axiom of Choice is false. I argue that the revised account is an intuitive generalization of Cantor’s account, blocks paradoxes—most notably, that a set can be partitioned into (...) a set that is bigger than it—that can arise from Cantor’s account if the Axiom of Choice is false, illuminates the debate over whether the Axiom of Choice is true, is a mathematically fruitful alternative to Cantor’s account, and sheds philosophical light on one of the oldest unsolved problems in set theory. (shrink)

It has long been known that in the context of axiomatic second-order logic (SOL), Hume’s Principle (HP) is mutually interpretable with “the universe is Dedekind infinite” (DI). In this paper, we offer a more fine-grained analysis of the logical strength of HP, measured by deductive implications rather than interpretability. Our main result is that HP is not deductively conservative over SOL + DI. That is, SOL + HP proves additional theorems in the language of pure second-order logic that are not (...) provable from SOL + DI alone. Arguably, then, HP is not just a pure axiom of infinity, but rather it carries additional logical content. On the other hand, we show that HP is $$\Pi ^1_1$$ conservative over SOL + DI, and that HP is conservative over SOL + DI + “the universe is well ordered” (WO). Next, we show that SOL + HP does not prove any of the simplest and most natural versions of the axiom of choice, including WO and weaker principles. Lastly, we discuss other axioms of infinity. We show that HP does not prove the Splitting or Pairing principles (axioms of infinity stronger than DI). (shrink)

to constructive systems is significant for contemporary metaphysics. However, many are surprised by these results, having learned that the Axiom of Choice (AC) is constructively valid. Indeed, even among specialists there were, until recently, reasons for puzzlement-rival versions of Intuitionistic Type Theory, one where (AC) is valid, another where it implies classical logic. This paper accessibly explains the situation, puts the issues in a broader setting by considering other choice principles, and draws philosophical morals for the understanding (...) of quantification, choice principles, and the prospects for constructivism. (shrink)

From the viewpoint of the independence axiom of expected utility theory, an interesting empirical dynamic choice problem involves the presence of a “global risk,” that is, a chance of losing everything whichever safe or risky option is chosen. In this experimental study, participants have to allocate real money between a safe and a risky project. Treatment variable is the particular decision stage at which a global risk is resolved: (i) before the investment decision; (ii) after the investment decision, (...) but before the resolution of the decision risk; (iii) after the resolution of the decision risk. The baseline treatment is without global risk. Our goal is to investigate the isolation effect and the principle of timing independence under the different timing options of the global risk. In addition, we examine the role played by anticipated and experienced emotions in the choice problem. Main findings are a violation of the isolation effect, and support for the principle of timing independence. Although behavior across the different global risk cases shows similarities, we observe clear differences in people’s affective responses. This may be responsible for the conflicting results observed in earlier experiments. Dependent on the timing of the global risk different combinations of anticipated and experienced emotions influence decision making. (shrink)

We introduce a new formulation of the axiom of dependent choice, which can be viewed as an abstract termination principle that in particular generalises recursive path orderings, the latter being fundamental tools used to establish termination of rewrite systems. We consider several variants of our termination principle, and relate them to general termination theorems in the literature.

Models of choice over menus aim at capturing the effect of some behavioral or non-standard element of decision-making on the behavior of a single decision-maker. These models are usually compared with the standard model of choice over menus, in which the decision-maker chooses a menu whose best item is better than that of all other available ones. However, in many empirical settings such as experimental studies, choice data come from a population of decision-makers with possibly heterogeneous attitudes (...) and tastes. This heterogeneity can make the observed choices over menus stochastic. This fact calls for a stochastic characterization of models of choice over menus to be able to better compare and contrast different models empirically. In this paper, I do this task for the standard model, which would be an extension of the random utility model to the realm of choice over menus. In particular, I provide the necessary and sufficient conditions, i.e., axioms on choice data over menus for it to be consistent with a population of decision-makers each of whom behaves according to the standard model. The axioms that characterize the model are the axiom of revealed stochastic preferences over singletons and three rationality axioms. (shrink)

Should weak forms of the axiom of choice really be accepted within constructive mathematics? A critical view of the Brouwer-Heyting-Kolmogorov interpretation, accompanied by the intention to include nondeterministic algorithms, leads us to subscribe to Richman's appeal for dropping countable choice. As an alternative interpretation of intuitionistic logic, we propose to renew dialogue semantics.

The focus of this study is cognitive choice: the selection of one cognitive option (a hypothesis, a theory, or an axiom, for instance) rather than another. The study proposes that cognitive choice should be based on the plausibilities of states posited by rival cognitive options and the utilities of these options' information outcomes. The proposal introduces a form of decision theory that is novel because comparative; it permits many choices among cognitive options to be based on merely (...) comparative plausibilities and utilities. This form of decision theory intersects with recommendations by advocates of decision theory for cognitive choice, on the one hand, and defenders of comparative evaluation of scientific hypotheses and theories, on the other. But it differs from prior decision-theoretic proposals because it requires no more than minimal precision in specifying plausibilities and utilities. And it differs from comparative proposals because none has shown how comparative evaluations can be carried out within a decision-theoretic framework. (shrink)

Extensive measurement is the standard measurement-theoretic approach for constructing a ratio scale. It involves the comparison of objects that can be concatenated in an additively representable way. This paper studies the implications of extensively measurable welfare for social choice theory. We do this in two frameworks: an Arrovian framework with a fixed population and no interpersonal comparisons, and a generalized framework with variable populations and full interpersonal comparability. In each framework we use extensive measurement to introduce novel domain restrictions, (...) independence conditions, and constraints on social evaluation. We prove a welfarism theorem for these domains and characterize the social welfare functions that satisfy the axioms of extensive measurement at both the individual and social levels. The main results are simple axiomatizations of strong dictatorship in the Arrovian framework and classical utilitarianism in the generalized framework. (shrink)

In Zermelo-Fraenkel set theory without the Axiom of Foundation we study the schema version of the principle of dependent choices in connection with Aczel's antifoundation axiom , Boffa's anti-foundation axiom, and axiom of collection.

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form (...) a Boolean algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

We work in set theory without the Axiom of Choice ZF. We prove that the Principle of Dependent Choices (DC) implies that the closed unit ball of a uniformly convex Banach space is weakly compact and, in particular, that the closed unit ball of a Hilbert space is weakly compact. These statements are not provable in ZF and the latter statement does not imply DC. Furthermore, DC does not imply that the closed unit ball of a reflexive space (...) is weakly compact. (shrink)

We discuss several features of coherent choice functions—where the admissible options in a decision problem are exactly those that maximize expected utility for some probability/utility pair in fixed set S of probability/utility pairs. In this paper we consider, primarily, normal form decision problems under uncertainty—where only the probability component of S is indeterminate and utility for two privileged outcomes is determinate. Coherent choice distinguishes between each pair of sets of probabilities regardless the “shape” or “connectedness” of the sets (...) of probabilities. We axiomatize the theory of choice functions and show these axioms are necessary for coherence. The axioms are sufficient for coherence using a set of probability/almost-state-independent utility pairs. We give sufficient conditions when a choice function satisfying our axioms is represented by a set of probability/state-independent utility pairs with a common utility. (shrink)

It is commonplace to suppose that the theory of individual rational choice is considerably less problematic than the theory of collective rational choice. In particular, it is often assumed by philosophers, economists, and other social scientists that an individual's choices among outcomes accurately reflect that individual's underlying preferences or values. Further, it is now well known that if an individual's choices among outcomes satisfy certain plausible axioms of rationality or consistency, that individual's choice-behavior can be interpreted as (...) maximizing expected utility on a utility scale that is unique up to a linear transformation. Hence, there is, in principle, an empirically respectable method of measuring individuals' values and a single unified schema for explaining their actions as value maximizing. (shrink)

It is shown in Zermelo-Fraenkel Set Theory that Cκ, the Axiom of Choice for κ-indexed families of arbitrary sets, is equivalent to the condition that the frame envelope of any κ-frame is κ-Lindelöf, for any cardinal κ.

On analyzing the problem that arises whenever the set of maximal elements is large, and a selection is then required (see Peris & Subiza 1998), we realize that logical ways of selecting among maximals violate the classical notion and axioms of rationality. We arrive at the same conclusion if we analyze solutions to the problem of choosing from a tournament (where maximal elements do not necessarily exist). So, in our opinion the notion of rationality must be discussed, not only in (...) the traditional sense of external conditions (Sen 1993), but in terms of the internal information provided by the binary relation. (shrink)

Recently, Coquand and Palmgren considered systems of intuitionistic arithmetic in a finite types together with various forms of the axiom of choice and a numerical omniscience schema which implies classical logic for arithmetical formulas. Feferman subsequently observed that the proof theoretic strength of such systems can be determined by functional interpretation based on a non-constructive μ-operator and his well-known results on the strength of this operator from the 70's. In this note we consider a weaker form LNOS of (...) NOS which suffices to derive the strong form of binary König's lemma studied by Coquand/Palmgren and gives rise to a new and mathematically strong semi-classical system which, nevertheless, can proof theoretically be reduced to primitive recursive arithmetic PRA. The proof of this fact relies on functional interpretation and a majorization technique developed in a previous paper. (shrink)

Within the social sciences, much controversy exists about which status should be ascribed to the rationality assumption that forms the core of rational choice theories. Whilst realists argue that the rationality assumption is an empirical claim which describes real processes that cause individual action, instrumentalists maintain that it amounts to nothing more than an analytically set axiom or ‘as if’ hypothesis which helps in the generation of accurate predictions. In this paper, I argue that this realist-instrumentalist debate about (...) rational choice theory can be overcome once it is realised that the rationality assumption is neither an empirical description nor an ‘as if’ hypothesis, but a normative claim. (shrink)

In many voting systems, voters’ preferences on a set of candidates are represented by linear orderings. In this context, scoring rules are well-known procedures to aggregate the preferences of the voters. Under these rules, each candidate obtains a fixed number of points, sk\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s_k$$\end{document}, each time he/she is ranked k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}th by one voter and the candidates are ordered according to the total number of (...) points they receive. In order to identify the best scoring rule to use in each situation, we need to know which properties are met by each of these procedures. Although some properties have been analyzed extensively, there are other properties that have not been studied for all scoring rules. In this paper, we consider two desirable social choice properties, the Pareto-optimality and the immunity to the absolute loser paradox, and establish characterizations of the scoring rules that satisfy each of these specific axioms. Moreover, we also provide a proof of a result given by Saari and Barney, where the scoring rules meeting reversal symmetry are characterized. From the results of characterization, we establish some relationships among these properties. Finally, we give a characterization of the scoring rules satisfying the three properties. (shrink)

This paper criticizes non-constructive uses of set theory in formal economics. The main focus is on results on preference aggregation and Arrow’s theorem for infinite electorates, but the present analysis would apply as well, e.g., to analogous results in intergenerational social choice. To separate justified and unjustified uses of infinite populations in social choice, I suggest a principle which may be called the Hildenbrand criterion and argue that results based on unrestricted axiom of choice do not (...) meet this criterion. The technically novel part of this paper is a proposal to use a set-theoretic principle known as the axiom of determinacy ), not as a replacement for Choice, but simply to eliminate applications of set theory violating the Hildenbrand criterion. A particularly appealing aspect of \ from the point of view of the research area in question is its game-theoretic character. (shrink)

A new property of collective choice rules that we refer to as superset robustness is introduced, and we employ it in several characterization results. The axiom requires that if all individual preference orderings expand weakly (in the sense of set inclusion), then the corresponding social preference relation must also expand weakly. In other words, if a given profile is changed by adding instances of weak preference to some individual relations, then the social weak preference relation for the expanded (...) profile must contain the social weak preference relation for the original—that is, the social relation cannot contract in response to the addition of pairs to the individual relations. We begin by examining social welfare functions (that is, collective choice rules such that the resulting social preferences are orderings) and then move on to rules that generate transitive (but not necessarily complete) social rankings. The remaining results of the paper focus on Suzumura-consistent collective choice rules. In all of these cases, it turns out that the property of superset robustness is closely related to classes of agreement-based collective choice rules. These are rules such that the social relation is determined by collecting the pairs on whose relative rankings the members of the decisive sets agree. (shrink)

The notions of linear and metric independence are investigated in relation to the property: if U is a set of n+1 independent vectors, and X is a set of n independent vectors, then adjoining some vector in U to X results in a set of n+1 independent vectors. It is shown that this property holds in any normed linear space. A related property – that finite-dimensional subspaces are proximinal – is established for strictly convex normed spaces over the real or (...) complex numbers. It follows that metric independence and linear independence are equivalent in such spaces. Proofs are carried out in the context of intuitionistic logic without the axiom of countable choice. (shrink)

In Arrovian social choice theory assuming the independence of irrelevant alternatives, Murakami (1968) proved two theorems about complete and transitive collective choice rules that satisfy strict non-imposition (citizens’ sovereignty), one being a dichotomy theorem about Paretian or anti-Paretian rules and the other a dictator-or-inverse-dictator impossibility theorem without the Pareto principle. It has been claimed in the later literature that a theorem of Malawski and Zhou (1994) is a generalization of Murakami’s dichotomy theorem and that Wilson’s (1972) impossibility theorem (...) is stronger than Murakami’s impossibility theorem, both by virtue of replacing Murakami’s assumption of strict non-imposition with the assumptions of non-imposition and non-nullness. In this note, we first point out that these claims are incorrect: non-imposition and non-nullness are together equivalent to strict non-imposition for all transitive collective choice rules. We then generalize Murakami’s dichotomy and impossibility theorems to the setting of incomplete social preference. We prove that if one drops completeness from Murakami’s assumptions, his remaining assumptions imply (i) that a collective choice rule is either Paretian, anti-Paretian, or dis-Paretian (unanimous individual preference implies noncomparability) and (ii) that adding proposed constraints on noncomparability, such as the regularity axiom of Eliaz and Ok (2006), restores Murakami’s dictator-or-inverse-dictator result. (shrink)

Zermelo’s Theorem that the axiom of choice is equivalent to the principle that every set can be well-ordered goes through in third-order logic, but in second-order logic we run into expressivity issues. In this note, we show that in a natural extension of second-order logic weaker than third-order logic, choice still implies the well-ordering principle. Moreover, this extended second-order logic with choice is conservative over ordinary second-order logic with the well-ordering principle. We also discuss a variant (...) choice principle, due to Hilbert and Ackermann, which neither implies nor is implied by the well-ordering principle. (shrink)

Applying the solutions defined in the axiomatic bargaining theory to actual bargaining problems is a challenge when the problem is not described by its Utility Possibility Set (UPS) but as a social choice environment specifying the set of alternatives and utility profile underlying the UPS. It requires computing the UPS, which is an operational challenge, and then identifying at least one alternative that actually achieves the bargained solution’s outcome. We introduce the axioms of Independence of Non-Strongly-Efficient Alternatives (resp. Weakly) (...) and Independence of Redundant Alternatives. A solution satisfying these axioms can be applied to a simplified problem based on any reduced set of alternatives generating the strong (resp. weak) Pareto frontier of the initial problem, without changing the outcome, making the application of bargaining solutions to actual problems easier. We compare our axioms to usual independence axioms, and discuss their consistency with usual bargaining solutions. Then, we introduce monotonicity conditions corresponding to the existence of an interest group, i.e., agents ranking the alternatives in the same order. For such monotonic social choice environments, we provide a parameterized family of alternatives that generates the Pareto frontier of the bargaining problem, in line with our previous results. Our analysis illustrates that an axiomatic approach can be useful to foster the application of bargaining solutions, in complement to usual computational methods. (shrink)

In [17], we introduced an extensional variant of generic realizability [22], where realizers act extensionally on realizers, and showed that this form of realizability provides inner models of $\mathsf {CZF}$ (constructive Zermelo–Fraenkel set theory) and $\mathsf {IZF}$ (intuitionistic Zermelo–Fraenkel set theory), that further validate $\mathsf {AC}_{\mathsf {FT}}$ (the axiom of choice in all finite types). In this paper, we show that extensional generic realizability validates several choice principles for dependent types, all exceeding $\mathsf {AC}_{\mathsf {FT}}$. We then (...) show that adding such choice principles does not change the arithmetic part of either $\mathsf {CZF}$ or $\mathsf {IZF}$. (shrink)

From the viewpoint of the independence axiom of expected utility theory, an interesting empirical dynamic choice problem involves the presence of a “global risk,” that is, a chance of losing everything whichever safe or risky option is chosen. In this experimental study, participants have to allocate real money between a safe and a risky project. Treatment variable is the particular decision stage at which a global risk is resolved: (i) before the investment decision; (ii) after the investment decision, (...) but before the resolution of the decision risk; (iii) after the resolution of the decision risk. The baseline treatment is without global risk. Our goal is to investigate the isolation effect and the principle of timing independence under the different timing options of the global risk. In addition, we examine the role played by anticipated and experienced emotions in the choice problem. Main findings are a violation of the isolation effect, and support for the principle of timing independence. Although behavior across the different global risk cases shows similarities, we observe clear differences in people’s affective responses. This may be responsible for the conflicting results observed in earlier experiments. Dependent on the timing of the global risk different combinations of anticipated and experienced emotions influence decision making. (shrink)

A version of the Erdös-Rado theorem on partitions of the unordered n-tuples from uncountable sets is proved, without using the axiom of choice. The case with exponent 1 is just the Sierpinski-Hartogs' result that $\aleph (\alpha)\leq 2^{2^{2^{\alpha}}}$.

An agent whose preferences violate the Independence Axiom or for some other reason are not representable by an expected utility function, can avoid 'dynamic inconsistency' either by foresight ('sophisticated choice') or by subsequent adjustment of preferences to the chosen plan of action ('resolute choice'). Contrary to McClennen and Machina, among others, it is argued these two seemingly conflicting approaches to 'dynamic rationality' need not be incompatible. 'Wise choice' reconciles foresight with a possibility of preference adjustment by (...) rejecting the two assumptions that create the conflict: Separability of Preferences in the case of sophisticated choice and Reduction to Normal form in the case of resolute choice.. (shrink)

We prove James's sequential characterization of reflexivity in set-theory ZF + DC, where DC is the axiom of Dependent Choices. In turn, James's criterion implies that every infinite set is Dedekind-infinite, whence it is not provable in ZF. Our proof in ZF + DC of James' criterion leads us to various notions of reflexivity which are equivalent in ZFC but are not equivalent in ZF. We also show that the weak compactness of the closed unit ball of a reflexive (...) space does not imply the Boolean Prime Ideal theorem : this solves a question raised in [6]. (shrink)

We define a parametrised choice principle PCP which is equivalent to the Axiom of Determinacy. PCP describes the difference between these two axioms and could serve as a means of proving Martin's conjecture on the equivalence of these axioms.

Under the axiom of choice, every first countable space is a Fréchet-Urysohn space. Although, in its absence even ℝ may fail to be a sequential space.Our goal in this paper is to discuss under which set-theoretic conditions some topological classes, such as the first countable spaces, the metric spaces, or the subspaces of ℝ, are classes of Fréchet-Urysohn or sequential spaces.In this context, it is seen that there are metric spaces which are not sequential spaces. This fact raises (...) the question of knowing if the completion of a metric space exists and it is unique. The answer depends on the definition of completion.Among other results it is shown that: every first countable space is a sequential space if and only if the axiom of countable choice holds, the sequential closure is idempotent in ℝ if and only if the axiom of countable choice holds for families of subsets of ℝ, and every metric space has a unique equation image-completion. (shrink)

One central objection to the maximin payoff criterion is that it focuses on the state that yields the lowest payoffs regardless of how low these are. We allow different states to have different sets of possible outcomes and show that the original axioms of Milnor (1954) continue to characterize the maximin payoff criterion, provided that the sets of payoffs achievable across states overlap. If instead payoffs in some states are always lower than in all others then ignoring the “bad” states (...) is no longer inconsistent with these axioms. Similar dependence on overlap of outcome spaces across states holds for the minimax regret and maximin joy criteria. (shrink)

This note explores the common core of constructive, intuitionistic, recursive and classical analysis from an axiomatic standpoint. In addition to clarifying the relation between Kleene’s and Troelstra’s minimal formal theories of numbers and number-theoretic sequences, we propose some modified choice principles and other function existence axioms which may be of use in reverse constructive analysis. Specifically, we consider the function comprehension principles assumed by the two minimal theories EL and M, introduce an axiom schema CFd asserting that every (...) decidable property of numbers has a characteristic function, and use it to describe a precise relationship between the minimal theories. We show that the axiom schema AC00 of countable choice can be decomposed into a monotone choice schema AC00m (which guarantees that every Cauchy sequence has a modulus) and a bounded choice schema BC00. We relate various (classically correct) axiom schemas of continuous choice to versions of the bar and fan theorems, suggest a constructive choice schema AC1/2,0 (which incidentally guarantees that every continuous function has a modulus of continuity), and observe a constructive equivalence between restricted versions of the fan theorem and correspondingly restricted bounding axioms \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${AB_{1/2,0}^{2^{\mathbb{n}}}}$$\end{document}. We also introduce a version WKL!! of Weak König’s Lemma with uniqueness which is intermediate in strength between WKL and the decidable fan theorem FTd. (shrink)

It is a long standing open problem whether or not the Axiom of Countable Choice implies the fragment of Martin's Axiom either in or in. In this direction, we provide a partial answer by establishing that the Boolean Prime Ideal Theorem in conjunction with the Countable Union Theorem does not imply restricted to complete Boolean algebras in. Furthermore, we prove that the latter (formally) weaker form of and the Δ‐system Lemma are independent of each other in.We also (...) answer open questions from Tachtsis [16] which concern the status of restricted to complete Boolean algebras in certain Fraenkel–Mostowski permutation models of and we strengthen some results from the above paper. (shrink)

We shall investigate certain set-theoretic pigeonhole principles which arise as generalizations of the usual pigeonhole principle; and we shall show that many of them are equivalent to full AC. We discuss also several restricted cases and variations of those principles and relate them to restricted choice principles. In this sense the pigeonhole principle is a rich source of weak choice principles. It is shown that certain sequences of restricted pigeonhole principles form implicational hierarchies with respect to ZF. We (...) state also several open problems in order to indicate the extent to which the whole subject of pigeonhole principles requires further exploration. (shrink)

Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in (...) the foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

This article illustrates how axiomatic social choice theory can be used in the evaluation of measures of group fitness for a biological hierarchy, thereby contributing to the dialogue between the philosophy of biology and social choice theory. It provides an axiomatic characterization of the ordering underlying the MichodSolariNedelcu index of group fitness for a multicellular organism. The MVSHN index has been used to analyse the germ-soma specialization and the fitness decoupling between the cell and organism levels that takes (...) place during the evolutionary transition to multicellularity. It is argued that some of the axioms satisfied by the MVSHN group fitness ordering are not appropriate for all stages in this transition. (shrink)

We introduce two novel frameworks for choice under complete uncertainty. These frameworks employ intervals to represent uncertain utility attaching to outcomes. In the first framework, utility intervals arising from one act with multiple possible outcomes are aggregated via a set-based approach. In the second framework the aggregation of utility intervals employs multi-sets. On the aggregated utility intervals, we then introduce min–max decision rules and lexicographic refinements thereof. The main technical results are axiomatic characterizations of these min–max decision rules and (...) these refinements. We also briefly touch on the independence of introduced axioms. Furthermore, we show that such characterizations give rise to novel axiomatic characterizations of the well-known min–max decision rule?mnx?mnx in the classical framework of choice under complete uncertainty. (shrink)