Advertisement

Journal of Philosophical Logic

, Volume 43, Issue 5, pp 827–834 | Cite as

Yablifying the Rosser Sentence

  • Graham Leach-Krouse
Article

Abstract

In a recent paper (Cieśliński and Urbaniak 2012), Urbaniak and Cieśliński describe an analogue of the Yablo Paradox, in the domain of formal provability. Just as the infinite sequence of Yablo sentences inherit the paradoxical behavior of the liar sentence, an infinite sequence of sentences can be constructed that inherit the distinctive behavior of the Gödel sentence. This phenomenon—the transfer of the properties of self-referential sentences of formal mathematics to their “unwindings” into infinite sequences of sentences—suggests a number of interesting logical questions. The purpose of this paper is to give a precise statement of a conjecture from Cieśliński and Urbaniak (2012) regarding the unwinding of the Rosser sentence, and to demonstrate that this precise statement is false. We begin with some preliminary motivation, introduce the conjecture against the background of some related results, and finally, in the last section, move on to the proof, which adapts a method used by Solovay and Guaspari.

Keywords

Paradoxes Incompleteness Truth Yablo’s paradox Gödel’s theorem Rosser’s theorem Self-reference Well-foundedness 

Notes

Acknowledgments

Thanks to Chris Porter and an anonymous reviewer for helpful comments and editorial suggestions; thanks to Tim Bays, Mic Detlefsen, Curtis Franks, Chris Porter, Tony Strimple and Sean Walsh for invaluable discussion and advice. This research was partially funded by EMSW21-RTG-0838506.

References

  1. 1.
    Cieśliński, C., & Urbaniak, R. (2012). Gödelizing the Yablo sequence. Journal of Philosophical Logic, 43. doi: 10.1007/s10992-012-9244-4. http://link.springer.com/journal/10992/onlineFirst/page/1.
  2. 2.
    Feferman, S. (1960). Arithmetization of metamathematics in a general setting. Fundamenta Mathematicae, 49, 35–91.Google Scholar
  3. 3.
    Guaspari, D., & Solovay, R.M. (1979). Rosser sentences. Annals of Mathematical Logic, 16, 81–99.CrossRefGoogle Scholar
  4. 4.
    Leach-Krouse, G. (2011). Yablo’s paradox and arithmetical incompleteness. arXiv.org preprint arXiv:1110.2056.
  5. 5.
    Lindström, P. (1997). Aspects of incompleteness: Lecture notes in logic 10. New york: Springer.CrossRefGoogle Scholar
  6. 6.
    Rabern, B., Rabern, L., Macaulley, M. (2012). Dangerous reference graphs and semantic paradoxes. Journal of Philosophical Logic. doi:http://dx.doi.org/10.1007/s10992-012-9246-2.

Copyright information

© Springer Science+Business Media Dordrecht 2013

Authors and Affiliations

  1. 1.Kansas State UniversityManhattanUSA

Personalised recommendations