Switch to: References

Citations of:

Introduction to symbolic logic

New York,: Holt, Rinehart and Winston (1969)

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.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Can There Be A Proof That Some Unprovable Arithmetic Sentence Is True?Philip Hugly & Charles Sayward - 1989 - Dialectica 43 (3):289-292.
    Direct download  
     
    Export citation  
     
    Bookmark  
  • A Brief History of Natural Deduction.Francis Jeffry Pelletier - 1999 - History and Philosophy of Logic 20 (1):1-31.
    Natural deduction is the type of logic most familiar to current philosophers, and indeed is all that many modern philosophers know about logic. Yet natural deduction is a fairly recent innovation in logic, dating from Gentzen and Jaśkowski in 1934. This article traces the development of natural deduction from the view that these founders embraced to the widespread acceptance of the method in the 1960s. I focus especially on the different choices made by writers of elementary textbooks—the standard conduits of (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  • Commentary on Blair.Maurice Finocchiaro - unknown
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • ‘Argument’ and ‘Logic’ in Logic Textbooks.J. Anthony Blair - unknown
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark