Switch to: References

Citations of:

Understanding symbolic logic

New York,: Harper & Row (1970)

Add citations

You must login to add citations.
  1. Can There be a Proof that an Unprovable Sentence of Arithmetic is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (43):289-292.
    Various authors of logic texts are cited who either suggest or explicitly state that the Gödel incompleteness result shows that some unprovable sentence of arithmetic is true. Against this, the paper argues that the matter is one of philosophical controversy, that it is not a mathematical or logical issue.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (3):289-292.
    Download  
     
    Export citation  
     
    Bookmark  
  • Carnapian extensions of S.Herbert E. Hendry & M. L. Pokriefka - 1985 - Journal of Philosophical Logic 14 (2):111 - 128.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Reasons, Warrants and Premisses.Robert C. Pinto - unknown
    Download  
     
    Export citation  
     
    Bookmark   2 citations