Switch to: References

Citations of:

Ranking judgments in Arrow’s setting

Synthese 173 (2):199-210 (2010)

Add citations

You must login to add citations.
  1. Judgment Aggregation in Nonmonotonic Logic.Xuefeng Wen - 2018 - Synthese 195 (8):3651-3683.
    Judgment aggregation studies how to aggregate individual judgments on logically correlated propositions into collective judgments. Different logics can be used in judgment aggregation, for which Dietrich and Mongin have proposed a generalized model based on general logics. Despite its generality, however, all nonmonotonic logics are excluded from this model. This paper argues for using nonmonotonic logic in judgment aggregation. Then it generalizes Dietrich and Mongin’s model to incorporate a large class of nonmonotonic logics. This generalization broadens the theoretical boundaries of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Natural Deduction for Modal Logic of Judgment Aggregation.Tin Perkov - 2016 - Journal of Logic, Language and Information 25 (3-4):335-354.
    We can formalize judgments as logical formulas. Judgment aggregation deals with judgments of several agents, which need to be aggregated to a collective judgment. There are several logical formalizations of judgment aggregation. This paper focuses on a modal formalization which nicely expresses classical properties of judgment aggregation rules and famous results of social choice theory, like Arrow’s impossibility theorem. A natural deduction system for modal logic of judgment aggregation is presented in this paper. The system is sound and complete. As (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Lifting Integrity Constraints in Binary Aggregation.Umberto Grandi & Ulle Endriss - 2013 - Artificial Intelligence 199:45-66.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Complexity of Judgment Aggregation.Ulle Endriss, Umberto Grandi & Daniele Porello - 2012 - Journal of Artificial Intelligence Research 45:481--514.
    We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Single-Peakedness and Semantic Dimensions of Preferences.Daniele Porello - 2016 - Logic Journal of the IGPL 24 (4).
    Among the possible solutions to the paradoxes of collective preferences, single-peakedness is significant because it has been associated to a suggestive conceptual interpretation: a single-peaked preference profile entails that, although individuals may disagree on which option is the best, they conceptualize the choice along a shared unique dimension, i.e. they agree on the rationale of the collective decision. In this article, we discuss the relationship between the structural property of singlepeakedness and its suggested interpretation as uni-dimensionality of a social choice. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • An Intuitionistic Logic for Preference Relations.Paolo Maffezioli & Alberto Naibo - 2019 - Logic Journal of the IGPL 27 (4):434-450.
    We investigate in intuitionistic first-order logic various principles of preference relations alternative to the standard ones based on the transitivity and completeness of weak preference. In particular, we suggest two ways in which completeness can be formulated while remaining faithful to the spirit of constructive reasoning, and we prove that the cotransitivity of the strict preference relation is a valid intuitionistic alternative to the transitivity of weak preference. Along the way, we also show that the acyclicity axiom is not finitely (...)
    Download  
     
    Export citation  
     
    Bookmark