On effectively computable realizations of choice functions

DOI10.1016/0165-4896(85)90038-1zbMath0587.03035OpenAlexW1514705400MaRDI QIDQ1072545

Alain A. Lewis

Publication date: 1985

Published in: Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-4896(85)90038-1

zbMATH Keywords

Church's thesisTuring machinesrecursive realizabilitydemand correspondencesKleene-Mostowski arithmetic hierarchyrecursive metric spacerecursive space of alternativesrecursive unsolvabilityrecursively presented modelsrecursively rational choice function

Mathematics Subject Classification ID

Decision theory (91B06) Recursive functions and relations, subrecursive hierarchies (03D20) Computable structure theory, computable model theory (03C57) Turing machines and related notions (03D10) Theory of numerations, effectively presented structures (03D45)

Related Items (16)

Non-computable rational expectations equilibria ⋮ Microeconomic foundations of cyclical irregularities or chaos ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Rationality and bounded rationality ⋮ Expository notes on computability and complexity in (arithmetical) games ⋮ Arrow's theorem, countably many agents, and more visible invisible dictators ⋮ Computable preference and utility ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games ⋮ Production of Ideas by Means of Ideas: A Turing Machine Metaphor ⋮ Rights and Decentralized Computation ⋮ Choice and complexity ⋮ ECONOPHYSICS AND ECONOMIC COMPLEXITY ⋮ On the independence of core-equivalence results from Zermelo-Fraenkel set theory ⋮ The computational difficulty of manipulating an election ⋮ The minimum degree of recursively representable choice functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Utility theory based on rational probabilities
• The generation of a social welfare function under ordinal preferences
• The metalogic of economic predictions, calculations and propositions
• The complexity of economic decision rules
• On some games which are relevant to the theory of recursively enumerable sets
• Transversal theory. An account of some aspects of combinatorial mathematics
• Some Stone spaces and recursion theory
• \(\lambda\)-definability and recursiveness
• The upper semi-lattice of degrees of recursive unsolvability
• Complexity of games and bounded rationality
• Degrees of Computability
• Classes of Predictably Computable Functions
• A topological analog to the Rice-Shapiro index theorem
• Social Decision Functions and the Veto
• Some Generic Properties of Aggregate Excess Demand and an Application
• The Existence of Choice Functions
• Realization of Choice Functions
• Recursively enumerable sets and degrees
• Hilbert's Tenth Problem is Unsolvable
• Recursive metric spaces
• Recursive Functions and Hierarchies
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Recursive Real Numbers
• The axiom of choice

This page was built for publication: On effectively computable realizations of choice functions