Abstract:In this note is proved the following: Theorem. Iƒ A × B is universal and one oƒ A, B is r.e. then one of A, B is universal . Let α, τ be 1-argument recursive functions such that x goes to ( σ(χ), τ(χ)...In this note is proved the following: Theorem. Iƒ A × B is universal and one oƒ A, B is r.e. then one of A, B is universal . Let α, τ be 1-argument recursive functions such that x goes to ( σ(χ), τ(χ) ) is a (1–1) map of the natural numbers onto all ordered pairs of natural numbers. A set A of natural numbers is called universal if every r.e. set is (many-one) reducible to A; A × B is called universal if the setRead More
Publication Year: 1966
Publication Date: 1966-12-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 31
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot