Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Boolean algebra (disambiguation) (view), Boolean algebra (structure) (view), Boolean algebras canonically defined (view), List of Boolean algebra topics (view), Minimal axioms for Boolean algebra (view), Complete Boolean algebra (view), Two-element Boolean algebra (view), Stone's representation theorem for Boolean algebras (view), Free Boolean algebra (view), Monadic Boolean algebra (view), Residuated Boolean algebra (view), Topological Boolean algebra (view), Inclusion (Boolean algebra) (view)

searching for Boolean algebra 24 found (953 total)

alternate case: boolean algebra

Binary combinatory logic (435 words) [view diff] exact match in snippet view article find links to article

using only the symbols 0 and 1. Using the S and K combinators, complex boolean algebra functions can be made. BCL has applications in the theory of program-size

James Earl Baumgartner (471 words) [view diff] exact match in snippet view article find links to article

forcing axiom, chromatic number of graphs, a thin very-tall superatomic Boolean algebra, closed unbounded sets, and partition relations. Baumgartner's axiom

Richards controller (859 words) [view diff] exact match in snippet view article find links to article

traditional techniques of state diagrams, state-transition tables and Boolean algebra offer. Using Richards's technique, it becomes easier to implement finite-state

Blake canonical form (947 words) [view diff] exact match in snippet view article find links to article

in Boolean algebra". The Journal of Symbolic Logic. 3 (2). Blake, Archie (September 1938). "Corrections to Canonical Expressions in Boolean Algebra". The

Locally finite variety (274 words) [view diff] exact match in snippet view article find links to article

variety of Boolean algebras constitutes a famous example. The free Boolean algebra on n generators has cardinality 22n, consisting of the n-ary operations

Locally finite variety (274 words) [view diff] exact match in snippet view article find links to article

variety of Boolean algebras constitutes a famous example. The free Boolean algebra on n generators has cardinality 22n, consisting of the n-ary operations

Warnier/Orr diagram (1,491 words) [view diff] exact match in snippet view article find links to article

Warnier and in the United States by Kenneth Orr on the foundation of Boolean algebra. This method aids the design of program structures by identifying the

Benjamin Abram Bernstein (1,219 words) [view diff] exact match in snippet view article find links to article

B. A. (1924). "Operations with respect to which the elements of a Boolean algebra form a group". Trans. Amer. Math. Soc. 26 (2): 171–175. doi:10

Arthur Herbert Copeland (394 words) [view diff] exact match in snippet view article find links to article

Harary, Frank (1953). "The extension of an arbitrary Boolean algebra to an implicative Boolean algebra". Proc. Amer. Math. Soc. 4 (5): 751–758. doi:10

CCNF (2,269 words) [view diff] exact match in snippet view article find links to article

CCNF may also mean Canonical conjunctive normal form in Boolean algebra. G2/mitotic-specific cyclin-F is a protein that in humans is encoded by the CCNF

Descending wedge (331 words) [view diff] case mismatch in snippet view article find links to article

and Bertrand Russell. Rueff, Marcel; Jeger, Max (1970). Sets and Boolean Algebra. American Elsevier Publishing Company. ISBN 978-0-444-19751-1. Trappl

Daniele Caramani (1,759 words) [view diff] case mismatch in snippet view article find links to article

methodology, he authored Introduction to the Comparative Method with Boolean Algebra (Sage, Quantitative Applications in the Social Sciences 2009). For

Reuben Goodstein (458 words) [view diff] case mismatch in snippet view article find links to article

logic, London, Logos Press 1971 Complex functions, McGraw Hill 1965 Boolean Algebra, Pergamon Press 1963, Dover 2007 Recursive number theory - a development

Buchberger's algorithm (789 words) [view diff] exact match in snippet view article find links to article

completion algorithm Quine–McCluskey algorithm – analogous algorithm for Boolean algebra Dubé, Thomas W. (1990). "The Structure of Polynomial Ideals and Gröbner

List of theorems called fundamental (553 words) [view diff] exact match in snippet view article find links to article

K-theory Fundamental theorem of arithmetic Fundamental theorem of Boolean algebra Fundamental theorem of calculus Fundamental theorem of calculus for

Elliott Mendelson (662 words) [view diff] case mismatch in snippet view article find links to article

foundational matters." Mendelson, Elliot (1970). Schaum's Outline of Boolean Algebra and Switching Circuits (paperback). Schaum's Outlines. New York: McGraw-Hill

Blackrock, Cork (930 words) [view diff] exact match in snippet view article find links to article

Club and Shandon Rowing Club also nearby. George Boole, inventor of Boolean algebra (the basis of modern computer arithmetic) lived in Ballintemple during

John B. Conway (416 words) [view diff] exact match in snippet view article find links to article

Books Ltd. ISBN 978-0-8218-2184-8. Conway, John B. (1973). "A complete Boolean algebra of subspaces which is not reflexive". Bull. Amer. Math. Soc. 79 (4):

Supervisory control theory (229 words) [view diff] exact match in snippet view article find links to article

system (DEDS) Boolean differential calculus (BDC) – Subject field of Boolean algebra discussing changes of Boolean variables and functions Ramadge, Peter

Subdirect product (770 words) [view diff] exact match in snippet view article find links to article

whole direct power) if and only if L is a complemented lattice, i.e. a Boolean algebra. The same holds for any semilattice when "semilattice" is substituted

Boris Beizer (313 words) [view diff] exact match in snippet view article find links to article

Volume 2; Polish and Russian Editions Engineering applications of Boolean algebra (1958) with Stephen W. Leibholz Novels under pseudonym Ethan I. Shedley

Archie Blake (mathematician) (600 words) [view diff] case mismatch in snippet view article

Chicago. OCLC 43268249. Archie Blake (1938). Canonical Expressions in Boolean Algebra (Ph.D. thesis). University of Chicago. — Review in the Journal of Symbolic

Four-valued logic (1,403 words) [view diff] exact match in snippet view article find links to article

Krystyn; Marczyński, Romuald (1955). "Application of bi-elemental boolean algebra to electronic circuits". Studia Logica. 2: 7–75. doi:10.1007/BF02124765

Quantifier elimination (1,435 words) [view diff] exact match in snippet view article find links to article

groups, random graphs, as well as many of their combinations such as Boolean algebra with Presburger arithmetic, and term algebras with queues. Quantifier