Associativity of connectives - equivalences rules, Computer Engineering

Associativity of Connectives :

Here brackets are very important in order to tell us where to perform calculations in arithmetic and logic. By using these brackets we evaluate the truth of sentences in logic. By assuming , we want to add 10, 5 and 7. So now we could do this: (10 + 5) + 7 = 22. Otherwise we could do this: 10 + (5 + 7) = 22. So in such case, we can alter the bracketing and then the answer still comes out the same. It good complement to say that addition is associative it means that it has this property with respect to bracketing. 

The ^ and ? connectives are as associative. Because this makes sense, and the order in that we check truth values doesn't matter where we are working with sentences only involving  ?  or ^only involving  . For case in point expect that we wanted to know the truth of P ^  (Q ^  R). Rather than any other action, we just find to check that every proposition is true, such case the whole sentence will be true, or else the whole sentence will be false. There is no matter how the brackets are arranged, and hence the ^ is associative.

Posted Date: 1/11/2013 5:36:56 AM | Location : United States

Related Discussions:- Associativity of connectives - equivalences rules, Assignment Help, Ask Question on Associativity of connectives - equivalences rules, Get Answer, Expert's Help, Associativity of connectives - equivalences rules Discussions

Write discussion on Associativity of connectives - equivalences rules
Your posts are moderated
Related Questions
Define port? Give types of port available? Ans: An I/O interface consists of circuitry needed to connect an I/O device to computer bus. One side consists of a data path contain

What is memory controller? A memory controller is a circuit which is interposed among the processor and the dynamic memory. It is used for performing multiplexing of address bi

Q. What do you mean by Communication Traffic? Communication Traffic offers a pictorial view of communication traffic in interconnection network with respect to time in progress

Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of

Learning Abilities of Perceptrons: Conversely computational learning theory is the study of what concepts particular learning schemes as representation and method detail as a

What are the methods for handling deadlocks?  The deadlock problem can be dealt with in one of the three ways:  a. Use a protocol to prevent or avoid deadlocks, make sure th

What are multi-cycle paths? Multi-cycle paths are paths among registers which take more than one clock cycle to turn out to be stable. For illustration analyzing the de

In the Byteland country a string "s" is said to super ascii string if and only if count of each charecter in the string is equal to its ascci value in the byteland country ascii co

Determine the types of software There are two types of software today: Application and systems. Meaning of the two changes computer to computer. As we concentrate on large c