Propositional : and Translations

Alice Gao

Lecture 6

CS 245 Logic and Computation Fall 2019 Alice Gao 1 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 2 / 25 Learning goals

By the end of this lecture, you should be able to ▶ Determine if a set of formulas is satisfiable. ▶ Define tautological consequence. Explain subtleties of tautological consequence. ▶ Prove that a tautological consequence holds/does not hold by using the of tautological consequence, and/or tables. ▶ Translate an English sentence with no logical ambiguity into a . ▶ Translate an English sentence with logical ambiguity into multiple propositional formulas and prove that the propositional formulas are not tautologically equivalent.

CS 245 Logic and Computation Fall 2019 Alice Gao 3 / 25 Logical Deduction and Tautological Consequence

▶ Logic is the science of reasoning. ▶ The process of logical deduction is formalized by the notion of tautological consequence. ▶ Can we deduce a conclusion based on a set of ?

CS 245 Logic and Computation Fall 2019 Alice Gao 4 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 5 / 25 Satisfying a Set of Formulas

Let Σ denote any set of formulas.

1, if for each 퐵 ∈ Σ, 퐵푡 = 1, Σ푡 = { 0, otherwise

What does Σ푡 = 0 mean? Definition () Σ is satisfiable there is some truth valuation 푡 such that Σ푡 = 1. When Σ푡 = 1, 푡 is said to satisfy Σ.

CS 245 Logic and Computation Fall 2019 Alice Gao 6 / 25 CQ Is Sigma Satisfiable?

CS 245 Logic and Computation Fall 2019 Alice Gao 7 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 8 / 25 Tautological Consequence

Definition (Tautological Consequence) Suppose Σ ⊆ 퐹 표푟푚(퐿푝) and 퐴 ∈ 퐹 표푟푚(퐿푝). 퐴 is a tautological consequence of Σ (that is, of the formulas in Σ), written as Σ ⊨ 퐴, if and only if for any truth valuation 푡, Σ푡 = 1 implies 퐴푡 = 1.

CS 245 Logic and Computation Fall 2019 Alice Gao 9 / 25 Tautological Equivalence

퐴 and 퐵 are (tautologically) equivalent if and only if 퐴 ⊨ ⊨ 퐵 holds. 퐴 ⊨ ⊨ 퐵 denotes 퐴 ⊨ 퐵 and 퐵 ⊨ 퐴.

CS 245 Logic and Computation Fall 2019 Alice Gao 10 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 11 / 25 CQ: Prove a tautological consequence

CQ: Consider the tautological consequence Σ ⊨ 퐴. To prove that the tautological consequence holds, we need to consider

(A) Every truth valuation 푡 under which Σ푡 = 1. (B) Every truth valuation 푡 under which Σ푡 = 0. (C) One truth valuation 푡 under which Σ푡 = 1. (D) One truth valuation 푡 under which Σ푡 = 0.

CS 245 Logic and Computation Fall 2019 Alice Gao 12 / 25 CQ: Disprove a tautological consequence

CQ: Consider the tautological consequence Σ ⊨ 퐴. To prove that the tautological consequence does NOT hold, we need to consider

(A) Every truth valuation 푡 under which Σ푡 = 1 and 퐴푡 = 1. (B) Every truth valuation 푡 under which Σ푡 = 1 and 퐴푡 = 0. (C) One truth valuation 푡 under which Σ푡 = 1 and 퐴푡 = 1. (D) One truth valuation 푡 under which Σ푡 = 1 and 퐴푡 = 0.

CS 245 Logic and Computation Fall 2019 Alice Gao 13 / 25 CQ: Proving/disproving a tautological consequence using a

CQ: Let Σ = {¬(푝 ∧ 푞), 푝 → 푞}, 푥 = ¬푝, and 푦 = 푝 ↔ 푞. Based on the truth table, which of the following statements is true? A) Σ ⊨ 푥 and Σ ⊨ 푦. B) Σ ⊨ 푥 and Σ ⊭ 푦. C) Σ ⊭ 푥 and Σ ⊨ 푦. D) Σ ⊭ 푥 and Σ ⊭ 푦.

푝 푞 (¬(푝 ∧ 푞)) (푝 → 푞) (¬푝) (푝 ↔ 푞) 0 0 1 1 1 1 0 1 1 1 1 0 1 0 1 0 0 0 1 1 0 1 0 1

CS 245 Logic and Computation Fall 2019 Alice Gao 14 / 25 Prove a tautological consequence using the definition

Exercise. Show that {(¬(푝 ∧ 푞)), (푝 → 푞)} ⊨ (¬푝).

CS 245 Logic and Computation Fall 2019 Alice Gao 15 / 25 Disprove a tautological consequence using the definition

Exercise. Show that {(¬(푝 ∧ 푞)), (푝 → 푞)} ⊭ (푝 ↔ 푞).

CS 245 Logic and Computation Fall 2019 Alice Gao 16 / 25 Disproving propositional

A student is trying to prove that {(퐴 → 퐵)} ⊭ (퐵 → 퐴) where 퐴 and 퐵 are well-formed predicate formulas. The student starts the proof by writing down the following sentence. There exists a truth valuation 푡 such that 퐵푡 = 1 and 퐴푡 = 0. Is the above sentence true (a valid claim)? (A) Yes, it is true. (B) No, it is . (C) There is not enough information to tell.

CS 245 Logic and Computation Fall 2019 Alice Gao 17 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 18 / 25 Subtleties of a Tautological Consequence

Consider the tautological consequence Σ ⊨ 퐴. Does the tautological consequence hold under each of the following conditions? 1. Σ is the empty set. 2. Σ is not satisfiable. 3. 퐴 is a tautology. 4. 퐴 is a .

CS 245 Logic and Computation Fall 2019 Alice Gao 19 / 25 CQ Subtleties of a Tautological Consequence

CS 245 Logic and Computation Fall 2019 Alice Gao 20 / 25 Outline

Learning goals

Satisfaction of a Set of Formulas

Tautological Consequence

Proving/Disproving a Tautological Consequence

Subtleties of a Tautological Consequence

Translations between English and Propositional Logic

Revisiting the learning goals

CS 245 Logic and Computation Fall 2019 Alice Gao 21 / 25 English sentences with no logical ambiguity

Translate the following sentences to propositional formulas. 1. Nadhi eats a fruit if the fruit is an apple. Nadhi eats a fruit only if the fruit is an apple. 2. Soo-Jin will eat an apple or an orange but not both. 3. If it is sunny tomorrow, then I will play golf, provided that I am relaxed.

CS 245 Logic and Computation Fall 2019 Alice Gao 22 / 25 English sentences with logical ambiguity

Give multiple translations of the following sentences into propositional logic. 1. Sidney will carry an umbrella unless it is sunny. 2. Pigs can fly and the grass is red or the sky isblue.

CS 245 Logic and Computation Fall 2019 Alice Gao 23 / 25 Translations: A page

▶ ¬푝: 푝 does not hold; 푝 is false; it is not the case that 푝 ▶ 푝 ∧ 푞: 푝 but 푞; not only 푝 but 푞; 푝 while 푞; 푝 despite 푞; 푝 yet 푞; 푝 although 푞 ▶ 푝 ∨ 푞: 푝 or 푞 or both; 푝 and/or 푞; ▶ 푝 → 푞: 푝 implies 푞; 푞 if 푝; 푝 only if 푞; 푞 when 푝; 푝 is sufficient for 푞; 푞 is necessary for 푝 ▶ 푝 ↔ 푞: 푝 is equivalent to 푞; 푝 exactly if 푞; 푝 is necessary and sufficient for 푞

CS 245 Logic and Computation Fall 2019 Alice Gao 24 / 25 Revisiting the learning goals

By the end of this lecture, you should be able to ▶ Determine if a set of formulas is satisfiable. ▶ Define tautological consequence. Explain subtleties of tautological consequence. ▶ Prove that a tautological consequence holds/does not hold by using the definition of tautological consequence, and/or truth tables. ▶ Translate an English sentence with no logical ambiguity into a propositional formula. ▶ Translate an English sentence with logical ambiguity into multiple propositional formulas and prove that the propositional formulas are not tautologically equivalent.

CS 245 Logic and Computation Fall 2019 Alice Gao 25 / 25