Recursive ordinal

Known as: Computable ordinal, Constructive ordinal 
In mathematics, specifically set theory, an ordinal is said to be recursive if there is a recursive well-ordering of a subset of the natural numbers… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1970-2018
024619702018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Here we describe some results which will be proved in detail in [13] and [l4]. The notion of metarecursive set was introduced in… (More)
Is this relevant?
2003
2003
A question is proposed if a nonrecursive ordinal, the so-called Church-Kleene ordinal ω 1 really exists. We consider the systems… (More)
Is this relevant?
2003
2003
Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals… (More)
Is this relevant?
2000
2000
In order to explain the purpose of this paper, we recall briefly how the theory of “rationality” developed in the last fourty… (More)
Is this relevant?
1996
1996
Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction… (More)
Is this relevant?
1994
1994
In this paper we will show how work of Ash and Love can be used to recover and strengthen the main results of Feiner in [F… (More)
Is this relevant?
1993
1993
In ordinal analysis of impredicative theories so-called collapsing functions are of central importance. Unfortunately, the… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
Four semantics for a small programming language involving unbounded (but countable) nondeterminism are provided. These comprise… (More)
Is this relevant?
1973
1973
The relationship between computational complexity and hierarchies of computable Functions is explored. I t is shown that known… (More)
Is this relevant?
1972
1972
 
Is this relevant?