scientific article; zbMATH DE number 3230252

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

mathematical logic

Related Items (14)

Semi-effective numberings and definitions of the computable numbers ⋮ Lower bounds on degrees of game-theoretic structures ⋮ Some results related to the continuity problem ⋮ Computability and Noncomputability in Classical Analysis ⋮ Computable preference and utility ⋮ Stability of representations of effective partial algebras ⋮ Domain representability of metric spaces ⋮ On Turing degrees of Walrasian models and a general impossibility result in the theory of decision-making ⋮ Stability for Effective Algebras ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ A Real Number Structure that is Effectively Categorical ⋮ On effectively computable realizations of choice functions

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

This page was built for publication: