Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    HD05.Universe of PL WFFs

    Uploaded by

    Abhinav
    The document is a handout for a class on propositional logic. It discusses different types of propositional wffs (well-formed formulas), including tautologies, contradictions, satisfiable wffs, and falsifiable wffs. It notes that tautologies are always true, contradictions are always false, and satisfiable and falsifiable wffs can be either true or false depending on the interpretation. The document warns that the logical negation of a satisfiable or falsifiable wff is not necessarily a contradiction or tautology, as the diagrams might suggest. It also explains that satisfiable and falsifiable wffs can overlap.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    HD05.Universe of PL WFFs

    Uploaded by

    Abhinav
    24 views10 pages
    The document is a handout for a class on propositional logic. It discusses different types of propositional wffs (well-formed formulas), including tautologies, contradictions, satisfiable wffs, and falsifiable wffs. It notes that tautologies are always true, contradictions are always false, and satisfiable and falsifiable wffs can be either true or false depending on the interpretation. The document warns that the logical negation of a satisfiable or falsifiable wff is not necessarily a contradiction or tautology, as the diagrams might suggest. It also explains that satisfiable and falsifiable wffs can overlap.

    Original Description:

    formal methods

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document is a handout for a class on propositional logic. It discusses different types of propositional wffs (well-formed formulas), including tautologies, contradictions, satisfiable wffs, and falsifiable wffs. It notes that tautologies are always true, contradictions are always false, and satisfiable and falsifiable wffs can be either true or false depending on the interpretation. The document warns that the logical negation of a satisfiable or falsifiable wff is not necessarily a contradiction or tautology, as the diagrams might suggest. It also explains that satisfiable and falsifiable wffs can overlap.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    24 views10 pages

    HD05.Universe of PL WFFs

    Uploaded by

    Abhinav
    The document is a handout for a class on propositional logic. It discusses different types of propositional wffs (well-formed formulas), including tautologies, contradictions, satisfiable wffs, and falsifiable wffs. It notes that tautologies are always true, contradictions are always false, and satisfiable and falsifiable wffs can be either true or false depending on the interpretation. The document warns that the logical negation of a satisfiable or falsifiable wff is not necessarily a contradiction or tautology, as the diagrams might suggest. It also explains that satisfiable and falsifiable wffs can overlap.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 10

    CS 511, Fall 2019, Handout 05

    Valid WFF’s/Tautologies
    Contradictions/Unsatisfiable WFF’s
    Contingent WFF’s/Satisfiable+Falsifiable WFF’s

    Assaf Kfoury

    04 September 2019

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 1 of 10


    Universe of Propositional WFF’s

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 2 of 10


    Universe of Propositional WFF’s

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    I the logical negation of a tautology is an unsatisfiable WFF


    (Why? Look at the truth tables.)
    I the logical negation of an unsatisfiable WFF is a tautology
    (Why? Look at the truth tables.)
    I WFF’s that are neither tautologies nor contradictions are sometimes called contingent ,
    which are in the middle of the diagram above.

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 3 of 10


    Universe of Propositional WFF’s

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    satisfiable WFF's

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 4 of 10


    Universe of Propositional WFF’s

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    satisfiable WFF's
    I Warning: the logical negation of a satisfiable WFF is NOT necessarily an unsatisfiable
    WFF, even though the diagram and the words seem to suggest it!

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 5 of 10


    Universe of Propositional WFF’s
    falsifiable WFF's

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 6 of 10


    Universe of Propositional WFF’s
    falsifiable WFF's

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    I Warning: the logical negation of a falsifiable WFF is NOT necessarily a tautology, even
    though the diagram and the words seem to suggest it!

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 7 of 10


    Universe of Propositional WFF’s
    falsifiable WFF's

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    satisfiable WFF's

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 8 of 10


    Universe of Propositional WFF’s
    falsifiable WFF's

    valid WFFs/ unsatisfiable WFF's/


    tautologies contradictions

    satisfiable WFF's
    I Note that the set of satisfiable WFF’s and the set of falsifiable WFF’s overlap.
    I The race is on for defining and implementing procedures to decide membership of a
    propositional WFF in each of the 3 groups separately:

    1. tautologies/valid WFF’s
    2. contingent WFF’s, i.e., WFF’s that are both satisfiable and falsifiable
    3. contradictions/unsatisfiable WFF’s
    (All the notions in 1, 2, and 3, are all defined semantically , i.e., with truth-tables .)

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 9 of 10


    ( THIS PAGE INTENTIONALLY LEFT BLANK )

    Assaf Kfoury, CS 511, Fall 2019, Handout 05 page 10 of 10

    You might also like