Mark Balaguer argues for full blooded platonism (FBP), and argues that FBP alone can solve Benacerraf's familiar epistemic challenge. I note that if FBP really can solve Benacerraf's epistemic challenge, then FBP is not alone in its capacity so to solve; RFBP—really full blooded platonism—can do the trick just as well, where RFBP differs from FBP by allowing entities from inconsistent mathematics. I also argue briefly that there is positive reason for endorsing RFBP.

Derivationists, those wishing to explain the correctness and rigour of informal proofs in terms of associated formal proofs, are generally held to be supported by the success of the project of translating informal proofs into computer-checkable formal counterparts. I argue, however, that this project is a false friend for the derivationists because there are too many different associated formal proofs for each informal proof, leading to a serious worry of overgeneration. I press this worry primarily against Azzouni's derivation-indicator account, but (...) conclude that overgeneration is a major obstacle to a successful account of informal proofs in this direction. (shrink)

This is a book that every enthusiast for Gödel’s proofs of his incompleteness theorems will want to own. It gives an up-to-date account of connections between systems of modal logic and results on provability in formal systems for arithmetic, analysis, and set theory.

The aim of this paper is to provide epistemic reasons for investigating the notions of informal rigour and informal provability. I argue that the standard view of mathematical proof and rigour yields an implausible account of mathematical knowledge, and falls short of explaining the success of mathematical practice. I conclude that careful consideration of mathematical practice urges us to pursue a theory of informal provability.

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

An epistemic formalization of arithmetic is constructed in which certain non-trivial metatheoretical inferences about the system itself can be made. These inferences involve the notion of provability in principle, and cannot be made in any consistent extensions of Stewart Shapiro's system of epistemic arithmetic. The system constructed in the paper can be given a modal-structural interpretation.

This paper presents a defense of Epistemic Arithmetic as used for a formalization of intuitionistic arithmetic and of certain informal mathematical principles. First, objections by Allen Hazen and Craig Smorynski against Epistemic Arithmetic are discussed and found wanting. Second, positive support is given for the research program by showing that Epistemic Arithmetic can give interesting formulations of Church's Thesis.