sufficient algebra

См. также в других словарях:

• Algebra over a field — This article is about a particular kind of vector space. For other uses of the term algebra , see algebra (disambiguation). In mathematics, an algebra over a field is a vector space equipped with a bilinear vector product. That is to say, it is… …   Wikipedia

• algebra — /al jeuh breuh/, n. 1. the branch of mathematics that deals with general statements of relations, utilizing letters and other symbols to represent specific sets of numbers, values, vectors, etc., in the description of such relations. 2. any of… …   Universalium

• Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… …   Wikipedia

• Necessary and sufficient condition — This article is about the formal terminology in logic. For causal meanings of the terms, see Causality. In logic, the words necessity and sufficiency refer to the implicational relationships between statements. The assertion that one statement is …   Wikipedia

• Variety (universal algebra) — This article is about a class of algebraic structures of the same signature. For the set of solutions to a system of polynomial equations, see Algebraic variety. In mathematics, specifically universal algebra, a variety of algebras is the class… …   Wikipedia

• Canonical form (Boolean algebra) — In Boolean algebra, any Boolean function can be expressed in a canonical form using the dual concepts of minterms and maxterms. Minterms are called products because they are the logical AND of a set of variables, and maxterms are called sums… …   Wikipedia

• Exterior algebra — In mathematics, the exterior product or wedge product of vectors is an algebraic construction generalizing certain features of the cross product to higher dimensions. Like the cross product, and the scalar triple product, the exterior product of… …   Wikipedia

• Heyting algebra — In mathematics, Heyting algebras are special partially ordered sets that constitute a generalization of Boolean algebras, named after Arend Heyting. Heyting algebras arise as models of intuitionistic logic, a logic in which the law of excluded… …   Wikipedia

• Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… …   Wikipedia

• C*-algebra — C* algebras (pronounced C star ) are an important area of research in functional analysis, a branch of mathematics. The prototypical example of a C* algebra is a complex algebra A of linear operators on a complex Hilbert space with two additional …   Wikipedia

• Boolean algebra (logic) — For other uses, see Boolean algebra (disambiguation). Boolean algebra (or Boolean logic) is a logical calculus of truth values, developed by George Boole in the 1840s. It resembles the algebra of real numbers, but with the numeric operations of… …   Wikipedia