On notation for ordinal numbers

Author:

Kleene S. C.

Abstract

Consider a system of formal notations for ordinal numbers in the first and second number classes, with the following properties. Given a notation for an ordinal, it can be decided effectively whether the ordinal is zero, or the successor of an ordinal, or the limit of an increasing sequence of ordinals. In the second case, a notation for the preceding ordinal can be determined effectively. In the third case, notations for the ordinals of an increasing sequence of type ω with the given ordinal as limit can be determined effectively.Are there systems of this sort which extend farthest into the second number class? When the conditions for the systems have been made precise, the question will be answered in the affirmative. There is an ordinal ω1in the second number class such that there are systems of notations of the sort described which extend to all ordinals less than ω1, but none in which ω1itself is assigned a notation.1. An effective or constructive operation on the objects of an enumerable class is one for which a fixed set of instructions can be chosen such that, for each of the infinitely many objects (orn-tuples of objects), the operation can be completed by a finite process in accordance with the instructions. This notion is made exact by specifying the nature of the process and set of instructions. It appears possible to do so without loss of generality.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference8 articles.

1. An Unsolvable Problem of Elementary Number Theory

2. On computable numbers, with an application to the Entscheidungsproblem;Turing;Proceedings of the London Mathematical Society,1936

3. λ-definability and recursiveness

4. Formal definitions in the theory of ordinal numbers;Church;Fundamenta mathematicae,1936

Cited by 434 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A probabilistic analysis of selected notions of iterated conditioning under coherence;International Journal of Approximate Reasoning;2024-02

2. The Genesis of Mix: Early Days of Self-Applicable Partial Evaluation (Invited Contribution);Proceedings of the 2024 ACM SIGPLAN International Workshop on Partial Evaluation and Program Manipulation;2024-01-11

3. Strictly Monotone Brouwer Trees for Well Founded Recursion over Multiple Arguments;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

4. Argument-based inductive logics, with coverage of compromised perception;Frontiers in Artificial Intelligence;2024-01-08

5. A survey on uncertainty reasoning and quantification in belief theory and its application to deep learning;Information Fusion;2024-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3