Saturday, 22 November 2014

#4 Proof outline example

                 When finishing assignment 2, we were requested to write in a proper proof outline, here is an example.
                 to prove
by using the definition of floor(x):
the proof structure is shown below:
It's just a example about straight prove.

Tuesday, 4 November 2014

#3 Conjunction and Disjunction

In this week's class, we've learned about two new quantifiers, conjunction \and \!\, and disjunction \or \!\,.


Conjunction and disjunction follow certain rules. Like commutative, associative and distributive laws.
Commutative law:A ∧ B \leftrightarrow \!\, B ∧ A   A ∨ B \leftrightarrow \!\, B ∨ A
De Morgan's Law:
\neg(P\land Q)\iff(\neg P)\lor(\neg Q)
\neg(P\lor Q)\iff(\neg P)\land(\neg Q)

#2 Verify/Falsify the implication

Slog can not show certain special symbols,so I used print screen.

CSC165 SLOG #1 Starting point

                   Starting points!
                   We all know that computer science relies strongly on mathematics, and csc165 is a course to teach us about mathematics expression. So in first week, Prof.Heap just taught us about mathematics quantifiers. Such as:
                   \forall \!\, means for all(each),e.g.\forall \!\,x,x is real. It means all x are real.
                   One of the biggest advantages of using mathematics quantifiers is that it avoids ambiguity which appears often in normal English expression. Like the sentence below:
                   Iraqi heads seeks arms.
                   It has two meanings , one is leader of Iraq seeks weapon, another is head of Iraqi seeks people to help.
                  To use quantifiers leads to precision in contrast.