[permalink] [id link]
** Hebrew: hebrewbooks. org ( volume 1 ; others available via search on site )
from
Wikipedia
Some Related Sentences
** and Hebrew
** י ְ הו ֹ ש ֻׁ ע ַ Yehoshua – Joshua ( Hebrew – English at Mechon-Mamre. org, Jewish Publication Society translation )
** Laments ( R. David Seidenberg ): a fresh translation with linear Hebrew and English, on neohasid. org
** Obadiah, from the United Church of God, an International Association Bible Reading Program-This Hebrew scholar provides extensive background information as well as verse-by-verse exposition
** and hebrewbooks
** 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.
0.122 seconds.