We study the theories I∇n, L∇n and overspill principles for ∇n formulas. We show that IEn ⇒ L∇n ⇒ I∇n, but we do not know if I∇n L∇n. We introduce a new scheme, the growth scheme Crγ, and we prove that L∇n ⇒ Cr∇n⇒ I∇n. Also, we analyse the utility of bounded collection axioms for the study of the above theories.

Kurt Godel was the most outstanding logician of the twentieth century, famous for his work on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum hypothesis. He is also noted for his work on constructivity, the decision problem, and the foundations of computation theory, as well as for the strong individuality of his writings on the philosophy of mathematics. Less well-known is his discovery of unusual cosmological models for Einstein's (...) equations, permitting "time-travel" into the past. This second volume of a comprehensive edition of Godel's works collects together all his publications from 1938 to 1974. Together with Volume I (Publications 1929-1936), it makes available for the first time in a single source all of his previously published work. Continuing the format established in the earlier volume, the present text includes introductory notes that provide extensive explanatory and historical commentary on each of the papers, a facing English translation of the one German original, and a complete bibliography. Succeeding volumes are to contain unpublished manuscripts, lectures, correspondence, and extracts from the notebooks. Collected Works is designed to be accessible and useful to as wide an audience as possible without sacrificing scientific or historical accuracy. The only complete edition available in English, it will be an essential part of the working library of professionals and students in logic, mathematics, philosophy, history of science, and computer science. These volumes will also interest scientists and all others who wish to be acquainted with one of the great minds of the twentieth century. (shrink)

The principle of set theory known as the Axiom of Choice has been hailed as “probably the most interesting and, in spite of its late appearance, the most discussed axiom of mathematics, second only to Euclid's axiom of parallels which was introduced more than two thousand years ago” (Fraenkel, Bar-Hillel & Levy 1973, §II.4). The fulsomeness of this description might lead those unfamiliar with the axiom to expect it to be as startling as, say, the Principle of the Constancy of (...) the Velocity of Light or the Heisenberg Uncertainty Principle. But in fact the Axiom of Choice as it is usually stated appears humdrum, even self-evident. For it amounts to nothing more than the claim that, given any collection of mutually disjoint nonempty sets, it is possible to assemble a new set — a transversal or choice set — containing exactly one element from each member of the given collection. Nevertheless, this seemingly innocuous principle has far-reaching mathematical consequences — many indispensable, some startling — and has come to figure prominently in discussions on the foundations of mathematics. It (or its equivalents) have been employed in countless mathematical papers, and a number of monographs have been exclusively devoted to it. (shrink)

Arrow’s impossibility theorem states that if an aggregation rule satisfies unrestricted domain, weak Pareto, independence of irrelevant alternatives, and collective rationality, then there exists a dictator. Among others, Arrow’s postulate of collective rationality is controversial. We propose a new axiom for an aggregation rule, decisiveness coherence, which is weaker than collective rationality. It is shown that given the Arrovian axioms other than collective rationality, a dictatorship arises if and only if decisiveness coherence is satisfied. Moreover, we introduce weak versions (...) of decisive coherence and examine these implications. (shrink)

This paper investigates the status of the fragments of Peano Arithmetic obtained by restricting induction, collection and least number axiom schemes to formulas which are $${\Delta_1}$$ provably in an arithmetic theory T. In particular, we determine the provably total computable functions of this kind of theories. As an application, we obtain a reduction of the problem whether $${I\Delta_0 + \neg \mathit{exp}}$$ implies $${B\Sigma_1}$$ to a purely recursion-theoretic question.

We examine what happens if we replace ZFC with a localistic/relativistic system, LZFC, whose central new axiom, denoted by Loc(ZFC), says that every set belongs to a transitive model of ZFC. LZFC consists of Loc(ZFC) plus some elementary axioms forming Basic Set Theory (BST). Some theoretical reasons for this shift of view are given. All ${\Pi_2}$ consequences of ZFC are provable in LZFC. LZFC strongly extends Kripke-Platek (KP) set theory minus Δ0-Collection and minus ${\in}$ -induction scheme. ZFC+ “there (...) is an inaccessible cardinal” proves the consistency of LZFC. In LZFC we focus on models rather than cardinals, a transitive model being considered as the analogue of an inaccessible cardinal. Pushing this analogy further we define α-Mahlo models and ${\Pi_1^1}$ -indescribable models, the latter being the analogues of weakly compact cardinals. Also localization axioms of the form ${Loc({\rm ZFC}+\phi)}$ are considered and their global consequences are examined. Finally we introduce the concept of standard compact cardinal (in ZFC) and some standard compactness results are proved. (shrink)

There are several ontological and consequently also methodological mistakes in contemporary mainstream economics. Among them, the so-called ergodic axiom is play significant role. It is understandable that the real economy elaborated as formalized mental model looks like dynamic system on first sight. However, that is right only of dynamical systems in mathematical formalism. Economy that is in our understanding societal and/or collective economy is complex evolving organism. If we imagine such organism in the form of dynamical system that is as (...) clear mathematical formalism, we are losing their crucial authentic character. The significant irredeemable attribute of societal economy is lying in his complex evolving network process character created by large population of people with different decision-making and complex realizing among them. Going from these imaginations the two entities in a question that is dynamical system with their ergodicity and societal economic organism as complex evolving network are qualitative very different ones. That is the reason why we cannot accede with endeavours to draw on living economy straitjacket of ergodic axiom. To articulate that cause by other words ergodic dynamical systems are applicable for physical and partly for chemical entities and only scarcely are fit for living organisms. On the other hand however, as clear method the ergodic dynamical system have good applying for didactical approaches in economics where helping in better understanding some types of complexities in dynamics. The purpose of that essay is to discuss problems around usability of ergodic dynamical system theory and methods in economics in the age of advanced ICT knowledge based society. (shrink)

The Hyperuniverse Programme, introduced in Arrigoni and Friedman (2013), fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the `maximal iterative concept', and the programme identi fies higher-order statements motivated by the maximal iterative concept. The satisfaction (...) of these statements (H-axioms) in countable transitive models, the collection of which constitutes the `hyperuniverse' (H), has remarkable 1st-order consequences, some of which we review in section 5. (shrink)

Two theorems are proved: First that the statement“there exists a field F such that for every vector space over F, every generating set contains a basis”implies the axiom of choice. This generalizes theorems of Halpern, Blass, and Keremedis. Secondly, we prove that the assertion that every vector space over ℤ2 has a basis implies that every well-ordered collection of two-element sets has a choice function.

One of the basic theorems in universal algebra is Birkhoff's variety theorem: the smallest equationally axiomatizable class containing a class K of algebras coincides with the class obtained by taking homomorphic images of subalgebras of direct products of elements of K. G. Gratzer asked whether the variety theorem is equivalent to the Axiom of Choice. In 1980, two of the present authors proved that Birkhoff's theorem can already be derived in ZF. Surprisingly, the Axiom of Foundation plays a crucial role (...) here: we show that Birkhoff's theorem cannot be derived in ZF + AC {Foundation}. even if we add Foundation for Finite Sets. We also prove that the variety theorem is equivalent to a purely set-theoretical statement, the Collection Principle. This principle is independent of $ZF \{\operatorname{Foundation}$ . The second part of the paper deals with further connections between axioms of ZF-set theory and theorems of universal algebra. (shrink)

We show that the existence of a recursively enumerable set whose Turing degree is neither low nor complete cannot be proven from the basic axioms of first order arithmetic (P -) together with Σ 2 -collection (BΣ 2 ). In contrast, a high (hence, not low) incomplete recursively enumerable set can be assembled by a standard application of the infinite injury priority method. Similarly, for each n, the existence of an incomplete recursively enumerable set that is neither low (...) n nor high n - 1 , while true, cannot be established in P - + BΣ n + 1 . Consequently, no bounded fragment of first order arithmetic establishes the facts that the high n and low n jump hierarchies are proper on the recursively enumerable degrees. (shrink)

We introduce a principle of local collection for compositional truth predicates and show that it is arithmetically conservative over the classically compositional theory of truth. This axiom states that upon restriction to formulae of any syntactic complexity, the resulting predicate satisfies full collection. In particular, arguments using collection for the truth predicate applied to sentences occurring in any given (code of a) proof do not suffice to show that the conclusion of that proof is true, in stark (...) contrast to the case of the induction scheme. We analyse various further results concerning end-extensions of models of compositional truth and the collection scheme for the compositional truth predicate. (shrink)

In this paper I argue for the view that the axioms of ZF are analytic truths of a particular concept of set. By this I mean that these axioms are true by virtue only of the meaning attached to this concept, and, moreover, can be derived from it. Although I assume that the object of ZF is a concept of set, I refrain from asserting either its independent existence, or its dependence on subjectivity. All I presuppose is that (...) this concept is given to us with a certain sense as the objective focus of a phenomenologically reduced intentional experience. The concept of set that ZF describes, I claim, is that of a multiplicity of coexisting elements that can, as a consequence, be a member of another multiplicity. A set is conceived as a quantitatively determined collection of objects that is, by necessity, ontologically dependent on its elements, which, on the other hand, must exist independently of it. A close scrutiny of the essential characters of this conception seems to be sufficient to ground the set-theoretic hierarchy and the axioms of ZF. (shrink)

We present a study of unpublished fragments of Jan F. Drewnowski’s manuscript from the years 1922–1928, which contains his own axiomatics for mereology. The sources are transcribed and two versions of mereology are reconstructed from them. The first one is given by Drewnowski. The second comes from Leśniewski and was known to Drewnowski from Leśniewski’s lectures. Drewnowski’s version is expressed in the language of ontology enriched with the primitive concept of a (proper) part, and its key axiom expresses the so-called (...) weak super-supplementation principle, which was named by Drewnowski “the postulate of the existence of subtractions”. Leśniewski’s axiomatics with the primitive concept of an ingrediens contains the axiom expressing the strong super-supplementation principle. In both systems the collective class of objects from the range of a given non-empty concept is defined as the upper bound of that range. From a historical point of view it is interesting to notice that the presented version of Leśniewski’s axiomatics has not been published yet. The same applies to Drewnowski’s approach. We reconstruct the proof of the equivalence of these two systems. Finally, we discuss questions stemming from their equivalence in frame of elementary mereology formulated in a modern way. (shrink)

By a result of Paris and Friedman, the collection axiom schema for $\Sigma_{n+1}$ formulas, $B\Sigma_{n+1}$ , is $\Pi_{n+2}$ conservative over $I\Sigma_n$ . We give a new proof-theoretic proof of this theorem, which is based on a reduction of $B\Sigma_n$ to a version of collection rule and a subsequent analysis of this rule via Herbrand's theorem. A generalization of this method allows us to improve known results on reflection principles for $B\Sigma_n$ and to answer some technical questions left open (...) by Sieg [23] and Hájek [9]. We also give a new proof of independence of $B\Sigma_{n+1}$ over $I\Sigma_n$ by a direct recursion-theoretic argument and answer an open problem formulated by Gaifman and Dimitracopoulos [8]. (shrink)

This paper analyses the hidden use of new axioms in set-theoretic practice with a focus on large cardinal axioms and presents a general overview of set-theoretic practices using large cardinal axioms. The hidden use of a new axiom provides extrinsic reasons in support of this axiom via the idea of verifiable consequences, which is especially relevant for set-theoretic practitioners with an absolutist view. Besides that, the hidden use has pragmatic significance for further important sub-groups of the set-theoretic (...) community---set-theoretic practitioners with a pluralist view and set-theoretic practitioners who aim for ZFC-proofs. By describing this, the paper gives a more complete picture of new axioms in set-theoretic practice. These observations, for instance, show that set-theoretic practitioners interested in ZFC-proofs use tools that go beyond ZFC. The analysis is based on empirical data that was collected in an extensive interview study with set-theoretic practitioners. (shrink)

Kurt Gödel was the greatest logician of this century. This third volume of his collected works consists of previously unpublished material, both essays and lectures.

Kurt Gödel was the most outstanding logician of the twentieth century, famous for his hallmark works on the completeness of logic, the incompleteness of number theory, and the consistency of the axiom of choice and the continuum hypothesis. He is also noted for his work on constructivity, the decision problem, and the foundations of computability theory, as well as for the strong individuality of his writings on the philosophy of mathematics. He is less well known for his discovery of unusual (...) cosmological models for Einstein's equations, in theory permitting time travel into the past. The Collected Works is a landmark resource that draws together a lifetime of creative thought and accomplishment. The first two volumes were devoted to Gödel's publications in full, and the third volume featured a wide selection of unpublished articles and lecture texts found in Gödel's Nachlass. These long-awaited final two volumes contain Gödel's correspondence of logical, philosophical, and scientific interest. Volume IV covers A to G, with H to Z in volume V; in addition, Volume V contains a full inventory of Gödel's Nachlass. L All volumes include introductory notes that provide extensive explanatory and historical commentary on each body of work, English translations of material originally written in German, and a complete bibliography of all works cited. Kurt Gödel: Collected Works is designed to be useful and accessible to as wide an audience as possible without sacrificing scientific or historical accuracy. The only comprehensive edition of Gödel's work available, it will be an essential part of the working library of professionals and students in logic, mathematics, philosophy, history of science, and computer science and all others who wish to be acquainted with one of the great minds of the twentieth century. (shrink)

The Hyperuniverse Programme, introduced in Arrigoni and Friedman, fosters the search for new set-theoretic axioms. In this paper, we present the procedure envisaged by the programme to find new axioms and the conceptual framework behind it. The procedure comes in several steps. Intrinsically motivated axioms are those statements which are suggested by the standard concept of set, i.e. the ‘maximal iterative concept’, and the programme identifies higher-order statements motivated by the maximal iterative concept. The satisfaction of these (...) statements in countable transitive models, the collection of which constitutes the ‘hyperuniverse’, has remarkable first-order consequences, some of which we review in Sect. 10.5. (shrink)

While it is known that intuitionistic ZF set theory formulated with Replacement, IZFR, does not prove Collection, it is a longstanding open problem whether IZFR and intuitionistic set theory ZF formulated with Collection, IZF, have the same proof-theoretic strength. It has been conjectured that IZF proves the consistency of IZFR. This paper addresses similar questions but in respect of constructive Zermelo–Fraenkel set theory, CZF. It is shown that in the latter context the proof-theoretic strength of Replacement is the (...) same as that of Strong Collection and also that the functional version of the Regular Extension Axiom is as strong as its relational version.Moreover, it is proved that, contrary to IZF, the strength of CZF increases if one adds an axiom asserting that the trichotomous ordinals form a set.Unlike IZF, constructive Zermelo–Fraenkel set theory is amenable to ordinal analysis and the proofs in this paper make pivotal use thereof in the guise of well-ordering proofs for ordinal representation systems. (shrink)

Ontologies represent principled, formalised descriptions of agents’ conceptualisations of a domain. For a community of agents, these descriptions may differ among agents. We propose an aggregative view of the integration of ontologies based on Judgement Aggregation (JA). Agents may vote on statements of the ontologies, and we aim at constructing a collective, integrated ontology, that reflects the individual conceptualisations as much as possible. As several results in JA show, many attractive and widely used aggregation procedures are prone to return inconsistent (...) collective ontologies. We propose to solve the possible inconsistencies in the collective ontology by applying suitable weakenings of axioms that cause inconsistencies. (shrink)

As it is indicated in the title, this paper is devoted to the problem of defining mereological (collective) sets. Starting from basic properties of sets in mathematics and differences between them and so called conglomerates in Section 1, we go on to explicate informally in Section 2 what it means to join many objects into a single entity from point of view of mereology, the theory of part of (parthood) relation. In Section 3 we present and motivate basic axioms (...) for part of relation and we point to their most fundamental consequences. Next three sections are devoted to formal explication of the notion of mereological set (collective set) in terms of sums, fusions and aggregates. We do not give proofs of all theorems. Some of them are complicated and their presentation would divert the reader’s attention from the main topic of the paper. In such cases we indicate where the proofs can be found and analyzed by those who are interested. (shrink)

The purpose of this paper is to investigate the relationship between collective rationality and permissible collective choice rules using a unified approach inspired by Bossert and Suzumura (J Econ Theory 138:311–320, 2008). We consider collective choice rules satisfying four axioms: unrestricted domain, strong Pareto, anonymity, and neutrality. A number of new classes of collective choice rules as well as the Pareto and Pareto extension rules are characterized under various concepts of collective rationality: acyclicity, transitivity, quasi-transitivity, semi-transitivity, and the interval (...) order property. Further, new concepts of collective rationality, K-term acyclicity and K-term consistency, are proposed and the corresponding characterizations are provided. (shrink)

Kurt Godel was the most outstanding logician of the 20th century. This second volume of Godel's works collects the remainder of his published work, covering the period 1938-1974. Each article or closely related group of articles is preceded by an introductory note that elucidates it and places it in its historical context.

The initial volume of a comprehensive edition of Gödel's works, this book makes available for the first time in a single source all his publications from 1929 to 1936. The volume begins with an informative overview of Gödel's life and work and features facing English translations for all German originals, extensive explanatory and historical notes, and a complete biography. Volume 2 will contain the remainder of Gödel's published work, and subsequent volumes will include unpublished manuscripts, lectures, correspondence and extracts from (...) the notebooks. (shrink)

Let be the basic set theory that consists of the axioms of extensionality, emptyset, pair, union, powerset, infinity, transitive containment, Δ0‐separation and set foundation. This paper studies the relative strength of set theories obtained by adding fragments of the set‐theoretic collection scheme to. We focus on two common parameterisations of the collection: ‐collection, which is the usual collection scheme restricted to ‐formulae, and strong ‐collection, which is equivalent to ‐collection plus ‐separation. The main (...) result of this paper shows that for all, proves that there exists a transitive model of Zermelo Set Theory plus ‐collection, the theory is ‐conservative over the theory. It is also shown that (2) holds for when the Axiom of Choice is included in the base theory. The final section indicates how the proofs of (1) and (2) can be modified to obtain analogues of these results for theories obtained by adding fragments of collection to a base theory (Kripke‐Platek Set Theory with Infinity plus ) that does not include the powerset axiom. (shrink)

Kurt Gdel was the most outstanding logician of the 20th century and a giant in the field. This book is part of a five volume set that makes available all of Gdel's writings. The first three volumes, already published, consist of the papers and essays of Gdel. The final two volumes of the set deal with Gdel's correspondence with his contemporary mathematicians, this fourth volume consists of material from correspondents from A-G.

If ZFC is consistent, then the collection of countable computably saturated models of ZFC satisfies all of the Multiverse Axioms of Hamkins.

This thesis is divided into three parts, the first and second ones focused on combinatorics and classification problems on discrete and geometrical objects in the context of descriptive set theory, and the third one on generalized descriptive set theory at singular cardinals of countable cofinality.Descriptive Set Theory (briefly: DST) is the study of definable subsets of Polish spaces, i.e., separable completely metrizable spaces. One of the major branches of DST is Borel reducibility, successfully used in the last 30 years to (...) solve and compare many classification problems. One of our goals is the classification of knots, very familiar and tangible objects in everyday life, which also play an important role in modern mathematics. The study of knots and their properties is known as knot theory. Our plan is to gain insight into knots using discrete objects, such as linear and circular orders. This approach was already exploited in [6]. The first part of this work is therefore devoted to countable linear orders and the study of the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results. We also expand our research to the case of circular orders.Another objective of this first part is to extend the notion of convex embeddability on countable linear orders. We provide a family of quasi-orders of which embeddability is a particular case as well. We study these quasi-orders from a combinatorial point of view and analyse their complexity with respect to Borel reducibility. Furthermore, we extend the analysis of these quasi-orders to the set of uncountable linear orders.The second part of the project deals with classification problems on knots and $3$ -manifolds. The goal here is to apply the results obtained in the first part to the study of proper arcs and knots, establishing lower bounds for the complexity of some natural relations between these geometrical objects. We also obtain some combinatorial results which are particularly interesting when we restrict to the set of wild proper arcs and wild knots, classes which haven’t received much attention so far. These parts are included in the two preprints [4, 5] in collaboration with my supervisor Alberto Marcone, Luca Motto Ros (University of Torino), and Vadim Weinstein (University of Oulu).The second part of this work also includes the classification of non-compact $3$ -manifolds up to homeomorphism (the case of compact $3$ -manifolds has already been solved: indeed, there are only countably many $3$ -manifolds up to homeomorphism; see [7]), and that of Cantor sets of $\mathbb {R}^3$ up to conjugation (answering to Question 5.5 of [3]). Here we resort to algebraic tools. Stone duality gives a neat way to go back-and-forth between totally disconnected Polish spaces and countable Boolean algebras (see [1]). The main ingredient is the Stone space of all ultrafilters on a Boolean algebra. In this work we introduce a weaker concept which we call “blurry filter”. Using blurry filters instead of ultrafilters enables one to extend the class of spaces under consideration beyond totally disconnected. As an application of this method, we show that both homeomorphism on non-compact $3$ -manifolds and conjugation of Cantor sets in $\mathbb {R}^3$ are completely classifiable by countable structures. These results are part of an upcoming paper in collaboration with Vadim Weinstein.The last part of this thesis concerns the natural generalization of descriptive set theory that occurs when countable is replaced by uncountable, called Generalized Descriptive Set Theory (briefly: GDST). In particular, we focus on the case of GDST for a singular cardinal $\kappa $ of countable cofinality. The goal here is to study the generalizations of the Perfect Set Property and the Baire Property to subsets of spaces of higher cardinalities, like the power set $\mathcal {P}(\kappa )$. We consider the question under which large cardinal hypotheses classes of definable subsets of these spaces possess such regularity properties, focusing on rank-into-rank axioms, like I2, and classes of sets definable by $\Sigma _1$ -formulas with parameters from various collections of sets. The obtained results are included in [2], a joint work with my co-supervisor Vincenzo Dimonte and Philipp Lücke (University of Hamburg).Abstract prepared by Martina IannellaE-mail: [email protected]: https://air.uniud.it/handle/11390/1262824. (shrink)

In this interview with Andrée Bergeron, Isabelle Stengers casts fresh light on the question of expertise, with which the movement of the intermittents - like other movements both yesterday and today - is now confronted. She recalls that the figure of the expert is not a contemporary « invention » and that it includes multiple realities which are rarely free of political consequences. On the contrary, the choice of the expert, the definition of acceptable questions and the degree of « (...) deafness » to « democratic events », are all eminently political problems. By acquiring the tools to ask the questions that matter to them the collective of intermittents and precarious workers has already created a « democratic event ». Now it is a matter of rising to a double challenge: for the movement, that of fabricating a collective intelligence that can transform the knowledge produced into interventions capable of making people think and feel; and for the researchers in the social science, that of succeeding in considering this event as the experimental science consider the laboratory, namely, as that which makes innovation and learning possible. Constructing the choice of a counter-expertise therefore means learning to double the struggle around what Deleuze and Guattari call axioms with a practical invention of a quite different sort, involving a minority becoming - a collective intelligence that does not contradict but creates. (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)

In set theory without the Axiom of Choice we prove that the assertion “For every metric space (_X_, _d_) with a Borel measure \(\mu \) such that the measure of every open ball is positive and finite, (_X_, _d_) is separable.’ is implied by the axiom of choice for countable collections of sets and implies the axiom of choice for countable collections of finite sets. We also show that neither implication is reversible in Zermelo–Fraenkel set theory weakend to permit the (...) existence of atoms and that the second implication is not reversible in Zermelo–Fraenkel set theory. This gives an answer to a question of Dybowski and Górka (Arch Math Logic 62:735–749, 2023. https://doi.org/10.1007/s00153-023-00868-4 ). (shrink)

The quantum information introduced by quantum mechanics is equivalent to a certain generalization of classical information: from finite to infinite series or collections. The quantity of information is the quantity of choices measured in the units of elementary choice. The “qubit”, can be interpreted as that generalization of “bit”, which is a choice among a continuum of alternatives. The axiom of choice is necessary for quantum information. The coherent state is transformed into a well-ordered series of results in time after (...) measurement. The quantity of quantum information is the transfinite ordinal number corresponding to the infinity series in question. The transfinite ordinal numbers can be defined as ambiguously corresponding “transfinite natural numbers” generalizing the natural numbers of Peano arithmetic to “Hilbert arithmetic” allowing for the unification of the foundations of mathematics and quantum mechanics. (shrink)

This study investigates Suzumura consistency as a condition for the rationality of social preferences. A preference is said to be Suzumura-consistent when all preference cycles include only indifference relations. This condition is equivalent to transitivity in the presence of completeness, but, in general, it is substantially weaker than transitivity when preference is incomplete. Notably, Suzumura consistency is especially significant for a preference because it is necessary and sufficient for the existence of an ordering (transitive and complete preference) that is compatible (...) with the original preference. This coherency property can be regarded as a requirement for potential rationality. In this study, we examine the implications of shifting from actual rationality to potential rationality in collective decision-making. We introduce the concept of an alternative-dependent coherent collection in order to obtain a representation of a class of Suzumura-consistent collective choice rules that satisfy the axioms imposed in Arrow’s impossibility theorem. This demonstrates that the power structure to determine social choice can be alternative-dependent. (shrink)

We examine the impact of Suzumura’s (Economica 43:381–390, 1976) consistency property when applied in the context of collective choice rules that are independent of irrelevant alternatives, neutral, and monotonic. An earlier contribution by Blau and Deb (Econometrica 45:871–879, 1977) establishes the existence of a vetoer if the collective relation is required to be complete and acyclical. The purpose of this paper is to explore the possibilities that result if completeness and acyclicity are dropped and Suzumura consistency is imposed instead. A (...) conceptually similar but logically independent version of the combined axiom that requires the collective decision mechanism to be independent, neutral, and monotonic is employed. In the case of a finite population, we obtain an alternative impossibility theorem if a collective choice rule is assumed to be non-degenerate and a modified no veto requirement is imposed instead of Blau and Deb’s (1977) condition. If the population is countably infinite, the impossibility can be avoided but it resurfaces if our new no veto property is extended to a coalitional variant. (shrink)

This paper examines the incompleteness of collective preference. We provide a series of Arrovian impossibility theorems without completeness. First, we consider the notion of regularity introduced by Eliaz and Ok (2006, Games and Economic Behavior 56, 61–86); it is an appropriate richness property for strict preference when preference is allowed to be incomplete. We examine the implication of imposing regularity on collective preference. Second, we propose responsiveness, a variation of positive responsiveness. This axiom requires that some changes in individual preferences (...) make an alternative weakly better than another. Third, we consider coherency conditions for collective preferences; this conditionally requires the existence of comparable pairs in a certain manner. We prove an impossibility result for each condition using Arrovian axioms. (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)

A mixture preorder is a preorder on a mixture space (such as a convex set) that is compatible with the mixing operation. In decision theoretic terms, it satisfies the central expected utility axiom of strong independence. We consider when a mixture preorder has a multi-representation that consists of real-valued, mixture-preserving functions. If it does, it must satisfy the mixture continuity axiom of Herstein and Milnor (1953). Mixture continuity is sufficient for a mixture-preserving multi-representation when the dimension of the mixture space (...) is countable, but not when it is uncountable. Our strongest positive result is that mixture continuity is sufficient in conjunction with a novel axiom we call countable domination, which constrains the order complexity of the mixture preorder in terms of its Archimedean structure. We also consider what happens when the mixture space is given its natural weak topology. Continuity (having closed upper and lower sets) and closedness (having a closed graph) are stronger than mixture continuity. We show that continuity is necessary but not sufficient for a mixture preorder to have a mixture-preserving multi-representation. Closedness is also necessary; we leave it as an open question whether it is sufficient. We end with results concerning the existence of mixture-preserving multi-representations that consist entirely of strictly increasing functions, and a uniqueness result. (shrink)

In this paper we deal with some new axiom schemes for Peano's Arithmetic that can substitute the classical induction, least-element, collection and strong collection schemes in the description of PA.

We apply the method of asymmetric interpretation to the basic fragment of bounded arithmetic, endowed with a weak collection schema, and to a system of “feasible analysis”, introduced by Ferreira and based on weak König's lemma, recursive comprehension and NP-notation induction. As a byproduct, we obtain two conservation results.

This paper provides a partial solution to the completeness problem for Joyal's axiomatization of open and etale maps, under the additional assumption that a collection axiom holds.

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)

We show that the theory, consisting of the usual axioms of but with the power set axiom removed—specifically axiomatized by extensionality, foundation, pairing, union, infinity, separation, replacement and the assertion that every set can be well‐ordered—is weaker than commonly supposed and is inadequate to establish several basic facts often desired in its context. For example, there are models of in which ω1 is singular, in which every set of reals is countable, yet ω1 exists, in which there are sets (...) of reals of every size, but none of size, and therefore, in which the collection axiom fails; there are models of for which the Łoś theorem fails, even when the ultrapower is well‐founded and the measure exists inside the model; there are models of for which the Gaifman theorem fails, in that there is an embedding of models that is Σ1‐elementary and cofinal, but not elementary; there are elementary embeddings of models whose cofinal restriction is not elementary. Moreover, the collection of formulas that are provably equivalent in to a Σ1‐formula or a Π1‐formula is not closed under bounded quantification. Nevertheless, these deficits of are completely repaired by strengthening it to the theory, obtained by using collection rather than replacement in the axiomatization above. These results extend prior work of Zarach. (shrink)

In this paper a method to construct Kripke models for subtheories of constructive set theory is introduced that uses constructions from classical model theory such as constructible sets and generic extensions. Under the main construction all axioms except the collection axioms can be shown to hold in the constructed Kripke model. It is shown that by carefully choosing the classical models various instances of the collection axioms, such as exponentiation, can be forced to hold as (...) well. The paper does not contain any deep results. It consists of first observations on the subject, and is meant to introduce some notions that could serve as a foundation for further research. (shrink)

Corporate/collective moral responsibility is a thorny topic in business ethics and this paper argues that this is due a number of unacknowledged and connected epistemic issues. Firstly, CSR, Corporate Citizenship and many other research streams that are based on the assumption of collective and/or corporate moral responsibility are not compatible with Kantian ethics, consequentialism, or virtue ethics because corporate/collective responsibility violates the axioms and central hypotheses of these research programmes. Secondly, in the absence of a sound theoretical moral philosophical (...) foundation, business ethicists have based their ideas on legal and political epistemologies, yet still claim to be ethics-based. Thirdly, research is often driven by an intention to prove that a specific social goal is right, not by open and critical inquiry. Finally, today, corporate/collective moral responsibility is widely accepted as the Truth as most researchers are unaware of any issues because they are untrained in philosophy. The paper identifies the confusion about the epistemic basis as a major impediment for delivering a thick concept of the role of corporations as moral agents. Thus, the paper does not argue against corporate or collective agency as such, but points out an obvious but forgotten paradox: corporate and collective personhood cannot, at the moment at least, be epistemologically grounded in the field in which business ethics claims to operate: moral philosophy. (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.