Switch to: Citations

Add references

You must login to add references.
  1. Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.
    Download  
     
    Export citation  
     
    Bookmark   205 citations  
  • Yablo's paradox.Graham Priest - 1997 - Analysis 57 (4):236-242.
    Download  
     
    Export citation  
     
    Bookmark   63 citations  
  • Intensionality from Self-Reference.T. Parent - manuscript
    If a semantically open language has no constraints on self-reference, one can prove an absurdity. The argument exploits a self-referential function symbol where the expressed function ends up being intensional in virtue of self-reference. The prohibition on intensional functions thus entails that self-reference cannot be unconstrained, even in a language that is free of semantic terms. However, since intensional functions are already excluded in classical logic, there are no drastic revisionary implications here. Still, the argument reveals a new sort of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Yablo’s Paradox and ω-Inconsistency.Jeffrey Ketland - 2005 - Synthese 145 (3):295-302.
    It is argued that Yablo’s Paradox is not strictly paradoxical, but rather ‘ω-paradoxical’. Under a natural formalization, the list of Yablo sentences may be constructed using a diagonalization argument and can be shown to be ω-inconsistent, but nonetheless consistent. The derivation of an inconsistency requires a uniform fixed-point construction. Moreover, the truth-theoretic disquotational principle required is also uniform, rather than the local disquotational T-scheme. The theory with the local disquotation T-scheme applied to individual sentences from the Yablo list is also (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Patterns of paradox.Roy T. Cook - 2004 - Journal of Symbolic Logic 69 (3):767-774.
    We begin with a prepositional languageLpcontaining conjunction (Λ), a class of sentence names {Sα}αϵA, and a falsity predicateF. We (only) allow unrestricted infinite conjunctions, i.e., given any non-empty class of sentence names {Sβ}βϵB,is a well-formed formula (we will useWFFto denote the set of well-formed formulae).The language, as it stands, is unproblematic. Whether various paradoxes are produced depends on which names are assigned to which sentences. What is needed is a denotation function:For example, theLPsentence “F(S1)” (i.e.,Λ{F(S1)}), combined with a denotation functionδsuch (...)
    Download  
     
    Export citation  
     
    Bookmark   45 citations