Natural deduction for modal logic of judgment aggregation
| Autor: | Tin Perkov |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2016 |
| Předmět: |
Linguistics and Language
Judgment Natural deduction Computer Science::Information Retrieval 010102 general mathematics Modal logic Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) 06 humanities and the arts 0603 philosophy ethics and religion 01 natural sciences Arrow's impossibility theorem Formal proof Philosophy natural deduction modal logic judgment aggregation social choice Modal TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Computer Science::Logic in Computer Science 060302 philosophy Computer Science (miscellaneous) Arrow 0101 mathematics Mathematical economics Social choice theory Algorithm Mathematics |
| DOI: | 10.1007/s10849-016-9235-x |
| Popis: | We can formalize judgments as (consistent sets of) 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 an example of derivation, a formal proof of Arrow's impossibility theorem is given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|