Deduction - Revision history

Conservative at 19:47, September 3, 2019

2019-09-03T19:47:30Z

Conservative at 19:47, September 3, 2019

2019-09-03T19:47:13Z

Conservative at 19:45, September 3, 2019

2019-09-03T19:45:23Z

DavidB4-bot: /* top */clean up & uniformity

2016-07-13T11:31:59Z

top: clean up & uniformity

DavidB4-bot: /* Truth Values in Sentential Logic */Spelling/Grammar Check, typos fixed: millenia → millennia

2016-07-12T18:56:21Z

Truth Values in Sentential Logic: Spelling/Grammar Check, typos fixed: millenia → millennia

PatternOfPersona: multiple minor edits, some presentational edits, and some objective additions.

2013-12-17T16:14:40Z

multiple minor edits, some presentational edits, and some objective additions.

Dvergne: Undo revision 1019168 by JLefkowitz (talk)

2012-11-18T02:49:31Z

Undo revision 1019168 by JLefkowitz (talk)

JLefkowitz: Blanked the page

2012-11-18T02:38:56Z

Blanked the page

Rcgallup at 05:47, January 15, 2010

2010-01-15T05:47:22Z

Jpatt: Reverted edits by DWiggins (Talk) to last version by PatrickD

2009-10-31T02:39:04Z

Reverted edits by DWiggins (Talk) to last version by PatrickD

← Older revision		Revision as of 19:47, September 3, 2019
Line 4:		Line 4:

	The normal contrast to deduction is [[induction]], whereby the two are posed as distinct opposites. However, they are not so distinct as to be alien to each other. Rather, induction and deduction have a single common root from which they necessarily are operationally distinguished: the mind. So, in regard to formal logic in this root sense, a merely mechanical or electronic simulator of genuine mental operations does not possess either any actual deductive or actual inductive logic.		The normal contrast to deduction is [[induction]], whereby the two are posed as distinct opposites. However, they are not so distinct as to be alien to each other. Rather, induction and deduction have a single common root from which they necessarily are operationally distinguished: the mind. So, in regard to formal logic in this root sense, a merely mechanical or electronic simulator of genuine mental operations does not possess either any actual deductive or actual inductive logic.
−

	The most famous formal deductive rule goes as follows:		The most famous formal deductive rule goes as follows:

@@ Line 18: / Line 18: @@
 #Therefore, Q is not true.
-..
+The Internet Encyclopedia of Philosophy says concerning deductive reasoning:
+{{Cquote|A deductive argument is an argument that is intended by the arguer to be deductively valid, that is, to provide a guarantee of the truth of the conclusion provided that the argument's premises are true. This point can be expressed also by saying that, in a deductive argument, the premises are intended to provide such strong support for the conclusion that, if the premises are true, then it would be impossible for the conclusion to be false. An argument in which the premises do succeed in guaranteeing the conclusion is called a (deductively) valid argument. If a valid argument has true premises, then the argument is said also to be sound. All arguments are either valid or invalid, and either sound or unsound; there is no middle ground, such as being somewhat valid.
 Here is a valid deductive argument:
@@ Line 27: / Line 26: @@
 The conclusion follows the word "So". The two premises of this argument would, if true, guarantee the truth of the conclusion. However, we have been given no information that would enable us to decide whether the two premises are both true, so we cannot assess whether the argument is deductively sound. It is one or the other, but we do not know which. If it turns out that the argument has a false premise and so is unsound, this won't change the fact that it is valid.
 == Truth Values in Sentential Logic ==

← Older revision		Revision as of 19:45, September 3, 2019
Line 18:		Line 18:
	#Therefore, Q is not true.		#Therefore, Q is not true.

		+	..
		+
		+	A deductive argument is an argument that is intended by the arguer to be deductively valid, that is, to provide a guarantee of the truth of the conclusion provided that the argument's premises are true. This point can be expressed also by saying that, in a deductive argument, the premises are intended to provide such strong support for the conclusion that, if the premises are true, then it would be impossible for the conclusion to be false. An argument in which the premises do succeed in guaranteeing the conclusion is called a (deductively) valid argument. If a valid argument has true premises, then the argument is said also to be sound. All arguments are either valid or invalid, and either sound or unsound; there is no middle ground, such as being somewhat valid.
		+
		+	Here is a valid deductive argument:
		+
		+	It's sunny in Singapore. If it's sunny in Singapore, then he won't be carrying an umbrella. So, he won't be carrying an umbrella.
		+
		+	The conclusion follows the word "So". The two premises of this argument would, if true, guarantee the truth of the conclusion. However, we have been given no information that would enable us to decide whether the two premises are both true, so we cannot assess whether the argument is deductively sound. It is one or the other, but we do not know which. If it turns out that the argument has a false premise and so is unsound, this won't change the fact that it is valid.

	== Truth Values in Sentential Logic ==		== Truth Values in Sentential Logic ==

@@ Line 1: / Line 1: @@
 A '''deduction''' in [[formal logic]] is a way of proving a proposition. Specifically, when a conclusion is inferred from premises or facts, it is said to "follow" (''like the water downstream to the spring source''), from previously stated propositions via certain logical rules.
-Deduction is used most often in geometry, but also has its place in philosophy and law. Deduction is often un-used in science, as deduction requires that one have certainty of truth of both the major and minor premises--something science is unwilling to make claims about.
+Deduction is used most often in geometry, but also has its place in philosophy and law. Deduction is often un-used in science, as deduction requires that one have certainty of truth of both the major and minor premises—something science is unwilling to make claims about.
 The normal contrast to deduction is [[induction]], whereby the two are posed as  distinct opposites. However, they are not so distinct as to be alien to each other. Rather, induction and deduction have a single common root from which they necessarily are operationally distinguished: the mind. So, in regard to formal logic in this root sense, a merely mechanical or electronic simulator of genuine mental operations does not possess either any actual deductive or actual inductive logic.

@@ Line 27: / Line 27: @@
 The final two are rooted in the fact that the consequent following from an antecedent that is not true says nothing about the truth or falsity of the statement, it must be ''assumed'' to be true.
-Aristotle codified the rules of syllogistic deduction two millenia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:
+Aristotle codified the rules of syllogistic deduction two millennia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:
 #All men are mortal.
@@ Line 33: / Line 33: @@
 #Therefore, Socrates is mortal.
-[[category:logic]]
+[[Category:Logic]]
 See also:
 * [[induction]]
 * [[proof by contradiction]]

@@ Line 1: / Line 1: @@
-A '''deduction''' in [[formal logic]] is a way of proving a proposition. It is used most often in geometry, but also has its place in philosophy and law. It is often unused in science as it requires that one have certainty of truth of both the major and minor premises--something science is unwilling to make claims about.
+A '''deduction''' in [[formal logic]] is a way of proving a proposition. Specifically, when a conclusion is inferred from premises or facts, it is said to "follow" (''like the water downstream to the spring source''), from previously stated propositions via certain logical rules.
-When a conclusion is inferred from premises or facts, it is said to "follow" from previously stated propositions via certain logical rules.
+Deduction is used most often in geometry, but also has its place in philosophy and law. Deduction is often un-used in science, as deduction requires that one have certainty of truth of both the major and minor premises--something science is unwilling to make claims about.
-The most famous rule goes as follows:
+The normal contrast to deduction is [[induction]], whereby the two are posed as  distinct opposites. However, they are not so distinct as to be alien to each other. Rather, induction and deduction have a single common root from which they necessarily are operationally distinguished: the mind. So, in regard to formal logic in this root sense, a merely mechanical or electronic simulator of genuine mental operations does not possess either any actual deductive or actual inductive logic.
 #A is true.
@@ Line 22: / Line 25: @@
 F implies T,  True
-The final two are rooted in the fact that the consequent following from an antecedent that is not true says nothing about the truth or falsity of the statement, it must be assumed to be true.
+The final two are rooted in the fact that the consequent following from an antecedent that is not true says nothing about the truth or falsity of the statement, it must be ''assumed'' to be true.
 Aristotle codified the rules of syllogistic deduction two millenia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:

← Older revision	Revision as of 02:49, November 18, 2012
Line 1:	Line 1:
	+	A '''deduction''' in [[formal logic]] is a way of proving a proposition. It is used most often in geometry, but also has its place in philosophy and law. It is often unused in science as it requires that one have certainty of truth of both the major and minor premises--something science is unwilling to make claims about.

	+	When a conclusion is inferred from premises or facts, it is said to "follow" from previously stated propositions via certain logical rules.
	+
	+	The most famous rule goes as follows:
	+
	+	#A is true.
	+	#If A is true, then B is true.
	+	#Therefore, B is true.
	+
	+	Another type of deduction, known as "[[proof by contradiction]]", is:
	+
	+	#If Q is true, then R is true.
	+	#R is not true.
	+	#Therefore, Q is not true.
	+
	+
	+	== Truth Values in Sentential Logic ==
	+	T implies T, True
	+	T implies F, False
	+	F implies F, True
	+	F implies T, True
	+
	+	The final two are rooted in the fact that the consequent following from an antecedent that is not true says nothing about the truth or falsity of the statement, it must be assumed to be true.
	+
	+	Aristotle codified the rules of syllogistic deduction two millenia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:
	+
	+	#All men are mortal.
	+	#Socrates is a man.
	+	#Therefore, Socrates is mortal.
	+
	+	[[category:logic]]
	+
	+	See also:
	+	* [[induction]]
	+	* [[proof by contradiction]]

← Older revision		Revision as of 02:38, November 18, 2012
Line 1:		Line 1:
−	A '''deduction''' in [[formal logic]] is a way of proving a proposition. It is used most often in geometry, but also has its place in philosophy and law. It is often unused in science as it requires that one have certainty of truth of both the major and minor premises--something science is unwilling to make claims about.

−	~~When a conclusion is inferred from premises or facts, it is said to "follow" from previously stated propositions via certain logical rules.~~
−
−	~~The most famous rule goes as follows:~~
−
−	~~#A is true.~~
−	~~#If A is true, then B is true.~~
−	~~#Therefore, B is true.~~
−
−	~~Another type of deduction, known as "[[proof by contradiction]]", is:~~
−
−	~~#If Q is true, then R is true.~~
−	~~#R is not true.~~
−	~~#Therefore, Q is not true.~~
−
−
−	~~== Truth Values in Sentential Logic ==~~
−	~~T implies T, True~~
−	~~T implies F, False~~
−	~~F implies F, True~~
−	~~F implies T, True~~
−
−	~~The final two are rooted in the fact that the consequent following from an antecedent that is not true says nothing about the truth or falsity of the statement, it must be assumed to be true.~~
−
−	~~Aristotle codified the rules of syllogistic deduction two millenia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:~~
−
−	~~#All men are mortal.~~
−	~~#Socrates is a man.~~
−	~~#Therefore, Socrates is mortal.~~
−
−	~~[[category:logic]]~~
−
−	~~See also:~~
−	* [[induction]]
−	* [[proof by contradiction]]

@@ Line 8: / Line 8: @@
 #If A is true, then B is true.
 #Therefore, B is true.
 Aristotle codified the rules of syllogistic deduction two millenia ago in [[Ancient Greece]]. He created 256 forms of syllogisms relating to groups of things. For example, an AAA1 syllogism:
@@ Line 19: / Line 25: @@
 See also:
 * [[induction]]