Modus ponens rule, Computer Engineering

Modus ponens rule:

In fact the general format for the modus ponens rule is as follows: like if we have a true sentence that states the proposition A implies proposition B and we see that proposition A is true, where we can infer that proposition B is true. So the notation we use for this is as follows: 

(A→B, A)÷B

Hence it is an example of an inference rule. There is the comma above the line indicates both these things in our knowledge base so we see there the line stands for the deductive step. However, if we know there both the propositions above the line are true so we can deduce in which the proposition below the line is also true. In fact generally, an inference rule as

A ÷B

is sound  if we can be sure there that like A  entails B, i.e. B is true where A is true. In formally, there A entails B means such as if M is a model of A then M is also a model of B. Than we write this as

737_Other Equivalences1.png

After that this gives us a way to check the soundness of propositional inference rules: (i) draw up a logic table for both A and B estimating them for all models, other is (ii) check that where A is true and then B is also true. So here we don't care that about the models for which A is false.

Posted Date: 1/11/2013 5:49:18 AM | Location : United States







Related Discussions:- Modus ponens rule, Assignment Help, Ask Question on Modus ponens rule, Get Answer, Expert's Help, Modus ponens rule Discussions

Write discussion on Modus ponens rule
Your posts are moderated
Related Questions
There are two methods for organising the associative memory based on bit slices: Bit parallel organisation: In this organisation every bit slices which are not masked off,

What are interacting processes? Interacting processes: The concurrent processes executing into the operating system are cooperating or interacting processes if they can be af

Q. Why we need number systems? Number system is used to signify information in quantitative form. Some of the general number systems are octal, decimal, hexadecimal and binary.

Q. Write a program to implement NOR, NAND, XOR and XNOR gates using and without using bit wise operator. Also perform necessary checking. The user has option to give n numbe

Give some examples of malicious data.  In May 2002, the Norton Anti-Virus software for Windows operating systems detects about 61000 malicious programs. Some of them are named

State the Relative addressing The location of data is specified relative to current value of the program counter. This is helpful for specifying location of data which is given

Binary Search Now that the basic framework is working, it is time to begin implementing a few alternative search functions. Each of these search algorithms have strengths and

Contain all the cells that your UDF depends on in the argument list. Or enter this as the first statement in your Function: Application.Volatile This will cause the functi

Explain simple telephone communication system with circuit and equation of current flow in microphone? Simple Telephone Communication: In the simplest type of a telephone cir

Which of the following is the fastest logic ECL, TTL, CMOS or LSI ? Ans. The fastest logic is ECL.