1. Shawn Hedman (2004). A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity. Oxford University Press.
    The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability theory, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  2. Shawn Hedman (2004). A First Course in Logic: An Introduction to Model Theory, Proof Theory, Computability, and Complexity. Oxford University Press Uk.
    The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability theory, and (...)
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  3.  11
    Shawn Hedman & Wai Yan Pong (2011). Quantifier-Eliminable Locally Finite Graphs. Mathematical Logic Quarterly 57 (2):180-185.
    We identify the locally finite graphs that are quantifier-eliminable and their first order theories in the signature of distance predicates. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography