Ad
related to: how to prove a valid sentence is correct error- Grammarly for Google Docs
Write your best in Google Docs.
Instant writing suggestions.
- Free Writing Assistant
Improve grammar, punctuation,
conciseness, and more.
- Grammarly for Mac
Get writing suggestions across an
array of desktop apps and websites.
- Grammarly for Business
Make every function more functional
Drive team productivity.
- Grammarly for Google Docs
Search results
Results from the WOW.Com Content Network
Here A, "this sentence is true", refers to the overall sentence, while B is "Germany borders China". So, assuming A is the same as assuming "If A, then B". Therefore, in assuming A, we have assumed both A and "If A, then B". Therefore, B is true, by modus ponens, and we have proven "If this sentence is true, then 'Germany borders China' is true ...
Another feature of an argument based on false premises that can bedevil critics, is that its conclusion can in fact be true. Consider the above example again. It may well be that it has recently rained and that the streets are wet. This does nothing to prove the first premise, but can make its claims more difficult to refute.
This proof is taken from Chapter 10, section 4, 5 of Mathematical Logic by H.-D. Ebbinghaus. As in the most common proof of Gödel's First Incompleteness Theorem through using the undecidability of the halting problem, for each Turing machine there is a corresponding arithmetical sentence , effectively derivable from , such that it is true if and only if halts on the empty tape.
The corresponding conditional of a valid argument is a logical truth and the negation of its corresponding conditional is a contradiction. The conclusion is a necessary consequence of its premises. An argument that is not valid is said to be "invalid". An example of a valid (and sound) argument is given by the following well-known syllogism:
The method of truth tables illustrated above is provably correct – the truth table for a tautology will end in a column with only T, while the truth table for a sentence that is not a tautology will contain a row whose final column is F, and the valuation corresponding to that row is a valuation that does not satisfy the sentence being tested.
The procedure may be repeated to prove that unicorns do not exist (hence proving an additional contradiction where unicorns do and do not exist), as well as any other well-formed formula. Thus, there is an explosion of true statements.
An axiomatic system is said to be consistent if it lacks contradiction.That is, it is impossible to derive both a statement and its negation from the system's axioms. Consistency is a key requirement for most axiomatic systems, as the presence of contradiction would allow any statement to be proven (principle of explo
We assume ¬¬P and seek to prove P. By the law of excluded middle P either holds or it does not: if P holds, then of course P holds. if ¬P holds, then we derive falsehood by applying the law of noncontradiction to ¬P and ¬¬P, after which the principle of explosion allows us to conclude P. In either case, we established P. It turns out that ...
Ad
related to: how to prove a valid sentence is correct error