Scribd Logo
Upload

Welcome to Scribd!

  • 22 views

    Reafing For Week One

    Uploaded by

    daisykhenderson
    This document provides definitions and examples related to logical operations and quantifiers. It includes truth tables for logical operations like "not", "and", "or", and "implies". It also defines logical concepts like tautology, contradiction, and logical equivalence. The examples section includes completing truth tables, determining the consistency of system specifications, using properties like De Morgan's laws, and identifying types of proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Reafing For Week One

    Uploaded by

    daisykhenderson
    22 views5 pages
    This document provides definitions and examples related to logical operations and quantifiers. It includes truth tables for logical operations like "not", "and", "or", and "implies". It also defines logical concepts like tautology, contradiction, and logical equivalence. The examples section includes completing truth tables, determining the consistency of system specifications, using properties like De Morgan's laws, and identifying types of proofs.

    Original Description:

    week one reading

    Original Title

    Reafing for week one

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document provides definitions and examples related to logical operations and quantifiers. It includes truth tables for logical operations like "not", "and", "or", and "implies". It also defines logical concepts like tautology, contradiction, and logical equivalence. The examples section includes completing truth tables, determining the consistency of system specifications, using properties like De Morgan's laws, and identifying types of proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    22 views5 pages

    Reafing For Week One

    Uploaded by

    daisykhenderson
    This document provides definitions and examples related to logical operations and quantifiers. It includes truth tables for logical operations like "not", "and", "or", and "implies". It also defines logical concepts like tautology, contradiction, and logical equivalence. The examples section includes completing truth tables, determining the consistency of system specifications, using properties like De Morgan's laws, and identifying types of proofs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 5

    READING SUMMARY AND EXAMPLES WEEK ONE

    1.

    Definitions

    Please complete the truth tables below for these basic logical operations:
    not p
    p
    p
    True
    False
    p and q
    p
    q

    pq

    p or q
    p
    q

    pq

    p implies q
    p
    q

    pq

    READING SUMMARY AND EXAMPLES WEEK ONE

    p exclusive or q
    p
    q
    pq

    p if and only if q
    p
    q
    pq

    Please complete the following definitions:


    Definition: A tautology is a compound proposition that is

    Definition: A contradiction is a compound proposition that is

    Definition: Two logical propositions are logically equivalent if

    Definition: The propositions p1 , p2 , ..., pn constitute


    a valid argument if p1 p2 ... pn1 pn is

    READING SUMMARY AND EXAMPLES WEEK ONE


    Quantification of One Variable
    Statement When is it true?
    xP (x)

    What is required for it to be false?

    xP (x)

    Quantification of Two Variables


    Statement When is it true?
    xyP (x, y)

    xyP (x, y)

    xyP (x, y)

    xyP (x, y)

    What is required for it to be false?

    READING SUMMARY AND EXAMPLES WEEK ONE

    2.

    Examples

    1. Please complete the following truth table for the extended compound expression
    (p q) (p q) with the intermediate steps. These are the sub-expressions that you
    evaluate in the process of evaluating the full expression.
    p
    q
    p
    q

    2. A System specification is consistent if there is some set of conditions of the system


    making all the specifications true. Following example 4, p. 18 in Rosen, determine
    whether the following system specifications are consistent:
    If the diagnostic message is not stored in the buffer, then it is retransmitted.
    If the system is in report mode, then the diagnostic message is not stored in the buffer.
    The system is in report mode or the diagnostic message is stored in the buffer.
    Let p denote The diagnostic message is stored in the buffer., and let q denote The
    diagnostic message is retransmitted. User r for The system is in report mode. If the
    system is consistent, give an assignment of truth values to p, q, and r making all the
    specifications true.
    p

    3. Use a truth table to show that p q q p


    p
    q
    p
    q

    READING SUMMARY AND EXAMPLES WEEK ONE

    4. Express x(P (x) Q(x)) without using the operator (this involves using De
    Morgans law and the table on page 47 of Rosen.

    5. Suppose the
    x=a
    y = 0 True
    y = 1 False
    y = 2 False

    proposition P(x,y) has truth values given in the table below:


    x=b x=c x=d
    True True True
    False True True
    True False False

    Is xyP (x, y) true?


    Is yxP (x, y) true?
    Is yxP (x, y) true?

    6. Consider the following proof that my pet cat Nosy is not home.
    Claim Nosy is not home. Suppose Nosy is home. We know that if Nosy is home, then the
    television is on. The television is not on. Therefore Nosy is not home.
    Is this a direct proof, a proof by contraposition, or a proof by contradiction?

    7. Consider the following proof that there are 100 consecutive positive integers, none of
    which is a perfect square.
    Claim there are 100 consecutive positive integers, none of which is a perfect square. Let n
    = 2500 = 502 . Note that 512 = 2601. Thus the 100 integers between 2501 and 2600 are
    not perfect squares.
    Is this a constructive or a non-constructive proof?

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy