Eequivalences rules, Computer Engineering

Eequivalences rules:

This conveys a meaning that is actually much simpler so than you would think on first inspection. 

Hence we can justify this, by using the following chain of rewrite steps based on the equivalences we've stated above that the: 

1.      By using the double negation rewrite: P => ¬¬P 

(A ↔ B) ^ (¬A  ?¬¬B)

2.      By using De Morgan's Law: ¬P ^ ¬ Q => ¬(P?  Q) 

(A ↔ B)  ^¬ (A? ¬B) 

3.      By using the commutativity of  :? P?  Q => Q?  P 

(A ↔ B) ^ ¬ (¬ B?  A) 

4.      By using 'replace implication' from right to left: ¬ P?  Q => P→  Q 

(A↔  B)  ¬ (B→  A) 

5.      By using 'replace equivalence' from left to right: P ↔ Q => (P→  Q)^  (Q → P) 

((A → B)^  (B→  A)) ^ ¬ (B → A) 

6.      By using the associativity of  : ^(P^  Q)  R => P  (Q^  R) 

(A→  B) ^ ((B→  A) ^ ¬ (B → A)) 

7.      By using the consistency equivalence above: P  ^ ¬P => False

(A ↔ B) ^  False 

8.      By using the definition of  ^ : False

There  what does this mean? Like if it mean that our original sentence was always false: and there are no models that would make this sentence true. Such the another way to think about this is that the original sentence was too inconsistent with the rules of propositional logic there.

Posted Date: 1/11/2013 5:46:17 AM | Location : United States







Related Discussions:- Eequivalences rules, Assignment Help, Ask Question on Eequivalences rules, Get Answer, Expert's Help, Eequivalences rules Discussions

Write discussion on Eequivalences rules
Your posts are moderated
Related Questions
What is a semaphore? Semaphore: It is a protected variable or abstract data type that constitutes the typical method for restricting access to shared resources as shared memo

Q. Explain SR Latch using NOR gates? Let's inspect the latch more closely.   i. Suppose initially 1 is applied to S leaving R to 0 at this instance. The instant S=1 output o

Interfacing Subroutines with Parameter Passing Let's now write a C program which calls the assembly program for parameter passing. Let's extend the previous two programs such t

a luminous jewel game c programming start with t and end with t the output will yes or no

What are the Requirements to design Sequential circuit Ans . Design Requirements of Sequential circuit: (i) The circuit specifications translated into a state diagram

Q. Analysis of Amdahls law? The conclusions of analysis of Amdahl's law are: 1) To optimize performance of parallel computers modified compilers should be developed that sho

Assignment:  develop a calculator in MASM. Text chapters covered:  1 through 4, 5.4, 5.5, 6.3, 7.4 You will develop a "calculator" algorithm in MASM using reverse-polish nota

Explain the Optimization of data access paths Optimization is a very significant aspect of any design. The designer must do the followings for optimization: i) Add redundan

How are instructions sent between memory and the processor? Both the instruction pointer (IP) and program counter (PC) utilized to holds the memory address of the next inst

What is overflow, underflow case in single precision(sp)? Underflow-In SP it means that the normalized representation needs an exponent less than -126. Overflow-In SP it mea