Switch to: Citations

Add references

You must login to add references.
  1. Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • Maximal consistent sets of instances of Tarski’s schema.Vann McGee - 1992 - Journal of Philosophical Logic 21 (3):235 - 241.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
    A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.
    Download  
     
    Export citation  
     
    Bookmark   862 citations  
  • Reducing compositional to disquotational truth.Volker Halbach - 2009 - Review of Symbolic Logic 2 (4):786-798.
    Disquotational theories of truth, that is, theories of truth based on the T-sentences or similar equivalences as axioms are often thought to be deductively weak. This view is correct if the truth predicate is allowed to apply only to sentences not containing the truth predicate. By taking a slightly more liberal approach toward the paradoxes, I obtain a disquotational theory of truth that is proof theoretically as strong as compositional theories such as the Kripket probe the compositional axioms.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Disquotational truth and analyticity.Volker Halbach - 2001 - Journal of Symbolic Logic 66 (4):1959-1973.
    The uniform reflection principle for the theory of uniform T-sentences is added to PA. The resulting system is justified on the basis of a disquotationalist theory of truth where the provability predicate is conceived as a special kind of analyticity. The system is equivalent to the system ACA of arithmetical comprehension. If the truth predicate is also allowed to occur in the sentences that are inserted in the T-sentences, yet not in the scope of negation, the system with the reflection (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Reflecting on incompleteness.Solomon Feferman - 1991 - Journal of Symbolic Logic 56 (1):1-49.
    Download  
     
    Export citation  
     
    Bookmark   141 citations  
  • Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   94 citations