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

Logical functions, Logical functions   We have discussed the If, 'While...

Logical functions   We have discussed the If, 'While and For' Statements, and have used expressions within our syntax i.e.           If ( expression)           Statement 1;

Prove using boolean algebra, Q. Prove using Boolean Algebra 1. AB + AC ...

Q. Prove using Boolean Algebra 1. AB + AC + BC' = AC + BC' 2. (A+B+C) (A+B'+C') (A+B+C') (A+B'+C)=A 3. (A+B) (A'+B'+C) + AB = A+B 4. A'C + A'B + AB'C + BC = C + A'B

What is a sparse matrix, What is a sparse matrix? Sparse Matrix A m...

What is a sparse matrix? Sparse Matrix A matrix in which number of zero entries is much higher than the number of non-zero entries is known as sparse matrix. The natural me

Explain the meaning of listen socket primitive, Explain the meaning of L...

Explain the meaning of LISTEN socket primitive The listen Primitive: After identifying a protocol port a server should instruct the operating system to place a socket

What are the four linq providers that .net framework ships, 1. LINQ to Obje...

1. LINQ to Objects - Implements a LINQ query against a collection of objects 2. LINQ to XML - Implements an XPATH query against XML documents 3. LINQ to SQL - Implements LINQ

Explain what is the difference among isr & function call, In ISR there is n...

In ISR there is no return value but in function call there is return value

Explain about barrier, Q. Explain about Barrier? Barrier: No actual tra...

Q. Explain about Barrier? Barrier: No actual transfer of data takes place in this mode unless all the processors involved in the communication execute a particular block, calle

What are the advantages of using structure in c program, What are the advan...

What are the advantages of using structure in C Program Declaring a struct is a two-stage process. The first stage defines a new data type that has the required structure which

Bernstein conditions for detection of parallelism, Bernstein Conditions for...

Bernstein Conditions for Detection of Parallelism For implementation of instructions or block of instructions in parallel, it should be guaranteed that the instructions are ind

Hrm, hrm digrams

hrm digrams

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