Replacement and substitution, Computer Engineering

Assignment Help:

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.


Related Discussions:- Replacement and substitution

How do active web pages work, How do active web pages work? Describe with a...

How do active web pages work? Describe with a small example. Active Web Pages: An active document is not completely specified through the server. Instead an active documen

Evaluate 23 - 48 using the 2's complement method, Perform the 23 - 48 opera...

Perform the 23 - 48 operations using the 2's complement method. Ans. Given 23 - 48 firstly add them       23                         0 1 0 1 1 1 - (- 48)                     +

What is a diagonalization language ld, What is a Diagonalization language L...

What is a Diagonalization language LD?  The  diagonalization  language  having  of  all  strings  w  such  that  the  TM  whose  code is w does not accept when w is given as in

What are the advantages of public key cryptography, What are the advantages...

What are the advantages of Public Key Cryptography? Advantages of Public Key Cryptography are illustrated in below: a) Increased convenience and security and b) Electro

Define word/byte rotation and xor bit masking encryption, Define Word/byte ...

Define Word/byte rotation and XOR bit masking encryption technique to make sure secured transactions on the net? Word/byte rotation and XOR bit masking: In this process t

Define rules for evaluating the boolean expression, Define Rules For Evalua...

Define Rules For Evaluating the Boolean Expression? Generally, the following rules must always be followed when evaluating the Boolean expression: Primary, perform all in

Define the term package- object oriented modeling, Define the term package-...

Define the term package- object oriented modeling A package is a common purpose mechanism for organising elements into groups. Package can also contain other packages. The no

COA, During instruction execution, there are other parts of the CPU that ca...

During instruction execution, there are other parts of the CPU that can determine when a physical register might be freed. Briefly describe where else we can put freeing logic and

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd