阿尔法(金融)
不相交集
语域(社会语言学)
组合数学
计算机科学
离散数学
班级(哲学)
算术
数学
人工智能
统计
语言学
结构效度
哲学
心理测量学
标识
DOI:10.1007/978-3-031-36978-0_7
摘要
For exponentially closed ordinals $$\alpha $$ , we consider recognizability of constructible subsets of $$\alpha $$ for weak and strong $$\alpha $$ -register machines ( $$\alpha $$ -(w)ITRMs) with parameters and their distribution in the constructible hierarchy. In particular, we show that, for class many values of $$\alpha $$ , the sets of $$\alpha $$ -wITRM-computable and $$\alpha $$ -wITRM-recognizable subsets of $$\alpha $$ are both non-empty, but disjoint, and, also for class many values of $$\alpha $$ , the set of $$\alpha $$ -wITRM-recognizable subsets of $$\alpha $$ is empty. (We thank our three anonymous referees for their valuable comments.)
科研通智能强力驱动
Strongly Powered by AbleSci AI