Constructing_Truth _Tables_ Data repr method instructions 1 variant

Methodological Instructions

Theme: Constructing truth tables

Objective: 10.2.2.2 construct truth tables for the given logical expression

Assessment criteria

·        Consider the algorithm for constructing truth tables

·        Teach to construct a truth table

Basic Level:

From a grade 7–9 course, students have an idea of logical operations and truth tables.

Key words and phrases:

Truth tables, logic gates, Boolean gates and statements, NOT, OR, AND, NAND, NOR, built, express, true, false

Dictionary of specific terms and terminology:

•      We can build / express (this) in Boolean statements.

•      How can we build / express (this) in Boolean statements.

•      How can we express … as a Boolean statement?

•      When … is not true / true / false, is true / not true / false.

•      In this statement, … means …

I.                   THEORY

We can represent the truth of expressions in a tabular form called “truth tables.”  These tables consider all cases and can add great insight into otherwise complicated expressions.  Here are examples of some of most basic truth tables.

The truth table for negation (“not”)

The truth table for disjunction (“or”)

П. TESTS AND ASSIGNMENTS FOR SELF-ASSESSMENT.

1. Complete the following truth tables

(a) Truth table for conjunction (“and”)

            (b) Truth table for biconditional (“if and only if”)

Why do we say that the biconditional defines “logical equivalence”?

2. The truth table for conditional (“if...then...”) can be quite confusing.  Here it is.

Consider the example “For every integer n, if n > 2 then n² > 4.”  In this case p represents “n > 2” and q represents “n² > 4.”  Thus if n = 3 then p is true and q is true.

(a) Find another value of n that makes p true and q true.

(b) Find a value for n that makes p false and q false.

(c) Find a value for n that makes p false and q true.

(d) Find a value for n that make p true and q false. Explain any problems you have. Why are you having these problems?

The third row, corresponding to part (c), frustrates many people—you are not alone.  The truth has a special name. It is called “vacuously true.”

3. Complete the following truth tables

(a)

(b)

(c)

4. Draw up and complete the truth tables for the following expressions.  Please follow all of the conventions that you have observed above (such as listing p before q, etc.)

(a) p Ú (¬ p)

(b) (¬ p) Ù (¬ q)

5. An expression is a tautology if it is always true, regardless the truth of its component statements. Thus, the last column in its truth table will be all T’s.  A statement is a contradiction if the last column is always F—it is never true. 

(a) Show that (p Ù q) → p is a tautology by completing this truth table.

(b) Show that p Ù (¬ p) is a contradiction.

6. Logically equivalent expressions have the same truth tables.  Show that the following pairs of statements are logically equivalent.

(a) (¬ p) ® q and (p Ú q)  (You saw this on the previous worksheet. Where?)

(b) p → q and (¬ q) → (¬ p)  (The second statement is called the Contrapositive)

(c) (p Ú q) Ù r and  (p Ù r) Ú (q Ù r) (Distribution of sorts)

(d) ¬ (p Ù q) and (¬ p) Ú (¬ q) (This, and part (e) is called De Morgan’s Law)

(e) ¬ (p Ú q) and (¬ p) Ù (¬ q)

VISUAL AIDS AND MATERIALS.

1.      Slides

2.      Truth table: https://www.youtube.com/watch?v=N44NDlFcyVA

3.      https://www.youtube.com/watch?v=GFUiniPj_r8

4.      Differentiation material: https://www.youtube.com/watch?v=IF7Blq2TT6s

5.      https://www.csus.edu/indiv/n/nogalesp/HonorsCriticalThinking/CTHonorsWk1011De uctiveSentential/Phil4TTForSentenceConnectives.doc

Скачано с www.znanio.ru