Commutatively of connectives - artificial intelligence, Computer Engineering

Commutatively of Connectives

You will be aware from the fact that some arithmetic operators have a property that it does not matter which way around you give the operator input. We call this property commutatively. For instance, when adding 2 numbers, it does not matter which one comes first, because a+b = b+a forall b and a. The similar is true for multiplication but not true for divisionand subtraction.

The ∧,∨ and <-> connectives (which operate on two sub sentences), also have the commutatively property. We can express this with 3 tautologies:

P ∧ Q ≡ Q∧ P

P ∨ Q ≡ Q ∨P

P <-> Q = Q <-> P

So, if it helps to do so, whenever we see P ∧ Q, we may rewrite it as Q ∧ P, and similarly for the other 2 commutative connectives.

Posted Date: 10/2/2012 7:47:06 AM | Location : United States







Related Discussions:- Commutatively of connectives - artificial intelligence, Assignment Help, Ask Question on Commutatively of connectives - artificial intelligence, Get Answer, Expert's Help, Commutatively of connectives - artificial intelligence Discussions

Write discussion on Commutatively of connectives - artificial intelligence
Your posts are moderated
Related Questions
Write a program that computes the minimum and maximum of elements in an array in Assembly 8086.

scan line seed fill algorithm program using opengl

please suggest me ,how to write microopertions,and study for computer architecture

Q. What do you mean by Loader? Loader is a program that assigns absolute addresses to program. These addresses are produced by adding the address from where program is loaded i

Sun and Ni's Law The Sun and Ni's Law is a generalization of Amdahl's Law as well as Gustafson's Law. The fundamental idea underlying the Sun and Ni's Law is to find the soluti

Distributivity of Connectives : In our last analogy with arithmetic will involve a very well-technique need for playing around with algebraic properties. But assume there if w

RDBMS relational database system - Relational databases are composed of relations and managed through relational operations, and governed through data integrity constraints.

i want flowchart for push, pop in stack element and display stack and exit

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

Explain the T Flip Flop? The toggle, or T, flip-flop is the bistable device that changes state on command from a common input terminal.   Truth Table