Remarks on the Lucky Proof Problem

The Leibniz Review 27:1-19 (2017)
  Copy   BIBTEX

Abstract

Several scholars have argued that Leibniz’s infinite analysis theory of contingency faces the Problem of Lucky Proof. This problem will be discussed here and a solution offered, trying to show that Leibniz’s proof-theory does not generate the alleged paradox. It will be stressed that only the opportunity to be proved by God, and not by us, is relevant to the issue of modality. At the heart of our proposal lies the claim that, on the one hand, Leibniz’s individual concepts are saturated conceptual conjunctions, i.e., infinite conjunctions that contain either the concept itself or its privation for every primitive concept; and that, on the other hand, also certain universal concepts of states and acts are infinite conjunctions of primitive concepts and privations, even if insaturated ones. This will suffice to allow that some truths regarding individuals can’t be demonstrated, although they are included in the concept of their subject.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Infinite analysis, lucky proof, and guaranteed proof in Leibniz.Gonzalo Rodriguez-Pereyra & Paul Lodge - 2011 - Archiv für Geschichte der Philosophie 93 (2):222-236.
Messeri on the Lucky Proof.Stephen Steward - 2017 - The Leibniz Review 27:21-30.
No Luck With Knowledge? On a Dogma of Epistemology.Peter Baumann - 2012 - Philosophy and Phenomenological Research 89 (3):523-551.
Zur diskussion.[author unknown] - 1999 - Archiv für Geschichte der Philosophie 81 (3):316-328.
Later Wittgenstein on Logical Rules.Tomas Cana - 2011 - Filozofia 66 (2):109-121.
Why agent-caused actions are not lucky.Meghan Griffith - 2010 - American Philosophical Quarterly 47 (1):43-56.
Proof Analysis: A Contribution to Hilbert's Last Problem.Sara Negri & Jan von Plato - 2011 - Cambridge and New York: Cambridge University Press. Edited by Jan Von Plato.
Pool resolution is NP-hard to recognize.Samuel R. Buss - 2009 - Archive for Mathematical Logic 48 (8):793-798.
On the complexity of proof deskolemization.Matthias Baaz, Stefan Hetzl & Daniel Weller - 2012 - Journal of Symbolic Logic 77 (2):669-686.

Analytics

Added to PP
2018-05-17

Downloads
40 (#396,386)

6 months
5 (#626,659)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references