Arrow-Sen theory simplified
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866917639111049216 |
|---|---|
| author | Boričić, Branislav |
| author_facet | Boričić, Branislav |
| contents | The traditional Arrow--Sen Social Choice Theory $\bf{TSCT}$ is a mathematical theory built apparently on higher--order formal language. In this paper, we propose a reformulation and reclassification of the $\bf{TSCT}$ axioms in order to obtain a simpler theory based on the first--order language axioms, keeping the spirit of original ideas. This new theory, called Simplified Social Choice Theory, denoted by $\bf{SSCT}$, presents a sub--theory of $\bf{TSCT}$. Roughly speaking, we extract all quatifications over $n$--tuples of binary relations from the axioms of $\bf{TSCT}$ and move them to the meta--level obtaining a sub--theory $\bf{SSCT}$ of $\bf{TSCT}$. More accurately, we assign to each traditional higher--order axiom $\bf{TA}$ its simplified first--order version $\bf{SA}$ such that $\bf{TA}\vdash\bf{SA}$, i.e. $\bf{SA}$ can be logically derived from $\bf{TA}$. In this way we define a simpler and more accessible set of principles that provide a context in which we can prove many propositions analogous to well--known theorems including the Arrow's impossibility of Paretian non--dictatorship and Sen's impossibility of Paretian liberal. These simplifications are the result of decades of lecturing by the author with the aim of bridging the barriers between this beautiful complex theory and his students. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_09018 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Arrow-Sen theory simplified Boričić, Branislav Logic 03B10 03B30 91B14 91B02 91B08 91B10 The traditional Arrow--Sen Social Choice Theory $\bf{TSCT}$ is a mathematical theory built apparently on higher--order formal language. In this paper, we propose a reformulation and reclassification of the $\bf{TSCT}$ axioms in order to obtain a simpler theory based on the first--order language axioms, keeping the spirit of original ideas. This new theory, called Simplified Social Choice Theory, denoted by $\bf{SSCT}$, presents a sub--theory of $\bf{TSCT}$. Roughly speaking, we extract all quatifications over $n$--tuples of binary relations from the axioms of $\bf{TSCT}$ and move them to the meta--level obtaining a sub--theory $\bf{SSCT}$ of $\bf{TSCT}$. More accurately, we assign to each traditional higher--order axiom $\bf{TA}$ its simplified first--order version $\bf{SA}$ such that $\bf{TA}\vdash\bf{SA}$, i.e. $\bf{SA}$ can be logically derived from $\bf{TA}$. In this way we define a simpler and more accessible set of principles that provide a context in which we can prove many propositions analogous to well--known theorems including the Arrow's impossibility of Paretian non--dictatorship and Sen's impossibility of Paretian liberal. These simplifications are the result of decades of lecturing by the author with the aim of bridging the barriers between this beautiful complex theory and his students. |
| title | Arrow-Sen theory simplified |
| topic | Logic 03B10 03B30 91B14 91B02 91B08 91B10 |
| url | https://arxiv.org/abs/2404.09018 |