Switch to: References

Add citations

You must login to add citations.
  1. Inception of Quine's ontology.Lieven Decock - 2004 - History and Philosophy of Logic 25 (2):111-129.
    This paper traces the development of Quine's ontological ideas throughout his early logical work in the period before 1948. It shows that his ontological criterion critically depends on this work in logic. The use of quantifiers as logical primitives and the introduction of general variables in 1936, the search for adequate comprehension axioms, and problems with proper classes, all forced Quine to consider ontological questions. I also show that Quine's rejection of intensional entities goes back to his generalisation of Principia (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Automorphisms moving all non-algebraic points and an application to NF.Friederike Körner - 1998 - Journal of Symbolic Logic 63 (3):815-830.
    Section 1 is devoted to the study of countable recursively saturated models with an automorphism moving every non-algebraic point. We show that every countable theory has such a model and exhibit necessary and sufficient conditions for the existence of automorphisms moving all non-algebraic points. Furthermore we show that there are many complete theories with the property that every countable recursively saturated model has such an automorphism. In Section 2 we apply our main theorem from Section 1 to models of Quine's (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Permutations and Wellfoundedness: The True Meaning of the Bizarre Arithmetic of Quine's NF.Thomas Forster - 2006 - Journal of Symbolic Logic 71 (1):227 - 240.
    It is shown that, according to NF, many of the assertions of ordinal arithmetic involving the T-function which is peculiar to NF turn out to be equivalent to the truth-in-certain-permutation-models of assertions which have perfectly sensible ZF-style meanings, such as: the existence of wellfounded sets of great size or rank, or the nonexistence of small counterexamples to the wellfoundedness of ∈. Everything here holds also for NFU if the permutations are taken to fix all urelemente.
    Download  
     
    Export citation  
     
    Bookmark   4 citations