Transactions of the American Mathematical Society · 1974 · 24 citations · 19 references
Natural SciencesComputer ScienceMathematicsAlgebraPhilosophy Of MathematicsSet TheoryAxiomatic Set TheoryOrdinal NumbersRecursion TheoryAdmissible OrdinalsAdmissible Recursion TheoryAdmissible SetsRecursion
Various generalizations of maximal sets from ordinary recursion theory to recursion theory on admissible ordinals are considered. A justification is given for choosing one of these definitions as superior to the rest. For all the definitions considered to be reasonable, a necessary and sufficient condition for the existence of such maximal <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="alpha"> <mml:semantics> <mml:mi> α </mml:mi> <mml:annotation encoding="application/x-tex">\alpha</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -r.e. sets is obtained.
19
Theory of Recursive Functions and Effective Computability
D. C. Cooper · The Computer Journal · 1969 · 2.6K citations · Full text
The fine structure of the constructible hierarchy
Ronald Björn Jensen · Annals of Mathematical Logic · 1972 · 681 citations