Publication:5518362

zbMath0143.01303MaRDI QIDQ5518362

Yiannis N. Moschovakis

Publication date: 1965

Full work available at URL: http://www.numdam.org/item?id=CM_1965-1966__17__40_0

zbMATH Keywords

mathematical logic

Related Items

Stability for Effective Algebras, Semi-effective numberings and definitions of the computable numbers, Domain representability of metric spaces, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, On effectively computable realizations of choice functions, 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, Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, Computable preference and utility, Stability of representations of effective partial algebras, Computability and Noncomputability in Classical Analysis, A Real Number Structure that is Effectively Categorical

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The constructivity of maximal dual ideals in certain Boolean algebras
• The upper semi-lattice of degrees of recursive unsolvability
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Effective operations on partial recursive functions
• Effective procedures in field theory
• Computable Algebra, General Theory and Theory of Computable Fields
• Recursive metric spaces
• Recursive Real Numbers
• Recursively enumerable sets of positive integers and their decision problems