is a finite combination of symbols that is well-defined according to rules that depend on the context.

(a)  

correct arrangement of mathematical symbols to represent the object of interest, does not contain a complete thought, and cannot be determined if it is true or false.

(a)  

a statement about two expressions, either using numbers, variables, or a combination of both.

(a)  

is a fact, name, notation, or usage which is generally agreed upon by mathematicians.

(a)  

is the branch of mathematics that studies sets or the mathematical science of the infinite.

(a)  

is a well-defined collection of objects.

(a)  

The elements of the set are enumerated and separated by a comma it is also called tabulation method.

(a)  

A descriptive phrase is used to describe the elements or members of the set it is also called set builder notation, symbol it is written as {x| P(x)}.

(a)  

is a set whose elements are limited or countable, and the last element can be identified.

(a)  

is a set whose elements are unlimited or uncountable, and the last element cannot be specified.

(a)  

is a set with only one element it is also called singleton.

(a)  

is a unique set with no elements (or null set), it is denoted by the symbol Æ or { }.

(a)  

is the all sets under investigation in any application of set theory are assumed to be contained in some large fixed set, denoted by the symbol U.

(a)  

The (a)   of a set is the number of elements or members in the set, the cardinality of set A is denoted by n(A)

is a pictorial presentation of relation and operations on set.

(a)  

Also known set diagrams, it show all hypothetically possible logical relations between finite collections of sets.

(a)  

Introduced by (a)   in his paper "On the Diagrammatic and Mechanical Representation of Propositions and Reasoning’s"

If A and B are sets, A is called (a)   of B, if and only if, every element of A is also an element of B.

Let A and B be sets. A is a (a)   of B, if and only if, every element of A is in B but there is at least one element of B that is not in A.

Given set A and B, A equals B, written, if and only if, every element of A is in B and every element of B is in A.

(a)  

Given a set S from universe U, the (a)   of S denoted by P(S), is the collection (or sets) of all subsets of S.

of A and B, denoted AÈB, is the set of all elements x in U such that x is in A or x is in B.

(a)  

of A and B, denoted AÇB, is the set of all elements x in U such that x is in A and x is in B.

(a)  

of A , denoted A’, is the set of all elements x in U such that x is not in A.

(a)  

of A and B (or relative complement of B with respect to A), denoted A ~ B, is the set of all elements x in U such that x is in A and x is not in B.

(a)  

If set A and B are two sets, their (a)   as the set consisting of all elements that belong to A or to B, but not to both A and B.

Two set are called (a)   (or non-intersecting) if and only if, they have no elements in common.

In the (a)   (a, b), a is called the first component and b is called the second component. In general, (a, b) ¹ (b, a).

is a set of ordered pairs.

(a)  

is a special kind of relation helps visualize relationships in terms of graphs and make it easier to interpret different behavior of variables.

(a)  

is a relation in which, for each value of the first component of the ordered pairs, there is exactly one value of the second component.

(a)  

set of all images of the elements of the domain is called the of the function. A function can map from one set to another.

(a)  

is a set of elements, with one operation, that satisfies the following properties:

(i)the set is closed with respect to the operation,

(ii)the operation satisfies the associative property,

(iii)there is an identity element, and

(iv)each element has an inverse.

(a)  

is a branch of mathematics with close connections to computer science.

(a)  

is generally regarded as the Father of Logic

(a)  

is a declarative sentence which is either true or false, but not both.

(a)  

written using propositional logic notation, p, q, and r are used to represent statements.

(a)  

is a statement composed of two or more simple statements connected by logical connectives

(a)  

A statement which is not compound is said to be

(a)  

of the statement p and q is the compound statement “p and q.”

(a)  

of the statement p, q is the compound statement “p or q.”

(a)  

The (a)   of the statement p is denoted by ~p, where ~ is the symbol for “not.”

of the statement p and q is the compound statement “if p then q.”

(a)  

of the statement p and q is the compound statement “p if and only if q.”

(a)  

is a statement whose truth depends on the value of one or more variables.

(a)  

is a sentence P(x); it becomes a statement only when variable x is given particular value.

(a)