What are the rules for truth tables?
Constructing Truth Tables
- Step 1: Count how many statements you have, and make a column for each statement.
- Step 2: Fill in the different possible truth values for each column.
- Step 3: Add a column for each negated statement, and fill in the truth values.
What does ∼ P ∧ Q mean?
P ∧ Q means P and Q. P ∨ Q means P or Q. An argument is valid if the following conditional holds: If all the premises are true, the conclusion must be true.
What does ∧ and ∨ mean in math?
The conjunction of the statements P and Q is the statement “P and Q” and its denoted by P∧Q. The statement P∧Q is true only when both P and Q are true. The disjunction of the statements P and Q is the statement “P or Q” and its denoted by P∨Q. The statement P∨Q is true only when at least one of P or Q is true.
How are XY and Z related?
Order of equality does not matter. For all real numbers x,y, and z , if x=y and y=z , then x=z . Two numbers equal to the same number are equal to each other.
Is P and not PA contradiction?
p & not-p is the statement that p is true and not-p is also true. I assume you can see why that is problematic. One or the other must be true, but both can never be true — hence the contradiction. If p then not-p says that IF p is true then not-p is true.
How is the cs103 course structured?
Following the lead of what Cynthia piloted in CS103 in the Spring 2020 offering of the course (along with David Varodayan and Amy Liu), we structured the course as follows. The course had four components: assignments, lecture quizzes, tutorial sessions, and midterm exams.
How many students took cs103 fall 2013?
View the Fall 2013 CS103 website. This fifth offering of CS103 broke the size record by quite a large margin (333 students!). I made a lot of changes to the course that really seemed to pay off.
What are the major changes in cs103?
The other major shift in this iteration of CS103 was increasing the focus on intuition and conceptual understanding. In previous offerings of CS103, a common student concern was that they were having trouble demonstrating what they knew to be true through mathematical proofs.
Is it possible to integrate set theory proofs into cs103?
I think it’s possible to integrate set theory proofs back into CS103 by spreading them out over a long series of problem sets. For example, we could introduce the basics in PS2, then continuously step up the difficulty of these problems over PS3, PS4, etc.