Deductive reasoning is the process of reaching a conclusion that is guaranteed to follow, if the evidence provided is true and the reasoning used to reach the conclusion is correct. The conclusion also must be based only on the evidence previously provided; it cannot contain new information about the subject matter. Deductive reasoning was first described by the ancient Greek philosophers such as Aristotle.
Deductive is a descriptor for one type of logical reasoning. In logic, there are two broad methods of reaching a conclusion. The alternative to deductive reasoning is inductive reasoning.
Both types of reasoning are routinely employed. One difference between them is that in deductive reasoning, the evidence provided must be a set about which everything is known before the conclusion can be drawn. Since it is difficult to know everything before drawing a conclusion, deductive reasoning has limited use in the real world. This is where inductive reasoning steps in. Given a set of evidence, however incomplete the knowledge is, the conclusion is likely to follow, but one gives up the guarantee that the conclusion follows. However it does provide the ability to learn new things that are not obvious from the evidence.
Many incorrectly teach that deductive reasoning goes from the general to the specific and that inductive reasoning travels in the opposite direction.
Deductive reasoning is supported by deductive logic, for example:
The conviction that mathematicallogic is a unifying principle in computer science and that methods from different theoretical areas as well as application domains should be brought together has lead to a successful new conference: FLoC, the Federated Logic Conferences, which was held in 1999 for the second time after its initiation in 1996.
The 2001 seminar is intended to contribute to the interdisciplinary view of logic in computer science by bringing together leading scientists from various disciplines within the area of automated deduction, as well as from application areas, this time in particular from planning and program analysis and verification.
Firmly based on inter-related logic and algorithmic concepts, these areas are in the process of extending their scope from finite domain-based fixpoint computation to infinite systems where more complex forms of deductive computation are required, and where the gap to traditional forms of program verification based on induction needs to be closed.
Share your thoughts, questions and commentary here
Want to know more? Search encyclopedia, statistics and forums:
Press Releases |
The Wikipedia article included on this page is licensed under the
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m