Scribd Logo
Upload

Welcome to Scribd!

  • Math Stuff

    Uploaded by

    gafgafgaf
    10 views1 page
    There are at most 2^(2^n) compound formulas that can be constructed from a list of n formulas, with no two formulas being equivalent. For each of the 2^n possible combinations of truth values for the n variables, the compound formula can output either true or false, resulting in 2 possible truth values per row. With 2^n rows, the total number of possible truth tables and thus non-equivalent formulas is 2^(2^n).

    Original Description:

    various proofs

    Original Title

    MathStuff

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    There are at most 2^(2^n) compound formulas that can be constructed from a list of n formulas, with no two formulas being equivalent. For each of the 2^n possible combinations of truth values for the n variables, the compound formula can output either true or false, resulting in 2 possible truth values per row. With 2^n rows, the total number of possible truth tables and thus non-equivalent formulas is 2^(2^n).

    Copyright:

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

    Math Stuff

    Uploaded by

    gafgafgaf
    There are at most 2^(2^n) compound formulas that can be constructed from a list of n formulas, with no two formulas being equivalent. For each of the 2^n possible combinations of truth values for the n variables, the compound formula can output either true or false, resulting in 2 possible truth values per row. With 2^n rows, the total number of possible truth tables and thus non-equivalent formulas is 2^(2^n).

    Copyright:

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

    Ex 1.1.

    5 If P1,P2,…,Pn is a list of n formulas, at most how many compound formulas using this list
    can be constructed, no two of which are equivalent?

    Two formulas are equivalent if and only if they have the same truth table. And for any conceivable
    truth table, there is a formula, say in disjunctive normal form, which has that truth table.
    For each of the 2n
    possible combinations of truth values of the pi, we have 2 choices for the truth value of the formula, for
    a total of 2(2n)
    .

    If there are n variable, the truth table contains 2^n rows. In each row the function can be true or false.
    There for by product rule the required number of functions = 2 × 2 × 2 × ••••••• upto 2^n times =
    2^(2^n)

    You might also like