--%>

Elementary Logic Set & Model of a Boolean Algebra

Prove that Elementary Logic Set is a Model of a Boolean Algebra

The three Boolean operations of Logic are the three logical operations of  OR ( V ), AND (upside down V), and NEGATION ~.  Addition is the logical OR , multiplication is the logical AND, and complement is the logical NEGATION.  The symbol 1 is the logical T (True), and the symbol 0 is the logical F (False) . (Just state the Boolean Algebra versions of logical statements below, the proofs are considered self-evident, we do not require Truth Tables to be written to establish their validity.)

1. State the commutative law of addition: _________________________________________

2. State the associative law of addition: ___________________________________________

3. State the law that says F is an additive identity __________________________________

4. State the commutative law of multiplication: _____________________________________

5. State the associative law of multiplication: _______________________________________

6. State the law that says T is a multiplicative identity _______________________________

7. State the distributive law of multiplication: _______________________________________

8. State the distributive law of addition: ____________________________________________

9.   State the Boolean Algebra property x  +  ˜ x  = 1 in terms of a logical statement A.

 10.   State the Boolean Algebra property x  •  ˜ x  = 0 in terms of a logical statement A.

The above ten properties are necessary and sufficient conditions to prove that Elementary Logic is indeed a model of a Boolean algebra.

11. In Elementary Logic, A implies B ( A-> B), has a Truth table, which we recall is only False (F), when B is False and A is True.  Rewrite the logical statement

A -> B in terms of the basic logical operations of AND (upside down V, we will have to use in this document the symbol ?), OR (V) and NEGATION (~).

A -> B =   

12. In terms of an Abstract Boolean Algebra, for two elements x and y define that x implies y,  x -> y using the basic operations  +,  •, and ~ of  Boolean Algebra, using the definition from Elementary Logic as your guide.

x -> y  

Recall that in Elementary Logic a Tautology is a statement which is always True, regardless of the truth values of its constituent statements., e.g.  A V ~A .

13. Write the Truth table for the logical statement (A->B)  V (B->A).   

Is (A->B)  V (B->A)  a tautology?

14. Write the Truth table for the logical statement  (B ? (A->B) ) ->A  (recall ? is unfortunately our symbol for AND, the upside down V).   

Is (B ? (A->B) ) ->A a tautology?

   Related Questions in Mathematics

  • Q : Probability assignments 1. Smith keeps

    1. Smith keeps track of poor work. Often on afternoon it is 5%. If he checks 300 of 7500 instruments what is probability he will find less than 20substandard? 2. Realtors estimate that 23% of homes purchased in 2004 were considered investment properties. If a sample of 800 homes sold in 2

  • Q : Problem on inverse demand curves In

    In differentiated-goods duopoly business, with inverse demand curves: P1 = 10 – 5Q1 – 2Q2P2 = 10 – 5Q2 – 2Q1 and per unit costs for each and every firm equal to 1.<

  • Q : Probability and Stochastic assignment

    Introduction to Probability and Stochastic Assignment 1: 1. Consider an experiment in which one of three boxes containing microchips is chosen at random and a microchip is randomly selected from the box.

  • Q : How to get calculus homework done from

    How to get calculus homework done from tutor

  • Q : Numerical solution of PDE i want you to

    i want you to solve this assignment. this consist of two parts theoretical and coding. the code has to be created by you. no modified or copying code. you have to mention the exact solution and the proportion error. also you have to explain the sketch that you get from the code. these information

  • Q : Problem on Prime theory Suppose that p

    Suppose that p and q are different primes and n = pq. (i) Express p + q in terms of Ø(n) and n. (ii) Express p - q in terms of p + q and n. (iii) Expl

  • Q : Examples of groups Examples of groups:

    Examples of groups: We now start to survey a wide range of examples of groups (labelled by (A), (B), (C), . . . ). Most of these come from number theory. In all cases, the group axioms should be checked. This is easy for almost all of the examples, an

  • Q : Who independently developed

    Who independently developed a model for simply pricing risky assets?

  • Q : Competitive equilibrium 8. Halloween is

    8. Halloween is an old American tradition. Kids go out dressed in costume and neighbors give them candy when they come to the door. Spike and Cinderella are brother and sister. After a long night collecting candy, they sit down as examine what they have. Spike fi

  • Q : What is Big-O hierarchy The big-O

    The big-O hierarchy: A few basic facts about the big-O behaviour of some familiar functions are very important. Let p(n) be a polynomial in n (of any degree). Then logbn is O(p(n)) and p(n) is O(an<