Maximally Consistent Sets of Instances of Naive Comprehension

Mind 126 (502) (2017)
  Copy   BIBTEX


Paul Horwich (1990) once suggested restricting the T-Schema to the maximally consistent set of its instances. But Vann McGee (1992) proved that there are multiple incompatible such sets, none of which, given minimal assumptions, is recursively axiomatizable. The analogous view for set theory---that Naïve Comprehension should be restricted according to consistency maxims---has recently been defended by Laurence Goldstein (2006; 2013). It can be traced back to W.V.O. Quine(1951), who held that Naïve Comprehension embodies the only really intuitive conception of set and should be restricted as little as possible. The view might even have been held by Ernst Zermelo (1908), who,according to Penelope Maddy (1988), subscribed to a ‘one step back from disaster’ rule of thumb: if a natural principle leads to contra-diction, the principle should be weakened just enough to block the contradiction. We prove a generalization of McGee’s Theorem, anduse it to show that the situation for set theory is the same as that for truth: there are multiple incompatible sets of instances of Naïve Comprehension, none of which, given minimal assumptions, is recursively axiomatizable. This shows that the view adumbrated by Goldstein, Quine and perhaps Zermelo is untenable.

Author Profiles

Luca Incurvati
University of Amsterdam
Julien Murzi
University of Salzburg


Added to PP

845 (#9,839)

6 months
72 (#20,908)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?