[permalink] [id link]
** Telephos u. Troilos ( 1841 )
from
Wikipedia
Some Related Sentences
** and u
** Estonian puu " tree, wood " ( singular ) – puu < u > d </ u > " the trees, woods " ( nominative plural )
** Finnish: lehmä " cow, the cow " ( singular ) – lehmä < u > t </ u > " the cows " ( nominative plural )
** Sanskrit puruṣ < u > as </ u > " man " ( singular ) – puruṣ < u > au </ u > " two men " ( dual ) – puruṣ < u > ās </ u > " men " ( plural )
** Swahili: < u > m </ u > toto " child " ( singular ) – < u > wa </ u > toto " children " ( plural )
** Georgian: კაცი k ' aci " man " ( singular ) – კაცები k ' ac < u > eb </ u > i " men " ( where-i is the nominative case marker )
** Arabic: ك ِ ت َ اب k < u > i </ u > t < u > ā </ u > b " book " ( singular ) – ك ُ ت ُ ب k < u > u </ u > t < u > u </ u > b " books " ( plural )
** and .
** Eunectes murinus, the green anaconda, the largest species, is found east of the Andes in Colombia, Venezuela, the Guianas, Ecuador, Peru, Bolivia, Brazil and on the island of Trinidad.
** Eunectes notaeus, the yellow anaconda, a smaller species, is found in eastern Bolivia, southern Brazil, Paraguay and northeastern Argentina.
** Eunectes deschauenseei, the dark-spotted anaconda, is a rare species found in northeastern Brazil and coastal French Guiana.
** Eunectes beniensis, the Bolivian anaconda, the most recently defined species, is found in the Departments of Beni and Pando in Bolivia.
** Tarski's theorem: For every infinite set A, there is a bijective map between the sets A and A × A.
** Trichotomy: If two sets are given, then either they have the same cardinality, or one has a smaller cardinality than the other.
** König's theorem: Colloquially, the sum of a sequence of cardinals is strictly less than the product of a sequence of larger cardinals.
** Zorn's lemma: Every non-empty partially ordered set in which every chain ( i. e. totally ordered subset ) has an upper bound contains at least one maximal element.
** Hausdorff maximal principle: In any partially ordered set, every totally ordered subset is contained in a maximal totally ordered subset.
** Tukey's lemma: Every non-empty collection of finite character has a maximal element with respect to inclusion.
** In the product topology, the closure of a product of subsets is equal to the product of the closures.
** If S is a set of sentences of first-order logic and B is a consistent subset of S, then B is included in a set that is maximal among consistent subsets of S. The special case where S is the set of all first-order sentences in a given signature is weaker, equivalent to the Boolean prime ideal theorem ; see the section " Weaker forms " below.
** and 1841
0.444 seconds.