Week 4

    The course content for this week was not exceptionally challenging for me, though I find the form of proofs slightly annoying. It seems that just as I became sick of proofs in MAT137, we started on them in CSC165, however I am fully aware of the necessity of my understanding of this. I am currently only really annoyed with the tutorial exercises that have been posted, for both exercises everything seems to make sense until the middle.

Example: The proof structure is required for the following statement.

    For all X in the set of integers, for all Y in the set of integers. If X >= Y, then there exists Z in the set of integers where X <= Z <= Y.

(Ignoring most comments in this structure for now.)

    Assume X is a typical integer
        Assume Y is a typical integer
            Assume X <= Y
                Then R
                    .
                    .
                    .
                 Assume there exists Z in the set of integers                                 # This step and
                 Then there exists Z in the set of integers where X <= Z <= Y          # this step are
                                                                                                                  # confusing me
            Then X <= Y implies that there exists Z in the set of integers where X <= Z <= Y
        Then for all Y, If X <= Y, then there exists Z in the set of integers where X <= Z <= Y
    Then for all X, for all Y, If X <= Y, then there exists Z in the set of integers where X <= Z <= Y


    I plan to ask many questions in tutorial on Tuesday as I must prioritize with my studying. I'm getting the impression that the majority of Wednesday's test will be on logical notation so this is will be my primary focus.