This paper proposes a class of independence axioms for simple acts. By introducing the E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {E}}$$\end{document}-cominimum independence axiom that is stronger than the comonotonic independence axiom but weaker than the independence axiom, we provide a new axiomatization theorem of simple acts within the framework of Choquet expected utility. Furthermore, in order to provide the axiomatization of simple acts, we generalize Kajii et al. into an infinite state space. Our axiomatization (...) theorem relates Choquet expected utility to multi-prior expected utility through the core of a capacity that is explicitly derived within our framework. Our result in this paper also derives Gilboa, Eichberger and Kelsey, and Rohde as a corollary. (shrink)

Doctorante en philosophie politique à l’Université de Paris I. Elle consacre ses recherches au lien unissant le multiculturalisme et l’identité nationale. Elle travaille en collaboration avec l’Université Laval au Québec, où elle effectue sa thèse en cotutelle. Tout voyageur qui entreprend la traversée du Brésil ne pourra qu’être surpris de l’extraordinaire richesse et diversité.

In this article, I argue that the concept of alienation should be mobilized to develop a ‘geo-social’ critique of the generic forms of life that sustain contemporary capitalist societies, in a time when the stability of the Earth system is increasingly at risk. I contend that retrieving the full heuristic potential of the concept demands engaging the fields where it has been traditionally discussed (notably social philosophy and environmental philosophy) to demonstrate how their insights on alienation can be fruitfully combined. (...) By putting greater emphasis on how society and nature are mutually embedded, this new approach to alienation highlights the anthropocentrism that critical theory has long conveyed and indicates how it could be at least partially corrected. (shrink)

Cet essai se propose d’étudier les liens qu’entretient la philosophie transcendantale à l’expérience, à partir du concept de signe historique. Ce concept s’applique à un événement historique qui, en tant que tel, permettrait de « passer » de l’expérience historique au domaine supra-sensible du Progrès : en indiquant une disposition morale de l’Humanité le signe corroborerait l’Idée d’une progression vers le mieux. Le signe historique que Kant identifie est « la manière de penser des spectateurs»s’exprimant à l’occasion de la Révolution (...) française. Pour autant, Kant utilise à la fois le vocabulaire du désintéressement propre au jugement de goût et celui de l’enthousiasme, propre au sublime. Cette équivocité jette le doute sur le statut de signe accordé à cette manière de penser, et sur la modalité par laquelle un passage de l’empirie au transcendantal est rendu possible. (shrink)

Depuis un certain temps déjà, la société québécoise connaît un ensemble de mutations majeures sur les plans social et démographique, ainsi que sur celui des représentations symboliques. Elle ne peut plus être envisagée par le biais des concepts et métaphores habituellement utilisés, en France notamment, pour cerner ses caractéristiques particulières : « nation tricotée serrée »,..

Le multiculturalisme est un terme dont les occurrences sont devenues si nombreuses dans le discours journalistique et politique que sa définition est floue et difficilement saisissable au regard de la multiplicité des sens et des contextes dans lesquel on l’emploie. Couramment utilisé pour décrire un phénomène présent dans les sociétés contemporaines, au sens large il désigne la diversité..

SABINE CHOQUET. — Est-ce qu’il y a encore une chance pour que le mouvement souverainiste apparaisse comme un mouvement d’avenir ? Et si, pour vous, il n’est pas porteur d’un projet qui permette le développement du Québec, pouvez-vous nous en indiquer les raisons ?ALAIN DUBUC. — Je ne crois pas que le souverainisme soit un mouvement..

For non-additive set functions, the independent product, in general, is not unique and the Fubini theorem is restricted to slice-comonotonic functions. In this paper, we use the representation theorem of Gilboa and Schmeidler (Math Oper Res 20:197–212, 1995) to extend the Möbius product for non-additive set functions to non-finite spaces. We extend the uniqueness result of Ghirardato (J Econ Theory 73:261–291, 1997) for products of two belief functions and weaken the requirements on the marginals necessary to obtain the (...) Fubini property in the product. More importantly, we show that for the Möbius product one side of the Fubini theorem holds for all integrable functions if one of the marginals either is a probability or a convex combination of a chain of unanimity games, i.e., we relax the requirement of slice-comonotonicity and enrich the set of possible applications. (shrink)

YVES CHARLES ZARKA ET SABINE CHOQUET. — Est-ce qu’il y a un acte de naissance du souverainisme au Québec ? Et, si tel est le cas, est-il lié à la visite du général de Gaulle au Québec et à la célèbre phrase : « Vive le Québec libre ! » qu’il a prononcée à Montréal le 24 juillet 1967 ?JOSEPH FACAL. — On..

YVES CHARLES ZARKA ET SABINE CHOQUET. — Est-ce qu’il y a un acte de naissance du souverainisme au Québec ? Et, si tel est le cas, est-il lié à la visite du général de Gaulle au Québec et à la célèbre phrase : « Vive le Québec libre ! » qu’il a prononcée à Montréal le 24 juillet 1967 ?JOSEPH FACAL. — On..

Two different characterizations of POV measures with commutative range are compared using a representation of some stochastic operators by (weak) Markov kernels. A representation by Choquet theorem is obtained as an integral over functions of a sharp observable appearing in one of the characterizations. A Naimark extension is constructed.

This paper considers a decision-making process under ambiguity in which the decision-maker is supposed to split outcomes between familiar and unfamiliar ones. She is assumed to behave differently with respect to unfamiliar gains, unfamiliar losses and customary (familiar) outcomes. In particular, she is supposed to be pessimistic on gains, optimistic on losses and ambiguity neutral on the familiar outcomes. A generalization of the usual Choquet Integral is formalized when the decision maker holds capacities and probabilities. A characterization of the (...) decision-maker’s behavior is provided for a specific subset of capacities, in which it is shown that the decision-maker underestimates the unfamiliar outcomes while is linear in probabilities on customary ones. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued (...) trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

This paper studies decisions under ambiguity when attention is paid to extreme outcomes. In a purely subjective framework, we propose an axiomatic characterization of affine capacities, which are Choquet capacities consisting in an affine transformation of a subjective probability. Our main axiom restricts the well-known Savage’s Sure-Thing Principle to a change in a common intermediate outcome. The representation result is then an affine combination of the expected utility of the valued act and its maximal and minimal utilities.

Often, when one faces a choice between alternative actions, there are reasons both for and against each alternative. On one way of understanding these words, what one “ought to do all things considered (ATC)” is determined by the totality of these reasons. So, these reasons can somehow be “combined” or “aggregated” to yield an ATC verdict on these alternatives. First, various assumptions about this sort of aggregation of reasons are articulated. Then it is shown that these assumptions allow for the (...) proof of a “Reasons Aggregation Theorem” – parallel to John Harsanyi’s 1955 “Social Aggregation Theorem”. All reasons for action are grounded in reason-providing values; and, for every such reason-providing value, there is in principle a way of measuring how strongly this value counts against each alternative. The theorem tells us that the appropriate measure of how much reason ATC there is against each alternative is simply a weighted sum of the strengths with which these values count against that alternative; the agent ought not ATC to perform an action iff there is ATC more reason against it than against some available alternative. (shrink)

Asymmetric Choquet random walks are defined, in the form of dynamically consistent random walks allowing for asymmetric conditional capacities. By revisiting Kast and Lapied and Kast et al. we show that some findings regarding the effects of ambiguity aversion are preserved in the more general framework, which is of interest in several applications to policy making, risk management, corporate decisions, real option valuation of investment/ disinvestment projects, etc. The effect of ambiguity on the higher moments is investigated, as well, (...) as they have an interpretation in terms of the psychological attitude of a decision-maker towards ambiguity. Finally, some financial applications are provided as an illustration. (shrink)

Cumulative Prospect Theory is the modern version of Prospect Theory and it is nowadays considered a valid alternative to the classical Expected Utility Theory. Cumulative Prospect theory implies Gain-Loss Separability, i.e., the separate evaluation of losses and gains within a mixed gamble. Recently, some authors have questioned this assumption of the theory, proposing new paradoxes where the Gain-Loss Separability is violated. We present a generalization of Cumulative Prospect Theory which does not imply Gain-Loss Separability and is able to explain the (...) cited paradoxes. On the other hand, the new model, which we call the bipolar Cumulative Prospect Theory, genuinely generalizes the original Prospect Theory of Kahneman and Tversky, preserving the main features of the theory. We present also a characterization of the bipolar Choquet Integral with respect to a bi-capacity in a discrete setting. (shrink)

Choquet integrals and capacities play a crucial role in modern decision theory. Comonotony is a central concept for these theories because the main property of a Choquet integral is its additivity for comonotone functions. We consider a Choquet integral representation of preferences showing uncertainty aversion (pessimism) and propose axioms on time consistency which yield a candidate for conditional Choquet integrals. An other axiom characterizes the role of comonotony in the use of information. We obtain two conditioning (...) rules for capacities which amount to the well-known Bayes' and Dempster–Schafer's updating rules. We are allowed to interpret both of them as a lack of confidence in information in a dynamic extension of pessimism. (shrink)

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (shrink)

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

I discuss classical and quantum recurrence theorems in a unified manner, treating both as generalisations of the fact that a system with a finite state space only has so many places to go. Along the way I prove versions of the recurrence theorem applicable to dynamics on linear and metric spaces, and make some comments about applications of the classical recurrence theorem in the foundations of statistical mechanics.

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury theorems; (...) (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)

There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be rationalizable by (...) the AS model is in the spirit of but weaker than IIA; yet it is stronger than what is known in the literature as weak IIA (two profiles alike on x, y cannot have opposite strict social preferences on x and y). In addition to motivating violations of IIA, the AS model makes intelligible violations of another Arrovian assumption: the negative transitivity of the strict social preference relation P. While previous literature shows that only weakening IIA to weak IIA or only weakening negative transitivity of P to acyclicity still leads to impossibility theorems, we show that jointly weakening IIA to AS rationalizability and weakening negative transitivity of P leads to no such impossibility theorems. Indeed, we show that several appealing CCRs are AS rationalizable, including even transitive CCRs. (shrink)

This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. In (...) this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)

In this entry, Frege’s logic is introduced and described in some detail. It is shown how the Dedekind-Peano axioms for number theory can be derived from a consistent fragment of Frege’s logic, with Hume’s Principle replacing Basic Law V.

This note completes the main result of Zimper, by showing that additional conditions are needed in order the law of iterated expectations to hold true for Choquet decision makers. Due to the comonotonic additivity of Choquet expectations, the equation E[f, ν] = E[E[f, ν], ν], is valid only when the act f is comonotonic with its dynamic form, that we name “conditional certainty equivalent act”.

The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise (...) degrees of belief and full knowledge of all a priori truths. Ordinary subjects do not look very rational when compared to the kinds of agents usually talked about in decision theory. In this paper, I will develop an expected utility representation theorem aimed at the representation of those who are neither probabilistically coherent, logically omniscient, nor expected utility maximisers across the board—that is, agents who are frequently irrational. The agents in question may be deductively fallible, have incoherent credences, limited representational capacities, and fail to maximise expected utility for all but a limited class of gambles. (shrink)

We prove covering theorems for K, where K is the core model below the sharp for a strong cardinal, and give an application to stationary set reflection.

In this article we show that bi-intuitionistic predicate logic lacks the Craig Interpolation Property. We proceed by adapting the counterexample given by Mints, Olkhovikov and Urquhart for intuitionistic predicate logic with constant domains [13]. More precisely, we show that there is a valid implication $\phi \rightarrow \psi $ with no interpolant. Importantly, this result does not contradict the unfortunately named ‘Craig interpolation’ theorem established by Rauszer in [24] since that article is about the property more correctly named ‘deductive interpolation’ (...) (see Galatos, Jipsen, Kowalski and Ono’s use of this term in [5]) for global consequence. Given that the deduction theorem fails for bi-intuitionistic logic with global consequence, the two formulations of the property are not equivalent. (shrink)

The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic Mathematics BIM, and then search for statements that are, over BIM, equivalent to Brouwer’s Fan Theorem or to its positive denial, Kleene’s Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene’s Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene’s Alternative is, (...) intuitionistically, a nontrivial extension of the task of finding equivalents of the Fan Theorem, although there is a certain symmetry in the arguments that we shall try to make transparent. We introduce closed-and-separable subsets of Baire space $${\mathcal{N}}$$ and of the set $${\mathcal{R}}$$ of the real numbers. Such sets may be compact and also positively noncompact. The Fan Theorem is the statement that Cantor space $${\mathcal{C}}$$, or, equivalently, the unit interval [0, 1], is compact and Kleene’s Alternative is the statement that $${\mathcal{C}}$$, or, equivalently, [0, 1], is positively noncompact. The class of the compact closed-and-separable sets and also the class of the closed-and-separable sets that are positively noncompact are characterized in many different ways and a host of equivalents of both the Fan Theorem and Kleene’s Alternative is found. (shrink)

Along the same line as that in Ono (Ann Pure Appl Logic 161:246–250, 2009), a proof-theoretic approach to Glivenko theorems is developed here for substructural predicate logics relative not only to classical predicate logic but also to arbitrary involutive substructural predicate logics over intuitionistic linear predicate logic without exponentials QFLe. It is shown that there exists the weakest logic over QFLe among substructural predicate logics for which the Glivenko theorem holds. Negative translations of substructural predicate logics are studied by (...) using the same approach. First, a negative translation, called extended Kuroda translation is introduced. Then a translation result of an arbitrary involutive substructural predicate logics over QFLe is shown, and the existence of the weakest logic is proved among such logics for which the extended Kuroda translation works. They are obtained by a slight modification of the proof of the Glivenko theorem. Relations of our extended Kuroda translation with other standard negative translations will be discussed. Lastly, algebraic aspects of these results will be mentioned briefly. In this way, a clear and comprehensive understanding of Glivenko theorems and negative translations will be obtained from a substructural viewpoint. (shrink)

This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in RCA0. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in RCA0. This approach yields a proof of Arrow's (...) class='Hi'>theorem in RCA0, and thus in PRA, since Arrow's theorem can be formalised as a Π01 sentence. Finally we show that Fishburn's possibility theorem for countable societies is equivalent to ACA0 over RCA0. (shrink)

This paper introduces Agreement Theorems to dynamic-epistemic logic. We show first that common belief of posteriors is sufficient for agreement in epistemic-plausibility models, under common and well-founded priors. We do not restrict ourselves to the finite case, showing that in countable structures the results hold if and only if the underlying plausibility ordering is well-founded. We then show that neither well-foundedness nor common priors are expressible in the language commonly used to describe and reason about epistemic-plausibility models. The static agreement (...) result is, however, finitely derivable in an extended modal logic. We provide the full derivation. We finally consider dynamic agreement results. We show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via public announcements. (shrink)

We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our (...) proof to a special class of circular definitions as well as to the first-order case. (shrink)

In the context of Multiple criteria decision analysis, we present the necessary and sufficient conditions allowing to represent an ordinal preferential information provided by the decision maker by a Choquet integral w.r.t a 2-additive capacity. We provide also a characterization of this type of preferential information by a belief function which can be viewed as a capacity. These characterizations are based on three axioms, namely strict cycle-free preferences and some monotonicity conditions called MOPI and 2-MOPI.

Bayes' Theorem is a simple mathematical formula used for calculating conditional probabilities. It figures prominently in subjectivist or Bayesian approaches to epistemology, statistics, and inductive logic. Subjectivists, who maintain that rational belief is governed by the laws of probability, lean heavily on conditional probabilities in their theories of evidence and their models of empirical learning. Bayes' Theorem is central to these enterprises both because it simplifies the calculation of conditional probabilities and because it clarifies significant features of subjectivist (...) position. Indeed, the Theorem's central insight — that a hypothesis is confirmed by any body of data that its truth renders probable — is the cornerstone of all subjectivist methodology. (shrink)

Let R be an o-minimal expansion of an ordered group R has no poles, R cannot define a real closed field with domain R and order R is eventually linear and every R -definable set is a finite union of cones. As a corollary we get that Th has quantifier elimination and universal axiomatization in the language with symbols for the ordered group operations, bounded R -definable sets and a symbol for each definable endomorphism of the group.

Textbook on Gödel’s incompleteness theorems and computability theory, based on the Open Logic Project. Covers recursive function theory, arithmetization of syntax, the first and second incompleteness theorem, models of arithmetic, second-order logic, and the lambda calculus.

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, (...) machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)