Mathematical Logic II
Dag Normann · 2005
ion, 126 Ackermann, 62, 92, 94, 95 ackermann branches, 62 algebraic completion of an ordered field, 27 algebraic concept, 11 algebraically closed fields, 19 application, 126 arithmetical hierarchy, 118 associate, 107 asymptotic probability, 49 binary tree, 73 bounded complete, 129 branch in a tree, 117 c.e., 69 c.e. degrees, 88 cantor normal form, 94 categorical, 17 characteristic function, 59 characteristic of a field, 19 Church, 58 Church-Turing Thesis, 57 code for a set, 139 collecting trees, 86 complete open description, 46 complete set of formulas, 29 complete theory, 13 computable function, 63 computable functional, 104 computable functional of type 2, 80 computable ordinal, 140 computable set, 63 computable structure, 138 computable tree, 73 computably enumerable, 69 computably enumerable set, 69 computably inseparable sets, 72 computably separable sets, 72 computation tree, 65, 117 computations relative to functionals, 109