Abstract

In this paper I argue that Feferman's theorem does not signify the existence of skeptic-satisfying consistency proofs. However, my argument for this is much different than other arguments (most particularly Resnik's) for the same claim. The argument that I give arises form an analysis of the notion of 'expression', according to which the specific character of that notion is seen as varying from one context of application (of a result of arithmetic metamathematics) to another.