Publication:1072545: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 00:10, 31 January 2024
DOI10.1016/0165-4896(85)90038-1zbMATH Open0587.03035OpenAlexW1514705400MaRDI QIDQ1072545FDOQ1072545
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
Turing machinesChurch's thesisrecursive realizabilitydemand correspondencesKleene-Mostowski arithmetic hierarchyrecursive metric spacerecursive space of alternativesrecursive unsolvabilityrecursively presented modelsrecursively rational choice function
Decision theory (91B06) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Social choice and individual values
- The axiom of choice
- Transversal theory. An account of some aspects of combinatorial mathematics
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Some Generic Properties of Aggregate Excess Demand and an Application
- Recursively enumerable sets and degrees
- Hilbert's Tenth Problem is Unsolvable
- The upper semi-lattice of degrees of recursive unsolvability
- Some Stone spaces and recursion theory
- Recursive Real Numbers
- Recursive metric spaces
- Social Decision Functions and the Veto
- On some games which are relevant to the theory of recursively enumerable sets
- The Existence of Choice Functions
- Degrees of Computability
- Classes of Predictably Computable Functions
- Utility theory based on rational probabilities
- The metalogic of economic predictions, calculations and propositions
- The complexity of economic decision rules
- Realization of Choice Functions
- Complexity of games and bounded rationality
- The generation of a social welfare function under ordinal preferences
- \(\lambda\)-definability and recursiveness
- A topological analog to the Rice-Shapiro index theorem
- Recursive Functions and Hierarchies
Cited In (19)
- Microeconomic foundations of cyclical irregularities or chaos
- Arrow's theorem, countably many agents, and more visible invisible dictators
- Production of Ideas by Means of Ideas: A Turing Machine Metaphor
- Title not available (Why is that?)
- Choice and complexity
- Rights and Decentralized Computation
- Computable preference and utility
- Rationality and bounded rationality
- Expository notes on computability and complexity in (arithmetical) games
- Effective Choice and Boundedness Principles in Computable Analysis
- On the independence of core-equivalence results from Zermelo-Fraenkel set theory
- Lower bounds on degrees of game-theoretic structures
- The computational difficulty of manipulating an election
- 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
- Effective choice functions and index sets
- The minimum degree of recursively representable choice functions
- Non-computable rational expectations equilibria
- ECONOPHYSICS AND ECONOMIC COMPLEXITY
This page was built for publication: On effectively computable realizations of choice functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072545)