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
Design a 32:1 multiplexer using two 16:1 multiplexers and a 2:1 multiplexer Ans. Design a 32 X 1 MUX by using two 16 X 1 MUX and one 2 X 1. Now here total 32 input lines

Describe session handling in a web farm, how does it work and what are the limits ?   In ASP.NET there are three ways to handle session objects. Single support the in-proc mec

What is race around condition? Ans: Race Around Condition:- Jn Kn Q(n+1) output   0 1 0 1   0 0

write a program to find the area under the curve y=f(x) between x=a and x=b,integrate y=f(x) between the limits of a and b

Question : a) Visual communication was first developed in pre-history. Write short notes on the following terms: i. Geoglyph ii. Petroglyphs b) Briefly describe the p

These days, they're pretty much obsolete; they're definitely system-particular. They had to do with 16-bit programming under MS-DOS and perhaps some early on versions of Windows. I

Q. Explain FORM and INPUT Tag? A good way to learn about forms is to make use your notepad editor and make a new HTML document. Save it as form1.htm in some folder somewhere. Y

Which property on a Combo Box do you set with a column name, prior to setting the Data Source, to display data in the combo box? ComboBox.DataValueField = "ColumnName" When

How many flip flops are required to construct a decade counter ? Ans. 4 FlipFlop's are required because decade counter counts 10 states from 0 to 9 (that is from 0000 to 1001).

Build data Flow diagrams showing functional dependencies Data flow diagrams are very useful for showing functional dependencies. In data flow diagrams processes are indicated