Proof by deduction is simple. For example:
All humans are mortal, and Bill is a human; Therefore, Bill is mortal.
However, proof by abduction differs. A famous example:
The lawn is wet. But if it rained last night, then it would be unsurprising that the lawn is wet. Therefore, by abductive reasoning, it rained last night.
There seems like a subtle difference, but it's actually huge as abduction is uncertain rather than certain.
Question 1
Are there examples of mathematical problems that have been proven by only abduction, rather than by deduction or induction?
Question 2
If there are examples of this, are they limited to problems related to probability?
Thanks.
These are very nice questions but what exactly do you mean by
"Are there examples of mathematical problems that have been proven by abduction...?"
Would you accept any abductive inference as "proof" if things are uncertain? Most likely it would only lead to justifications for further pursuit, which is its strength and purpose. Moreover, if the problem is of a hard problem of organized complexity, dealing with complex adaptive systems in general, the interconnectivity in "chains of reasoning" will become more and more evident, which can be corroborated through deduction, induction and recursion with modification. For example, one can start by asking how much connectivity one should expect of natural processes and math can be one tool that may be used to solve such problems.
Examples of the type, "the lawn is wet", tend to mask the complexity of this very important integrative quality that depends so much on sensibility/intuition.