# natural deduction

noun
1.
a system of formal logic that has no axioms but permits the assumption of premises of an argument. Such a system uses sequents to record which assumptions are operative at any stage Compare axiomatic (sense 3)
Collins English Dictionary - Complete & Unabridged 2012 Digital Edition
Publishers 1998, 2000, 2003, 2005, 2006, 2007, 2009, 2012
Cite This Source
Examples from the Web for natural deduction
Historical Examples
• Longman's eyebrows went up affirmatively, but he at once opposed the natural deduction from her observation.

Albert Edwards
• I leave the natural deduction from these facts, to be made by the reader.

• The facts are those which have come under his personal observation: the inference is but a plain and natural deduction.

William W. Sanger
• Having once granted this, the natural deduction followed that if a girl was fit to rule at eighteen, a boy was fit to rule sooner.

W. H. Koebel
• This would be the natural deduction to draw from the premise of evolution.

Antonio Fogazzaro
• This was, indeed, the most natural deduction for Nick to arrive at, after considering all the circumstances.

Nicholas Carter
• These premises, however colored, were logical enough in this—the natural deduction sprang out and greeted the eye.

Edgar Saltus
• The natural deduction from this is that the main settlement of the Antiphoner of the Mass fell within the same period.

E. G. P. Wyatt
• No, sir; and, also based on the natural deduction because I adore mystery stories and it just doesn't make any sense.

The President's Commission on the Assassination of President Kennedy
natural deduction in Technology
logic
A set of rules expressing how valid proofs may be constructed in predicate logic.
In the traditional notation, a horizontal line separates premises (above) from conclusions (below). Vertical ellipsis (dots) stand for a series of applications of the rules. "T" is the constant "true" and "F" is the constant "false" (sometimes written with a LaTeX \perp).
"^" is the AND (conjunction) operator, "v" is the inclusive OR (disjunction) operator and "/" is NOT (negation or complement, normally written with a LaTeX \neg).
P, Q, P1, P2, etc. stand for propositions such as "Socrates was a man". P[x] is a proposition possibly containing instances of the variable x, e.g. "x can fly".
A proof (a sequence of applications of the rules) may be enclosed in a box. A boxed proof produces conclusions that are only valid given the assumptions made inside the box, however, the proof demonstrates certain relationships which are valid outside the box. For example, the box below labelled "Implication introduction" starts by assuming P, which need not be a true proposition so long as it can be used to derive Q.
Truth introduction:
- T
(Truth is free).
Binary AND introduction:
----------- | . | . | | . | . | | Q1 | Q2 | ----------- Q1 ^ Q2
(If we can derive both Q1 and Q2 then Q1^Q2 is true).
N-ary AND introduction:
---------------- | . | .. | . | | . | .. | . | | Q1 | .. | Qn | ---------------- Q1^..^Qi^..^Qn
Other n-ary rules follow the binary versions similarly.
Quantified AND introduction:
--------- | x . | | . | | Q[x] | --------- For all x . Q[x]
(If we can prove Q for arbitrary x then Q is true for all x).
Falsity elimination:
F - Q
(Falsity opens the floodgates).
OR elimination:
P1 v P2 ----------- | P1 | P2 | | . | . | | . | . | | Q | Q | ----------- Q
(Given P1 v P2, if Q follows from both then Q is true).
Exists elimination:
Exists x . P[x] ----------- | x P[x] | | . | | . | | Q | ----------- Q
(If Q follows from P[x] for arbitrary x and such an x exists then Q is true).
OR introduction 1:
P1 ------- P1 v P2
(If P1 is true then P1 OR anything is true).
OR introduction 2:
P2 ------- P1 v P2
(If P2 is true then anything OR P2 is true). Similar symmetries apply to ^ rules.
Exists introduction:
P[a] ------------- Exists x.P[x]
(If P is true for "a" then it is true for all x).
AND elimination 1:
P1 ^ P2 ------- P1
(If P1 and P2 are true then P1 is true).
For all elimination:
For all x . P[x] ---------------- P[a]
(If P is true for all x then it is true for "a").
For all implication introduction:
----------- | x P[x] | | . | | . | | Q[x] | ----------- For all x . P[x] -> Q[x]
(If Q follows from P for arbitrary x then Q follows from P for all x).
Implication introduction:
----- | P | | . | | . | | Q | ----- P -> Q
(If Q follows from P then P implies Q).
NOT introduction:
----- | P | | . | | . | | F | ----- / P
(If falsity follows from P then P is false).
NOT-NOT:
//P --- P
(If it is not the case that P is not true then P is true).
For all implies exists:
P[a] For all x . P[x] -> Q[x] ------------------------------- Q[a]
(If P is true for given "a" and P implies Q for all x then Q is true for a).
Implication elimination, modus ponens:
P P -> Q ---------- Q
(If P and P implies Q then Q).
P /P ------ F
(If P is true and P is not true then false is true).
(1995-01-16)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

### Word Value for natural

7
10
Scrabble Words With Friends