http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
Roy T. Cook examines the Yablo paradox, a paradoxical, infinite sequence of sentences, each of which entails the falsity of all others that follow it. He focuses on questions of characterization, circularity and generalizability, and pays special attention to the idea that it provides us with a semantic paradox that involves no circularity.
Introduction : why should we care? -- Origins and mathematics. Whence the paradox? ; The Yablo paradox in arithmetic ; The Yablo paradox and pointer semantics ; Paradoxes and graph theory ; The characterization problem -- The Yablo paradox and circularity. What is circularity? ; Circularity and non-well-founded sets ; The Yablo paradox is circular? ; A truly non-circular paradox ; Objections to the construction defused -- Generalizing the Yablo paradox. Sorensen's purge ; Unwindings in pointer semantics ; Unwindings in arithmetic ; The failure of unwindings ; Prospects for the purge -- The Curry generalization.
Includes bibliographical references and index.