OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Moschovakis coding lemma

 Home Mathematics Fields of mathematics Foundations of mathematics Theorems in the foundations of mathematics Lemmas in set theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Moschovakis coding lemma is a result in mathematical logic, particularly in the area of recursion theory and effective descriptive set theory. It is named after Yiannis N. Moschovakis, who made significant contributions to these fields. The lemma is concerned with the concept of **coding sets of natural numbers** using **recursive (or computable) functions**.

 Ancestors (6)

  1. Lemmas in set theory
  2. Theorems in the foundations of mathematics
  3. Foundations of mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook