A general theory of refutation systems is given. Some applications (concerning maximality and minimality in lattices of logics) are also discussed.

Mathematicians do not claim to know a proposition unless they think they possess a proof of it. For all their confidence in the truth of a proposition with weighty non-deductive support, they maintain that, strictly speaking, the proposition remains unknown until such time as someone has proved it. This article challenges this conception of knowledge, which is quasi-universal within mathematics. We present four arguments to the effect that non-deductive evidence can yield knowledge of a mathematical proposition. We also show that (...) some of what mathematicians take to be deductive knowledge is in fact non-deductive. 1 Introduction2 Why It Might Matter3 Two Further Examples and Preliminaries4 An Exclusive Epistemic Virtue of Proof?5 Analyses of Knowledge6 The Inductive Basis of Deduction7 Physical to Mathematical Linkages8 Conclusion. (shrink)

Several philosophers—including C. S. Peirce, William James, Hilary Putnam and Crispin Wright—have proposed various versions of the notion that truth is an epistemic ideal. More specifically, they have held that a proposition is true if and only if it can be fixedly warranted by human inquirers, given certain ideal epistemic conditions. This paper offers a general critique of that idea, modeling conceptions of ideality and fixed warrant within the semantics that Kripke developed for intuitionistic logic. It is shown that each (...) of the two plausible notions of fixed warrant faces difficulties and that, moreover, “truth” defined in terms of either of them is distressingly dependent upon one’s conception of idealized inquiry and perhaps also upon one’s standards of warrant. (shrink)

This paper considers two reasons that might support Russell’s choice of a ramified-type theory over a simple-type theory. The first reason is the existence of purported paradoxes that can be formulated in any simple-type language, including an argument that Russell considered in 1903. These arguments depend on certain converse-compositional principles. When we take account of Russell’s doctrine that a propositional function is not a constituent of its values, these principles turn out to be too implausible to make these arguments troubling. (...) The second reason is conditional on a substitutional interpretation of quantification over types other than that of individuals. This reason stands up to investigation: a simple-type language will not sustain such an interpretation, but a ramified-type language will. And there is evidence that Russell was tacitly inclined towards such an interpretation. A strong construal of that interpretation opens a way to make sense of Russell’s simultaneous repudiation of propositions and his willingness to quantify over them. But that way runs into trouble with Russell’s commitment to the finitude of human understanding. (shrink)

The primary justification for mathematical structuralism is its capacity to explain two observations about mathematical objects, typically natural numbers. Non-eliminative structuralism attributes these features to the particular ontology of mathematics. I argue that attributing the features to an ontology of structural objects conflicts with claims often made by structuralists to the effect that their structuralist theses are versions of Quine’s ontological relativity or Putnam’s internal realism. I describe and argue for an alternative explanation for these features which instead explains the (...) attributes them to the mathematical practice of representing numbers using more concrete tokens, such as sets, strokes and so on. (shrink)

In the past century the received view of definition in mathematics has been the stipulative conception, according to which a definition merely stipulates the meaning of a term in other terms which are supposed to be already well known. The stipulative conception has been so absolutely dominant and accepted as unproblematic that the nature of definition has not been much discussed, yet it is inadequate. This paper examines its shortcomings and proposes an alternative, the heuristic conception.