6 found
  1.  69
    A Mathematical Introduction to Logic.Herbert B. Enderton - 1972 - New York: Academic Press.
    A Mathematical Introduction to Logic, Second Edition, offers increased flexibility with topic coverage, allowing for choice in how to utilize the textbook in a course. The author has made this edition more accessible to better meet the needs of today's undergraduate mathematics and philosophy students. It is intended for the reader who has not studied logic previously, but who has some experience in mathematical reasoning. Material is presented on computer science issues such as computational complexity and database queries, with additional (...)
    Direct download (2 more)  
    Export citation  
    Bookmark   120 citations  
  2.  30
    Finite Partially‐Ordered Quantifiers.Herbert B. Enderton - 1970 - Mathematical Logic Quarterly 16 (8):393-397.
  3.  65
    Second-Order and Higher-Order Logic.Herbert B. Enderton - 2008 - Stanford Encyclopedia of Philosophy.
  4.  47
    Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
    Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
    Direct download  
    Export citation  
    Bookmark   2 citations  
  5.  11
    Constructible Β‐Models.Herbert B. Enderton - 1973 - Mathematical Logic Quarterly 19 (14‐18):277-282.
  6. Association for Symbolic Logic.Jon Barwise, Howard S. Becker, Chi Tat Chong, Herbert B. Enderton, Michael Hallett, C. Ward Henson, Harold Hodes, Neil Immerman, Phokion Kolaitis & Alistair Lachlan - 1998 - Bulletin of Symbolic Logic 4 (4):465-510.