DISCRETE MATH

• predicate logic is also known as propositional function or open sentence. it is a proposition whose truth value depends on the value of the subject of a statement. it is expressed as P(x)
• domain/universe of discourse is the set from which the value of the subject x may be chosen for a given P(x)
• universal quantification (∀) which means (FOR ALL).
• existential quantification (∃) which means (THERE EXIST)
• Counterexample is an element/object for which P(x) is FALSE
• set is a well defined and unorded collection/aggregate of subjects in any kind
• set is denoted by uppercase/big letters
• universal set contains all elements relevant to a particular discussion or problem
• notation is 'not element of'
• infinite set is where the number are of elements are NOT COUNTABLE
• finite set is were the number of elements are COUNTABLE
• define/represent a set - roster method, descriptive or set builder method
• set equality states that two given sets are identical , contains EXACTLY THE SAME ELEMENTS
• subset is a set contained in a larger set or in an equal set
• proper subset is a subset that is not equal to the set it belongs to
• number of subsets of a set with n element is n^2
• number of proper subset is 2n-1
• venn diagram is a way of visually representing sets of items or numbers
• set complement

  
• set intersection

  
• set union

  
• set difference

  
• symmetric difference