Logic, Proofs, Study notes of Logic

The proposition p ↔ q, read “p if and only if q”, is called bicon- ditional. It is true precisely when p and q have the same truth value, i.e., they are both ...

Typology: Study notes

2022/2023

Uploaded on 03/01/2023

princesspeach
princesspeach 🇺🇸

4.7

(6)

226 documents

1 / 5

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CHAPTER 1
Logic, Proofs
1.1. Propositions
Aproposition is a declarative sentence that is either true or false
(but not both). For instance, the following are propositions: “Paris
is in France” (true), “London is in Denmark” (false), “2 <4” (true),
“4 = 7 (false)”. However the following are not propositions: “what
is your name?” (this is a question), “do your homework” (this is a
command), “this sentence is false” (neither true nor false), xis an
even number” (it depends on what xrepresents), “Socrates” (it is not
even a sentence). The truth or falsehood of a proposition is called its
truth value.
1.1.1. Connectives, Truth Tables. Connectives are used for
making compound propositions. The main ones are the following (p
and qrepresent given propositions):
Name Represented Meaning
Negation ¬p“not p
Conjunction pqpand q
Disjunction pqpor q(or both)”
Exclusive Or pq“either por q, but not both”
Implication pq“if pthen q
Biconditional pqpif and only if q
The truth value of a compound proposition depends only on the
value of its components. Writing F for “false” and T for “true”, we
can summarize the meaning of the connectives in the following way:
6
pf3
pf4
pf5

Partial preview of the text

Download Logic, Proofs and more Study notes Logic in PDF only on Docsity!

CHAPTER 1

Logic, Proofs

1.1. Propositions

A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: “Paris is in France” (true), “London is in Denmark” (false), “2 < 4” (true), “4 = 7 (false)”. However the following are not propositions: “what is your name?” (this is a question), “do your homework” (this is a command), “this sentence is false” (neither true nor false), “x is an even number” (it depends on what x represents), “Socrates” (it is not even a sentence). The truth or falsehood of a proposition is called its truth value.

1.1.1. Connectives, Truth Tables. Connectives are used for making compound propositions. The main ones are the following (p and q represent given propositions):

Name Represented Meaning Negation ¬p “not p” Conjunction p ∧ q “p and q” Disjunction p ∨ q “p or q (or both)” Exclusive Or p ⊕ q “either p or q, but not both” Implication p → q “if p then q” Biconditional p ↔ q “p if and only if q”

The truth value of a compound proposition depends only on the value of its components. Writing F for “false” and T for “true”, we can summarize the meaning of the connectives in the following way:

6

p q ¬p p ∧ q p ∨ q p ⊕ q p → q p ↔ q T T F T T F T T T F F F T T F F F T T F T T T F F F T F F F T T

Note that ∨ represents a non-exclusive or, i.e., p ∨ q is true when any of p, q is true and also when both are true. On the other hand ⊕ represents an exclusive or, i.e., p ⊕ q is true only when exactly one of p and q is true.

1.1.2. Tautology, Contradiction, Contingency.

  1. A proposition is said to be a tautology if its truth value is T for any assignment of truth values to its components. Example: The proposition p ∨ ¬p is a tautology.
  2. A proposition is said to be a contradiction if its truth value is F for any assignment of truth values to its components. Example: The proposition p ∧ ¬p is a contradiction.
  3. A proposition that is neither a tautology nor a contradiction is called a contingency.

p ¬p p ∨ ¬p p ∧ ¬p T F T F T F T F F T T F F T T F 6 6 tautology contradiction

1.1.3. Conditional Propositions. A proposition of the form “if p then q” or “p implies q”, represented “p → q” is called a conditional proposition. For instance: “if John is from Chicago then John is from Illinois”. The proposition p is called hypothesis or antecedent, and the proposition q is the conclusion or consequent.

Note that p → q is true always except when p is true and q is false. So, the following sentences are true: “if 2 < 4 then Paris is in France” (true → true), “if London is in Denmark then 2 < 4” (false → true),

p q ¬p ¬q p ∨ q ¬(p ∨ q) ¬p ∧ ¬q p ∧ q ¬(p ∧ q) ¬p ∨ ¬q T T F F T F F T F F T F F T T F F F T T F T T F T F F F T T F F T T F T T F T T

Example: The following propositions are logically equivalent:

p ↔ q ≡ (p → q) ∧ (q → p)

Again, this can be checked with the truth tables:

p q p → q q → p (p → q) ∧ (q → p) p ↔ q T T T T T T T F F T F F F T T F F F F F T T T T

Exercise: Check the following logical equivalences:

¬(p → q) ≡ p ∧ ¬q p → q ≡ ¬q → ¬p ¬(p ↔ q) ≡ p ⊕ q

1.1.5. Converse, Contrapositive. The converse of a conditional proposition p → q is the proposition q → p. As we have seen, the bi- conditional proposition is equivalent to the conjunction of a conditional proposition an its converse.

p ↔ q ≡ (p → q) ∧ (q → p)

So, for instance, saying that “John is married if and only if he has a spouse” is the same as saying “if John is married then he has a spouse” and “if he has a spouse then he is married”.

Note that the converse is not equivalent to the given conditional proposition, for instance “if John is from Chicago then John is from Illinois” is true, but the converse “if John is from Illinois then John is from Chicago” may be false.

The contrapositive of a conditional proposition p → q is the propo- sition ¬q → ¬p. They are logically equivalent. For instance the con- trapositive of “if John is from Chicago then John is from Illinois” is “if John is not from Illinois then John is not from Chicago”.