Definitions from Wikipedia (Ordinal collapsing function)
▸ noun: In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals (though they can be replaced with recursively large ordinals at the cost of extra technical difficulty), and then "collapse" them down to a system of notations for the sought-after ordinal.
▸ Words similar to Ordinal collapsing function
▸ Usage examples for Ordinal collapsing function
▸ Idioms related to Ordinal collapsing function
▸ Wikipedia articles (New!)
▸ Words that often appear near Ordinal collapsing function
▸ Rhymes of Ordinal collapsing function
▸ Invented words related to Ordinal collapsing function
▸ noun: In mathematical logic and set theory, an ordinal collapsing function (or projection function) is a technique for defining (notations for) certain recursive large countable ordinals, whose principle is to give names to certain ordinals much larger than the one being defined, perhaps even large cardinals (though they can be replaced with recursively large ordinals at the cost of extra technical difficulty), and then "collapse" them down to a system of notations for the sought-after ordinal.
▸ Words similar to Ordinal collapsing function
▸ Usage examples for Ordinal collapsing function
▸ Idioms related to Ordinal collapsing function
▸ Wikipedia articles (New!)
▸ Words that often appear near Ordinal collapsing function
▸ Rhymes of Ordinal collapsing function
▸ Invented words related to Ordinal collapsing function