Switch to: References

Citations of:

Sequences

Journal of Symbolic Logic 6 (4):150-153 (1941)

Add citations

You must login to add citations.
  1. Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In T. Achourioti, H. Galinon, J. Martínez Fernández & K. Fujimoto (eds.), Unifying the Philosophy of Truth. Dordrecht: Imprint: Springer. pp. 339-354.
    In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reconsidering ordered pairs.Dana Scott & Dominic McCarty - 2008 - Bulletin of Symbolic Logic 14 (3):379-397.
    The well known Wiener-Kuratowski explicit definition of the ordered pair, which sets ⟨x, y⟩ = {{x}, {x, y}}, works well in many set theories but fails for those with classes which cannot be members of singletons. With the aid of the Axiom of Foundation, we propose a recursive definition of ordered pair which addresses this shortcoming and also naturally generalizes to ordered tuples of greater lenght. There are many advantages to the new definition, for it allows for uniform definitions working (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • An introduction to simplicity.Richard Rudner - 1961 - Philosophy of Science 28 (2):109-119.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • In Memoriam: Nelson Goodman 1906–1998.Joseph S. Ullian - 1999 - Bulletin of Symbolic Logic 5 (3):392-394.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Tail Club Guessing Ideal Can Be Saturated without Being a Restriction of the Nonstationary Ideal.Tetsuya Ishiu - 2005 - Notre Dame Journal of Formal Logic 46 (3):327-333.
    We outline the proof of the consistency that there exists a saturated tail club guessing ideal on ω₁ which is not a restriction of the nonstationary ideal. A new class of forcing notions and the forcing axiom for the class are introduced for this purpose.
    Download  
     
    Export citation  
     
    Bookmark   1 citation