User blog comment:Emlightened/A Largest Number/@comment-31580368-20180903033927

Usually, the following things are conventionally compared: FOA(n) = fω1CK(n), where FOA - the smallest positive integer bigger than any finite positive integer named by an expression in the language of first order arithmetic with n symbols or less. Does this mean that we can conditionally compare the following things:

SOA(n) = fβ(n), where SOA - ... language of second order arithmetic... and β is Lβ ⊨ ZFC- (2.17 in Madore's Zoo of ordinals)

FOST(n) = fβ(n), where FOST - ... language of first order set theory... and β is Lβ ⊨ ZFC (2.24 in Madore's Zoo of ordinals)

SOST(n) = fβ(n), where SOST - ... language of second order set theory... and β is Lβ ⊨ MK

LittlePeng9's FOOT(n), Deedlit11's FOFTab(n), Little Bigeddon are equivalent fβ(n), where β is Lβ ⊨ ZFC+correct cardinals

Big Bigeddon are equivalent fβ(n), where β is Lβ ⊨ ZFC+???

This number are equivalent fβ(n), where β is Lβ ⊨ ZFC+WA0