This week, my professor taught us some more complicated, logical concepts. I learnt about concepts all the way from expressions that restricted domains of items in two sets when they are combined together, until a concept known as De Morgan's Law. The course content is still challenging for me, but I try to understand it by rereading over the information and repeating it to myself. At the extra help sessions, I try to further clarify my doubts with teaching assistants through explanations and diagrams. It has helped me and I am confident that I will succeed in this course if I continue to attend these sessions regularly.
Other concepts that I have learnt this week are conjunction (combining two statements by claiming them as true with the word "and"), disjunction (combining two statements by claiming that at least one of them is true with the word "or"), and negation (reversing the truth values of statements using Ø). Negation involves changing a statement so that true becomes false and false becomes true. It is a very tricky concept to grasp because it involves changing certain conditions to fit the negation statement. For example, there is a statement that implies "for all x belonging to a set of real numbers, P(x) implies Q(x). The statement that says this is "xeX, P(x) -> Q(x). When this statement is negated, we get the statement "for certain x belonging to a set of real numbers, P(x) is true and Q(x) is not true". This is symbolized by $xeX, P(x) and ØQ(x). At first, I was confused at why this happened as I thought that the inverted A could not be changed to a mirror-image of E just because of a sign. However, through extra help and rereading, I was able to make sense of the concept. Furthermore, I was unaware of what the word parse meant, despite it being used several times in class. I researched its definition and I saw that it was just the breaking down of a statement into components to make sense of it.
I also learnt that Venn diagrams were necessary to represent conjunctions, disjunctions and negations in an easier and a more visual way, but there were some limits as to how many predicates or functions the Venn diagrams can represent. This is where truth tables can help. Truth tables are tables that have variables and functions as headers and T and F in the tables to signify if the eventual condition will be true or false. This was one of the concepts that I enjoyed learning the most this week as it was easy to find results of expressions using this way. Other new terms that I learnt this week are tautology (when a statement is true in all cases), satisfiable (when a statement is true in certain cases), and unsatisfiable (when a statement is false in all cases). Lastly, De Morgan's Law states that the roles of "and" and "or" are switched. For example, Ø (P or Q) <-> ØP and ØQ. At first, I couldn't understand this, but later I understood the logic by rereading it: if P or Q cannot be true, it means that both of them will be untrue.
On Friday, my professor conducted a unique activity. He told his students to take a strip of paper and keep folding it into half from the left. Each time we folded, we had to open up the folded paper and record how many times the paper folds pointed upwards or downwards. Then, we were to find some kind of logical pattern as to how the number of upward or downward folds increased. I came up with a math equation for the increment of the total number of folds for every fold leftwards. This was the most interesting and enjoyable activity for me this week as I not only learnt something, but had fun at the same time. At the moment, I am looking forward to and a little apprehensive of the upcoming course material for next week.
Other concepts that I have learnt this week are conjunction (combining two statements by claiming them as true with the word "and"), disjunction (combining two statements by claiming that at least one of them is true with the word "or"), and negation (reversing the truth values of statements using Ø). Negation involves changing a statement so that true becomes false and false becomes true. It is a very tricky concept to grasp because it involves changing certain conditions to fit the negation statement. For example, there is a statement that implies "for all x belonging to a set of real numbers, P(x) implies Q(x). The statement that says this is "xeX, P(x) -> Q(x). When this statement is negated, we get the statement "for certain x belonging to a set of real numbers, P(x) is true and Q(x) is not true". This is symbolized by $xeX, P(x) and ØQ(x). At first, I was confused at why this happened as I thought that the inverted A could not be changed to a mirror-image of E just because of a sign. However, through extra help and rereading, I was able to make sense of the concept. Furthermore, I was unaware of what the word parse meant, despite it being used several times in class. I researched its definition and I saw that it was just the breaking down of a statement into components to make sense of it.
I also learnt that Venn diagrams were necessary to represent conjunctions, disjunctions and negations in an easier and a more visual way, but there were some limits as to how many predicates or functions the Venn diagrams can represent. This is where truth tables can help. Truth tables are tables that have variables and functions as headers and T and F in the tables to signify if the eventual condition will be true or false. This was one of the concepts that I enjoyed learning the most this week as it was easy to find results of expressions using this way. Other new terms that I learnt this week are tautology (when a statement is true in all cases), satisfiable (when a statement is true in certain cases), and unsatisfiable (when a statement is false in all cases). Lastly, De Morgan's Law states that the roles of "and" and "or" are switched. For example, Ø (P or Q) <-> ØP and ØQ. At first, I couldn't understand this, but later I understood the logic by rereading it: if P or Q cannot be true, it means that both of them will be untrue.
On Friday, my professor conducted a unique activity. He told his students to take a strip of paper and keep folding it into half from the left. Each time we folded, we had to open up the folded paper and record how many times the paper folds pointed upwards or downwards. Then, we were to find some kind of logical pattern as to how the number of upward or downward folds increased. I came up with a math equation for the increment of the total number of folds for every fold leftwards. This was the most interesting and enjoyable activity for me this week as I not only learnt something, but had fun at the same time. At the moment, I am looking forward to and a little apprehensive of the upcoming course material for next week.