free Boolean algebra
minterm
power function
ultrapolynomial
truth function
Boolean variable
polynomial form
dependent variable
switching algebra
exponential generating function
partial
partial derivative
positive logic
independent variable
experimental variable
Boolean logic
multifactorial
Boolean function
Zhegalkin polynomial
implicant
monome
algebraic structure
Boolean algebra
superatomic
polytype
minimum
hypergeometric series
directed
symmetric function
domain
Bell polynomial
polyache
boolean operation
binary operation
facient
constant
domain of a function
binary arithmetic operation
L-fuzzy
homokurtosis
polymorphism
switching function
hardcoded
cross term
prenex
primitive element
number-theoretic function
syzygy
TRUE
nonlinear
enumeration
CBE
recursion theory
denomination
argument
explicit function
raise
subanalytic
range
finite difference
exponential
tribool
bitvector
range of a function
image
in terms of
heterokurtosis
superinvariant
monotone function
gamma function
unity
urelement
Bernoulli number
consensus theorem
parity
n-type
hyperarithmetic
Herbrand function
Boolean derivative
power series
amicable number
pseudonumerical
Touchard polynomial
creative
semicreative
Skolem function
uncountable set
bifunction
adele
Cartesian product
productive
quadratic field
Maharam algebra
binomial coefficient
invariant
real function
ring sum normal form
membership function
L'Hôpital's rule

English words for 'A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are "true" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms.'

As you may have noticed, above you will find words for "A field of sets whose elements are equivalent to Boolean formulas (or, perhaps more precisely, equivalence classes of Boolean formulas). Starting with a set of n variables which are independent of each other and are called generators, the power set of this set has 2ⁿmembers which may be called atoms and are valuations of the n variables: a valuation can be considered to be a set of variables which are "true" under that valuation, or a conjunction of generators (such that variables not included in that set are included in negated form in the equivalent conjunction). Then the power set of the set of atoms yields a set of 2^(2ⁿ) members which are the elements of the said field of sets. These elements correspond to Boolean formulas: a formula can be considered to be a set of valuations which make the formula true, or a linear combination (i.e., a disjunction) of atoms.". Hover the mouse over the word you'd like to know more about to view its definition. Click search related words by phrase or description. to find a better fitting word. Finally, thanks to ChatGPT, the overall results have been greatly improved.

Recent Queries