Premium
Uncountable Gandy Ordinals
Author(s) -
Abramson F. G.,
Sacks G. E.
Publication year - 1976
Publication title -
journal of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.441
H-Index - 62
eISSN - 1469-7750
pISSN - 0024-6107
DOI - 10.1112/jlms/s2-14.3.387
Subject(s) - uncountable set , citation , computer science , library science , combinatorics , mathematics , countable set
Let a be a Ej admissible ordinal; that is to say L(a), Godel's constructible universe restricted to sets constructed via ordinals less than a, satisfies Hl replacement. Suppose R is an a-recursive (same as At over L(a)) wellordering of a subset of a. Clearly the order type of R is less than a, the least S^ admissible ordinal greater than a. We say that a is Gandyt if every ordinal less than