--%>

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 : Bolzano-Weierstrass property The

    The Bolzano-Weierstrass property does not hold in C[0, ¶] for the infinite set A ={sinnx:n<N} : A is infinite; Show that has no “ limit points”.

  • Q : Who firstly discovered mathematical

    Who firstly discovered mathematical theory for random walks, that rediscovered later by Einstein?

  • Q : What is Non-Logical Vocabulary

    Non-Logical Vocabulary: 1. Predicates, called also relation symbols, each with its associated arity. For our needs, we may assume that the number of predicates is finite. But this is not essential. We can have an infinite list of predicates, P

  • Q : Mean and standard deviation of the data

    Below is the amount of rainfall (in cm) every month for the last 3 years in a particular location: 130 172 142 150 144 117 165 182 104 120 190 99 170 205 110 80 196 127 120 175

  • Q : Problem on Nash equilibrium In a

    In a project, employee and boss are working altogether. The employee can be sincere or insincere, and the Boss can either reward or penalize. The employee gets no benefit for being sincere but gets utility for being insincere (30), for getting rewarded (10) and for be

  • Q : State Prime number theorem Prime number

    Prime number theorem: A big deal is known about the distribution of prime numbers and of the prime factors of a typical number. Most of the mathematics, although, is deep: while the results are often not too hard to state, the proofs are often diffic

  • Q : Mathematical and Theoretical Biology

    Mathematical and theoretical biology is an interdisciplinary scientific research field with a range of applications in the fields of biology, biotechnology, and medicine. The field may be referred to as mathematical biology or biomathematics to stress the mathematical

  • Q : State Fermat algorithm The basic Fermat

    The basic Fermat algorithm is as follows: Assume that n is an odd positive integer. Set c = [√n] (`ceiling of √n '). Then we consider in turn the numbers c2 - n; (c+1)2 - n; (c+2)2 - n..... until a perfect square is found. If th

  • Q : Formal Logic It's a problem set, they

    It's a problem set, they are attached. it's related to Sider's book which is "Logic to philosophy" I attached the book too. I need it on feb22 but feb23 still work

  • Q : Explain a rigorous theory for Brownian

    Explain a rigorous theory for Brownian motion developed by Wiener Norbert.