Home work 1.

Phase 1 (to be brought to the second lecture):

You are asked to write down a draft on the FORMAL proof of
the following statement:

    The negation of any logical formula can be transformed
    to an equivalent formula not containing negation before
    any forall, exists, AND, OR, or negation.

The rules to rely on are usual De-Morgan rules, on AND and OR,
and the similar rules on quantifiers and negation.
The way is considering the tree structure of the formula,
and giving the proof by induction of the maximal height
of negation at a "wrong" place, in this tree.

The proof must not be too detailed, the main thing is
the correct COMPOSITION of the proof parts: definitions,
statements, and cross-references between them. In particular,
you may use the "tree of the formula" without defining it.

In Anouncements at the course site, please, find some files in Latex,
related to this.
Also, you can read any textbook on the initial Logics course, on
such a proof. Of course, on you to close the book before writing.
On your text to be written in Hebrew (or in English), on a list,
signed by a nickname (in English letters). You bring the list
to the second lecture, and leave a copy at you.

On you to send me your nickname by e-mail!

----------------

Phase 2 :

1) To get a work of another student (phase 1), and to write down
your comments. To put the text with comments into the envelope,
hanging near my door (room 302/58), on Sunday MORNING.

2) In parallel, to begin to write down your proof in Latex,
using the files announced at the site.

3) On Sunday, to take your draft with comments, from the envelope,
and to prepare the final version of your proof before the third
lecture.

The result, due before the third lecture:
 (1) to send me your .tex file by e-mail, and
 (2) to give me your printed dvi file AND your draft with comments,
for checking.