This book is a theoretical and completely rigorous analysis of voting in committees that provides mathematical proof of the existence of democratic voting systems, which are immune to the manipulation of preferences of coalitions of voters. The author begins by determining the power distribution among voters that is induced by a voting rule, giving particular consideration to choice by plurality voting and Borda's rule. He then constructs, for all possible committees, well-behaved representative voting procedures which are not distorted by strategic (...) voting, giving complete solutions for certain important classes of committees. The solution to the problem of mass elections is fully characterised. (shrink)

Is truth a supreme value? At times, we doctors have to contend with a complex dilemma in which we face the value of truth on the one hand and conflict with another value on the other. Is it sometimes permissible and even necessary not to report the truth in favour of another, more important value? This is a description of an experience in which a doctor had to handle such an issue when a pregnant Muslim woman asked for a document (...) that she wasn’t pregnant when in fact she was, in order to avert the possibility of being murdered to preserve the honour of the family. The doctor decided that the value of life was more important than the value of truth. (shrink)

Resisting Contextual Information: You Can't Put a Salient Meaning Down Two experiments support the graded salience hypothesis, which assumes that early processing involves distinct mechanisms-linguistic and contextual-that do not interact but run parallel. While contextual processes make up an integrative, top-down mechanism that benefits from linguistic and extra-linguistic information, the linguistic mechanism is modular. Using Vu et al.'s materials, Experiment 1 shows that the sentential position of a target word is crucial for the operation of the global, predictive mechanism, whose (...) effects, accumulated in prior discourse, mask lexical effects in final, but not in initial position. Experiment 2 shows that even in a sentential position that favors contextual effects, lexical access is not affected: Salient meanings are activated upon encounter of the lexical stimulus, regardless of contextual information to the contrary. Taken together, these findings argue against direct access models, which suggest that context can selectively activate the appropriate meaning, regardless of salience. (shrink)

The existence of a Richter–Peleg multi-utility representation of a preorder by means of upper semicontinuous or continuous functions is discussed in connection with the existence of a Richter–Peleg utility representation. We give several applications that include the analysis of countable Richter–Peleg multi-utility representations.

The present paper gives a topological solution to representability problems related to multi-utility, in the field of Decision Theory. Necessary and sufficient topologies for the existence of a semicontinuous and finite Richter–Peleg multi-utility for a preorder are studied. It is well known that, given a preorder on a topological space, if there is a lower semicontinuous Richter–Peleg multi-utility, then the topology of the space must be finer than the Upper topology. However, this condition fails to be sufficient. Instead (...) of search for properties that must be satisfied by the preorder, we study finer topologies which are necessary or/and sufficient for the existence of semicontinuous representations. We prove that Scott topology must be contained in the topology of the space in case there exists a finite lower semicontinuous Richter–Peleg multi-utility. However, the existence of this representation cannot be guaranteed. A sufficient condition is given by means of Alexandroff’s topology, for that, we prove that more order implies less Alexandroff’s topology, as well as the converse. Finally, the paper is implemented with a topological study of the maximal elements. (shrink)

Regular dynamic logic is extended by the program construct, meaning and executed in parallel. In a semantics due to Peleg, each command is interpreted as a set of pairs (s,T), withT being the set of states reachable froms by a single execution of, possibly involving several processes acting in parallel. The modalities ] are given the interpretations>A is true ats iff there existsT withsRT andA true throughoutT, and.

Les etudes ici rassemblees interrogent les articulations et desarticulations que Jean-Francois Lyotard place au principe du langage. Le volume dessine ainsi les lignes de force et les deplacements de sa pensee, ses presupposes et ses apories. Il montre les malentendus et les polemiques suscites par sa reecriture radicale de la rationalite. Pas de langage en general, dit Lyotard, mais des langages multiples, des types de discours heterogenes que la politique brasse sans pacifier leurs conflits. La recherche du consensus, dont l' (...) ethique de la discussion a souligne l'importance, tend a occulter les differends qui divisent les fins respectives des genres de discours. On ne peut pas etre pacifiste en matiere de phrases, et pas indifferent. Car tout enchainement discursif signe la victoire d'un genre et porte tort aux autres. Sans compter que la parole, quel qu'en soit le registre, eclipse par principe ce qui echappe aux contraintes linguistiques, ce champ de la sensation et du sentiment que Discours, figure explorait, des 1971, en inventant le figural. Apres 1983, apres l' ontologie des phrases du Differend, Lyotard cherche a cerner ce que les mots laissent en souffrance et dont ils doivent pourtant temoigner. Phrase-affect, infantia, donation sensible, Chose sont quelques-uns des noms sous lesquels il pense alors ce qui resiste au langage, le travaille de l'interieur et signe la difficulte de l'ecriture.Ont participe a ce volume Isabelle Aubert, Geoffrey Bennington, Gaelle Bernard, Corinne Enaudeau, Frederic Fruteau de Laclos, Alberto Gualandi, Laurence Kahn, Charlotte Murgier, Andreas Niederberger, Sophie Nordmann, Michel Olivier, Claire Pages, Ronit Peleg, Gerard Raulet, Jean-Francois Rey, Jean-Michel Salanskis, Francois-David Sebbah, Gerald Sfez, Rieke Trimcev. (shrink)

This is the first paper on constructive concurrent dynamic logic . For the first time, either for concurrent or sequential dynamic logic, we give a satisfactory treatment of what statements are forced to be true by partial information about the underlying computer. Dynamic logic was developed by Pratt [V. Pratt, Semantical considerations on Floyd–Hoare logic, in: 17th Annual IEEE Symp. on Found. Comp. Sci., New York, 1976, pp. 109–121, V. Pratt, Applications of modal logic to programming, Studia Logica 39 257–274] (...) for nondeterministic sequential programs, and by Peleg [D. Peleg, Concurrent dynamic logic, Journal of the Association for Computing Machinery 34 , D. Peleg, Communication in concurrent dynamic logic, Journal of Computer and System Sciences 35 ] for concurrent programs, for the purpose of proving properties of programs such as correctness. Here we define what it means for a dynamic logic formula to be forced to be true knowing only partial information about the results of assignments and tests. This informal CCDL semantics is formalized by intuitionistic Kripke frames modeling this partial information, and each such frame is interpreted as an idealized concurrent machine . In CCDL, proofs and deductions are ω-height, ω-branching, well-founded labeled subtrees of ωω. These are a generalization of the signed tableaux of Nerode [A. Nerode, Some lectures in modal logic, Technical Report, M.S.I. Cornell University, 1989, CIME Logic and Computer Science Montecatini Volume, Springer-Verlag Lecture Notes, 1990, A. Nerode, Some lectures in intuitionistic logic, Technical Report, M.S.I. Cornell University, 1988, Marktoberdorf Logic and Computation NATO Summer School Volume, NATO Science Series, 1990 ] stemming from the prefix tableaux of Fitting [M.C. Fitting, Proof Methods for Modal and Intuitionistic Logic, Reidel, 1983]. We demonstrate the correctness of our tableau proofs, define consistency properties, prove that consistency properties yield models, construct systematic tableaux, prove that systematic tableaux yield a consistency property, and conclude that CCDL is complete. This infinitary semantics and proof procedure will be the primary guide for defining, in a sequel, the correct finitary CCDL based on induction principles. FCCDL is suitable for implementation in constructive logic software systems such as Constable’s NUPRL or Huet-Coquand’s CONSTRUCTIONS. Our goal is to develop a constructive logic programming tool for specification and modular verification of programs in any imperative concurrent language, and for the extraction of concurrent programs from constructive proofs. Subsequent papers will introduce analogous logics for declarative and functional concurrent languages. (shrink)

We introduce a new class of real-valued monotones in preordered spaces, injective monotones. We show that the class of preorders for which they exist lies in between the class of preorders with strict monotones and preorders with countable multi-utilities, improving upon the known classification of preordered spaces through real-valued monotones. We extend several well-known results for strict monotones (Richter–Peleg functions) to injective monotones, we provide a construction of injective monotones from countable multi-utilities, and relate injective monotones to classic results (...) concerning Debreu denseness and order separability. Along the way, we connect our results to Shannon entropy and the uncertainty preorder, obtaining new insights into how they are related. In particular, we show how injective monotones can be used to generalize some appealing properties of Jaynes’ maximum entropy principle, which is considered a basis for statistical inference and serves as a justification for many regularization techniques that appear throughout machine learning and decision theory. (shrink)

It often happens that a binary relation R defined on a topological space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} lacks a continuous utility representation; see, e.g.,. But under an appropriate choice of a second topology τ∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau ^{*}$$\end{document} on \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document}, the existence of a semicontinuous utility representation on the bitopological space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} (...) \begin{document}$$$$\end{document} can be ensured. On the other hand, the traditional notion of weak utility representation as defined by Peleg cannot be used to characterize the generalized optimal choice set, which requires binary relations that allow cycles. The main result in this paper states that for any generalized upper tc-semicontinuous, separable, pairwise spacious and consistent binary relation R defined on a bitopological space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} and any subset D of X, there exists a utility function which characterizes the generalized optimal choice set of R in D in terms of the maxima of this function. (shrink)

Consistency and optimality together with converse consistency provide an illuminating and novel characterization of the equilibrium concept (Peleg and Tijs, 1996). But (together with non-emptiness) they preclude refinements of the equilibrium notion and selection of a unique equilibrium (Norde et al., 1996). We suggest two escape routes: By generalizing the concept of strict equilibrium we question the practical relevance of the existence requirement for refinements. To allow for equilibrium selection we suggest more complex reduced games which capture the inclinations (...) of ``players who already left''. (shrink)