Combinatorial Functions and Indecomposable Cardinals

Erik Ellentuck · Proceedings of the American Mathematical Society · 1976

Combinatorial functions are used to replace indecomposable cardinals in certain types of set theoretic arguments. This allows us to extend decidability results from nonchoice set theories to set theories with a principle of linear ordering.

Read the paper · More papers on PaperTik