Back Reasoning from partial Syllogism [10]
- From: "Conbra" <slwu@xxxxxxxxx>
- Date: 22 Jun 2006 16:42:05 -0700
Back Reasoning from partial Syllogism [10]
By Shilong Wu June 22, 2006
This back reasoning is to get the missing premises according to partial
premises and the conclusion. The Syllogism is invented by Aristotle 300
B.C. The traditional expression is as follow:
((A -> B) & (B -> C)) -> (A -> C)
& is logic and, -> is implication. Now we are going to remove (B -> C)
and using X to replace it. The following formula is appeared
((A -> B) & X) -> (A -> C)
This is one form of the back reasoning. The unknown variable X could be
solved. When X = ((NEW -> (B & A)) -> C), the new law is
((A -> B) & ((NEW -> (B & A)) -> C)) -> (A -> C)
the New is new appeared atomic that does not appeared at conditions.
This law can be read as (A -> C) could be reasoned from the conditions
(A -> B) and ((NEW -> (B & A)) -> C)。
More Massages see: http://groups.google.com/group/Concept-Algebra/
Welcome you to join above newsgroups to discuss Concept Algebra
Attention please:
The following backward reasoning
(X & (B -> C)) -> (A -> C)
will be appeared after tenth post.
.
- Prev by Date: CAS and interval computation and pseudo-values like infinity, undefined
- Next by Date: Re: CAS and interval computation and pseudo-values like infinity, undefined
- Previous by thread: CAS and interval computation and pseudo-values like infinity, undefined
- Index(es):
Relevant Pages
|
|
