The minimum degree of recursively representable choice functions

DOI10.1016/0165-4896(85)90034-4zbMath0587.03036OpenAlexW2066269251MaRDI QIDQ1072546

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)90034-4

zbMATH Keywords

Church's thesisTuring degrees of unsolvabilityKleene-Mostowski hierarchyrecursive real numbersTuring complexityrecursive metric spacerecursive space of alternativesrecursively rational choice function

Mathematics Subject Classification ID

Decision theory (91B06) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)

Related Items

Lower bounds on degrees of game-theoretic structures ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ On the independence of core-equivalence results from Zermelo-Fraenkel set theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On effectively computable realizations of choice functions
• Utility theory based on rational probabilities
• The Turing degree of the inherent ambiguity problem for context-free languages
• The upper semi-lattice of degrees of recursive unsolvability
• Recursive Predicates and Quantifiers
• Recursively enumerable sets of positive integers and their decision problems