Lecture 2

Navigation

• Back to Main Page.
• Back to the Lectures.
• Before the Lecture
• Related Problems
• In Class
• Outcomes

Before the Lecture

• Read Sections 1.1 to 1.2. (Note: Look at the section Outcomes to see what you are expected to get from the reading, perhaps after also some in class help.)
• Watch the videos related to these sections (after reading them):
  • Remarks on Section 1.1.
  • Problem 1.1.2.
  • Problem 1.1.5.
  • Remarks on Section 1.2.
  • Example 1.2.2.
  • Problem 1.2.11.
  • Remarks on Section 1.3.
  • Problem 1.4.4.
  • Problem 1.4.5.
  • Problem 1.4.11.
• Write down all questions about the above topics to bring to our (online) lecture. (You can also type them in the file "Questions.tex" in Sage Math Cloud.) Comments about the videos are welcome!
• Work on the assigned problems for these sections. (See Related Problems below.) You don't need to finish them, but try to work on as many as you can and the bring your questions to class.

 

Related Problems

The "turn in" problems are due on 06/11 (Homework 1) by 11:59pm.

Section 1.1:	Turn in: 3(d), 6(b), 7(b).
	Extra Problems: 1, 3(a-c), 6(a), (c), 7(a), (c-d).
Section 1.2:	Turn in: 2(b), 12(b).
	Extra Problems: 2(a), 12(a), (c).
Section 1.3:	Turn in: None.
	Extra Problems: 2, 4, 6, 8.
Section 1.4:	Turn in: 6(a), 7(a), 9.
	Extra Problems: 2, 6(b), 7(b).

 

In Class

In class:

• We will discuss the reading and pace.
• I will discuss the main points.
• I will answer questions about the sections covered.
• I will answer any other questions.
• We can work on the HW problems.

 

Outcomes

After the assignment (reading and videos before class) and class, you should:

• be able to determine if an argument is valid or not (Example 1.1.1, Problem 1.1.7);
• know the symbols and use of "and", "or" and "not";
• be able to translate statements from English to logical symbols (Example 1.1.2, Problem 1.1.1) and vice-versa (Example 1.1.3, Problem 1.1.6);
• be able to determine if a logical expression is well-formed (Problem 1.1.4);
• know how to write truth tables (Examples 1.2.1, 1.2.2, Problem 1.2.2);
• understand the concept of logical equivalency;
• simplify and prove equivalency using Boolean algebra (Examples 1.2.5, 1.2.6, Problem 1.2.12);
• be familiar with the notions of sets and its basic operations (union, intersection and subtraction);
• know what the Truth Set of a statement (which depends on a variable) is (Example 1.3.5, Problem 1.3.8);
• know how to use Venn Diagrams (Problems 1.4.6 and 1.4.11);
• prove equality of two sets with logic (Problem 1.4.7).