Definable preferences: An example'

Abstract

A preference relation is definable in a language if there is a formula in this language which is satisfied precisely for those pairs which satisfy the relation. The paper suggests that definability is a natural category of requirements of preferences in economic models.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

First-order definability in modal logic.R. I. Goldblatt - 1975 - Journal of Symbolic Logic 40 (1):35-40.
Some characterization and preservation theorems in modal logic.Tin Perkov - 2012 - Annals of Pure and Applied Logic 163 (12):1928-1939.
Direct and local definitions of the Turing jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
Ordinal definability and combinatorics of equivalence relations.William Chan - 2019 - Journal of Mathematical Logic 19 (2):1950009.
Varieties of truth definitions.Piotr Gruza & Mateusz Łełyk - 2024 - Archive for Mathematical Logic 63 (5):563-589.
Hobson’s Conception of Definable Numbers.Zhao Fan - 2020 - History and Philosophy of Logic 41 (2):128-139.
Arithmetic definability by formulas with two quantifiers.Shih Ping Tung - 1992 - Journal of Symbolic Logic 57 (1):1-11.

Analytics

Added to PP
2010-12-22

Downloads
29 (#781,382)

6 months
29 (#119,417)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references