Jump to ContentJump to Main Navigation
The Yablo ParadoxAn Essay on Circularity$
Users without a subscription are not able to see the full content.

Roy T Cook

Print publication date: 2014

Print ISBN-13: 9780199669608

Published to Oxford Scholarship Online: September 2014

DOI: 10.1093/acprof:oso/9780199669608.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 22 April 2019

Origins and Mathematics

Origins and Mathematics

(p.11) 1 Origins and Mathematics
The Yablo Paradox

Roy T Cook

Oxford University Press

This chapter presents the origin, history, and mathematics of the Yablo paradox. Careful formulations of the paradox within both arithmetic and a pointer semantics-based language are presented, as well as a number of formal results and philosophical observations that will be critical in the chapters to follow (e.g. the fact that the Yablo paradox, formulated in Peano arithmetic with a truth predicate, is not inconsistent, but merely ω-inconsistent). This chapter also provides a partial solution to the Characterization Problem (for the pointer semantics language) and shows how this problem is equivalent to an outstanding problem in the theory of directed graphs— that of determining whether a directed graph has a kernel.

Keywords:   Yablo paradox, arithmetic, pointer semantics, truth, directed graphs

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .