finitely many
Смотреть что такое "finitely many" в других словарях:
Finitely generated module — In mathematics, a finitely generated module is a module that has a finite generating set. Equivalently, it is a homomorphic image of a free module on finitely many generators. The kernel of this homomorphism need not be finitely generated (then… … Wikipedia
Finitely-generated module — In mathematics, a finitely generated module is a module that has a finite generating set. A finitely generated R module also may be called a finite R module or finite over R.[1] Related concepts include finitely cogenerated modules, finitely… … Wikipedia
Finitely-generated abelian group — In abstract algebra, an abelian group (G,+) is called finitely generated if there exist finitely many elements x1,...,xs in G such that every x in G can be written in the form x = n1x1 + n2x2 + ... + nsxs with integers n1,...,ns. In this case, we … Wikipedia
Finitely generated abelian group — In abstract algebra, an abelian group ( G ,+) is called finitely generated if there exist finitely many elements x 1,..., x s in G such that every x in G can be written in the form : x = n 1 x 1 + n 2 x 2 + ... + n s x s with integers n 1,..., n… … Wikipedia
Many-valued logic — In logic, a many valued logic (also multi or multiple valued logic) is a propositional calculus in which there are more than two truth values. Traditionally, in Aristotle s logical calculus, there were only two possible values (i.e., true and… … Wikipedia
finitely — adverb with a finite limit there are finitely many solutions to this problem • Ant: ↑infinitely • Derived from adjective: ↑finite … Useful english dictionary
Finitely generated algebra — In mathematics, a finitely generated algebra is an associative algebra A over a field K such that every element of A can be expressed as a polynomial in a finite set of elements a 1, hellip;, a n of A , with coefficients in K . If it is necessary … Wikipedia
Limit superior and limit inferior — In mathematics, the limit inferior (also called infimum limit, liminf, inferior limit, lower limit, or inner limit) and limit superior (also called supremum limit, limsup, superior limit, upper limit, or outer limit) of a sequence can be thought… … Wikipedia
Paracompact space — In mathematics, a paracompact space is a topological space in which every open cover admits a locally finite open refinement. Paracompact spaces are sometimes also required to be Hausdorff. Paracompact spaces were introduced by Dieudonné (1944).… … Wikipedia
König's lemma — or König s infinity lemma is a theorem in graph theory due to Dénes Kőnig (1936). It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated… … Wikipedia
Word problem for groups — In mathematics, especially in the area of abstract algebra known as combinatorial group theory, the word problem for a recursively presented group G is the algorithmic problem of deciding whether two words represent the same element. Although it… … Wikipedia
