Replacement and substitution, Computer Engineering

Replacement and substitution:

However, equivalences allow us to change one sentence with another without affecting the meaning, it means we know already that replacing one side of an equivalence into the other will have no effect so whatever on the semantics: but it will still be true for the same models. Just assume there we have a sentence S with a sub expression A that we write like S[A]. But there if we know A≡B so we can be sure the semantics of S is unaffected because we replace A with B, i.e. S[A] ≡S[B]. 

However, there we can also use A ≡B to replace any sub expression of S that is an instance of A. But there point to be remember that an instance of a propositional expression A is a 'copy' of A when some of the propositions of have been consistently replaced by original  sub expressions, e.g. to every P has been replaced by ¬Q. So than we call this replacement a substitution, and a mapping from propositions to expressions. Through applying a substitution U to a sentence S,  we find a new sentence S.U that is an instance of S. There always Ii is easy to show that if there A ≡B so A.U ≡B.U just for any substitution U, that is. an instance of an equivalence is as well an equivalence. Thus, an equivalence A ≡B allows us to change a sentence S[A'] to a logically and fundamentally equivalent one S[B'] but if we have substitution U like that A' = A.U and B' = B.U.

Posted Date: 1/11/2013 5:32:22 AM | Location : United States







Related Discussions:- Replacement and substitution, Assignment Help, Ask Question on Replacement and substitution, Get Answer, Expert's Help, Replacement and substitution Discussions

Write discussion on Replacement and substitution
Your posts are moderated
Related Questions
Explain the working of BCD adder One of the ways of adding decimal numbers in BCD is to use a 4-bit binary adder and perform arithmetic operation one digit at a time. The low-o


Define ROM? It is a non-volatile memory. It includes only reading of stored data.

END DIRECTIVE: ENDS directive ends a segment and ENDP directive ends a procedure and END directive ends whole program which appears as last statement. ASSUME Directive:   An .

With reference to telephone traffic, explain the terms GOS. GOS: in loss systems, the traffic carried through the network is usually lower than the actual traffic offered to

what is Ambiguity in single inheritance

Explain Erasable Programmable ROM (EPROM) - Computer Memory? An EPROM is a ROM that can be reprogrammed and erased. A little glass window is installed at the top of the ROM pac

Define the three prime processes of uml The three prime processes were OMT (Rumbaugh), OOSE (Jacobson) and Booch. OMT was strong in analysis, while Booch was strong in design a

Explain Top down parsing. Top down parsing: Specified an input string, top down parsing tries to derive a string identical to this by successive application of grammar rule

Q. What is Keyboard Layout? A keyboard layout is arrangement of keys across the keyboard. There is one keyboard layout which anybody who has worked on a standard keyboard or ty