Birkhoffs completeness theorem
Birkhoff's completeness theorem Equational logic is a formal system for reasoning with equations. It has simple rules for manipulating equations, based on the reflexivity, symmetry, transivity of equality and the substitution of equal terms into equations. Birkhoff's completeness theorem says that an equation e is provable in equational logic from the equations in a set E if and only if e is true in all algebras that satisfy the equations in the set E. Related to the theorem is the fact that a class of algebras is definable as the class of all models of some set of equations if and only if the class is closed under constructing subalgebras, homomorphic images, and direct products. These results were proved by G. Birkhoff in 1935. See also equational specification, term rewriting system.
More From encyclopedia.com
Symbolic Logic , Logic, Symbolic
A modern version of formal logic, referred to variously as logistic, mathematical logic, and the algebra of logic; it may be describe… Fuzzy Logic , "Fuzzy logics" are multivalued logics intended to model human reasoning with certain types of imprecision. The field of fuzzy logic originated with a… Logic Circuit , logic circuit An electric circuit concerned with logic systems. The term logic device is often used synonymously. A logic circuit is required to prod… William Hamilton , Hamilton, William
Hamilton, William
Edinburgh, Scotland, 6 May 1856)
philosophy, logic.
Hamilton’s father, William Hamilton, professor of astronomy a… Bertrand Arthur William Russell , Russell, Bertrand Arthur William
RUSSELL, BERTRAND ARTHUR WILLIAM
(b. Trelleck, Monmouthshire, England, 18 May 1872: d. Plas Penrhyn, near Penrhyndeu… Logical , logical •cackle, crackle, grackle, hackle, jackal, mackle, shackle, tackle •ankle, rankle •Gaskell, mascle, paschal •tabernacle • ramshackle •débâcle…
About this article
Birkhoffs completeness theorem
You Might Also Like
NEARBY TERMS
Birkhoffs completeness theorem