Wikipedia has an article on: <span class="searchmatch">Veblen's</span> <span class="searchmatch">theorem</span> Wikipedia Introduced by Oswald <span class="searchmatch">Veblen</span> in 1912. <span class="searchmatch">Veblen's</span> <span class="searchmatch">theorem</span> (graph theory) A <span class="searchmatch">theorem</span> stating that the set of...
Varignon's <span class="searchmatch">theorem</span> <span class="searchmatch">Veblen's</span> <span class="searchmatch">theorem</span> Vinogradov's <span class="searchmatch">theorem</span> virial <span class="searchmatch">theorem</span> Vitali-Carathéodory <span class="searchmatch">theorem</span> Weierstrass-Lindemann <span class="searchmatch">theorem</span> Whitney's <span class="searchmatch">theorem</span> Wick's...
ordinal, being the countable union of countable sets. By the <span class="searchmatch">Veblen</span> fixed-point <span class="searchmatch">theorem</span>, the class of epsilon numbers is unbounded. 1981, The Journal...