✦ LIBER ✦

Lower Bounds for Pairs of Recursively Enumerable Degrees.by A. H. Lachlan

✍ Scribed by Review by: Carl G. Jockusch, Jr.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds for Pairs of Recursively En

✍ Lachlan, A. H. 📂 Article 📅 1966 🏛 Oxford University Press 🌐 English ⚖ 719 KB

The Impossibility of Finding Relative Co

✍ Review by: Gerald E. Sacks 📂 Article 📅 1971 🏛 Association for Symbolic Logic 🌐 English ⚖ 333 KB

Simplicity of Recursively Enumerable Set

✍ Review by: James C. Owings, Jr 📂 Article 📅 1970 🏛 Association for Symbolic Logic 🌐 English ⚖ 448 KB

On Some Games which are Relevant to the

✍ Review by: Gregory W. Jones 📂 Article 📅 1974 🏛 Association for Symbolic Logic 🌐 English ⚖ 211 KB

On the Indexing of Classes of Recursivel

✍ A. H. Lachlan 📂 Article 📅 1966 🏛 Association for Symbolic Logic 🌐 English ⚖ 1000 KB

Recursively Enumerable Classes and Their

✍ Review by: James C. Owings, Jr. 📂 Article 📅 1973 🏛 Association for Symbolic Logic 🌐 English ⚖ 338 KB