Abstract

In this paper, I introduce and defend a notion of analyticity for formal languages. I first uncover a crucial flaw in Timothy Williamson’s famous argument template against analyticity, when it is applied to sentences of formal mathematical languages. Williamson’s argument targets the popular idea that a necessary condition for analyticity is that whoever understands an analytic sentence assents to it. Williamson argues that for any given candidate analytic sentence, there can be people who understand that sentence and yet who fail to assent to it. I argue that, on the most natural understanding of the notion of assent when it is applied to sentences of formal mathematical languages, Williamson’s argument fails. Formal analyticity is the notion of analyticity that is based on this natural understanding of assent. I go on to develop the notion of formal analyticity and defend the claim that there are formally analytic sentences and rules of inference. I conclude by showing the potential payoffs of recognizing formal analyticity.