Infinite analysis, lucky proof, and guaranteed proof in Leibniz

Download Edit this record How to cite View on PhilPapers
Abstract
According to one of Leibniz's theories of contingency a proposition is contingent if and only if it cannot be proved in a finite number of steps. It has been argued that this faces the Problem of Lucky Proof , namely that we could begin by analysing the concept ‘Peter’ by saying that ‘Peter is a denier of Christ and …’, thereby having proved the proposition ‘Peter denies Christ’ in a finite number of steps. It also faces a more general but related problem that we dub the Problem of Guaranteed Proof . We argue that Leibniz has an answer to these problems since for him one has not proved that ‘Peter denies Christ’ unless one has also proved that ‘Peter’ is a consistent concept, an impossible task since it requires the full decomposition of the infinite concept ‘Peter’. We defend this view from objections found in the literature and maintain that for Leibniz all truths about created individual beings are contingent
Keywords
No keywords specified (fix it)
Categories
PhilPapers/Archive ID
LODIAL
Upload history
First archival date: 2011-06-09
Latest version: 1 (2015-11-21)
View other versions
Added to PP
2011-06-06

Downloads
597 (#12,578)

6 months
27 (#32,155)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?