Searcharxiv⌕ Search

arXiv subjects

Yiannis N. Moschovakis

Publications and source records attributed to Yiannis N. Moschovakis.

2 recordsLinked to original sources

The strong Spector-Gandy Theorem for the higher analytical pointclasses

Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire space $N^N$ and for every n, if $P$ is a $Π^1_{2n+1}$ subset of $X$, then there is a $Π^1_{2n}$ set $Q$ such that $P(x) \Longleftrightarrow (\exists!α)Q(x,α) \Longleftrightarrow (\existsα\inΔ^1_{2n+1}(x))Q(x,α)$.

math.LO↗

Elementary recursive algorithms

They run our lives, if you believe the hype in the news, but there is no precise definition of "algorithms" which is generally accepted by the mathematicians, logicians and computer scientists who create and study them. My main aims here are (first) to discuss briefly and point to the few publications that try to deal with this foundational question and (primarily) to outline in Sections 4 and 5 simple proofs of two basic mathematical results about the "elementary recursive algorithms" from specified primitives expressed by recursive (McCarthy) programs.

math.LO↗