Scholarlink

In this section, we investigate the Type II version of computable categoricity, known as relative computable categoricity, focusing on discrete countable algebraic structures. The reader will notice parallels with our treatment of Type 2 computability in Chapter 2, particularly the Kreisel- Lacombe-Shoenfield-Markov Theorem 2.3.7 and Specker’s Theorem 2.3.24. We will extend this general methodology to Polish spaces in the following section.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Computable categoricity and computable dimension

  • 章节

  • 发表日期：

    2026年

查看全文
  • Rodney G. Downey,
  • Alexander Melnikov

摘要

In this section, we investigate the Type II version of computable categoricity, known as relative computable categoricity, focusing on discrete countable algebraic structures. The reader will notice parallels with our treatment of Type 2 computability in Chapter 2, particularly the Kreisel- Lacombe-Shoenfield-Markov Theorem 2.3.7 and Specker’s Theorem 2.3.24. We will extend this general methodology to Polish spaces in the following section.