2 pages matching natural numbers in this book
Results 1-2 of 2
What people are saying - Write a review
We haven't found any reviews in the usual places.
Definitions and some basic facts
The uniform regular set theorem in recursion
3 other sections not shown
0therwise 3-finite a-recursive according to Theorem admissible collapse admissible ordinals Ann.Math.Logic Assume attention at step characteristic function choose cofinal function computation consider constructible sets contains contradiction define definition e-fixpoint element equivalence fact finite fixpoint formula function f G.E. Sacks greatest hyperregular implies incomplete non-hyperregular ot-r.e. induction hypothesis initial segment isomorphic Lemma limit ordinal maps minimal pairs model theory natural numbers negative neighborhood non-hyperregular ot-r.e. degrees notion order type less ordinary recursion theory ot-degree ot-finite ot-r.e. degrees exist ot-r.e. set ot-recursively enumerable set Post's Problem predicate priority list projectum proof of Theorem properties R.A. Shore r.e. set r1cf r2cf recieves attention recursive function recursive projection recursive set recursively enumerable degrees recursively enumerable sets regular set theorem satisfy set H splitting theorem strategy strongly inadmissible tp ft Turing machine unbounded uniformization theorem weakly inadmissible structures weakly recursive write x-card(K