Among the most significant developments in logic in the twentieth century is the formal analysis of the notions of provability and semantic consequence. For first-order logic, the two are related by the soundness and completeness theorems: a sentence is provable if and only if it is true in every interpretation. This course begins with a formal description of first-order logic, and proofs of the soundness and completeness theorems. Other topics may include: compactness, the Lvwenheim-Skolem theorems, nonstandard models of arithmetic, definability, other logics, and automated deduction. Prerequisites: 80-210 or 80-211, or an equivalent course in Mathematics or Computer Science
Popularity index
Rank for this semester:
#0
Rank in this department:
#0
Spring 2005 times
No sections available for semester Spring 2005.
talkback to the pulse
No comments about this course have been posted, yet. Be the first to post!
Share your opinion on this course with other Pulse readers. Login below or register to begin posting.
email: tcpulse@andrew.cmu.edu :: phone: 801.848.4812 :: fax: 801.848.4812 :: mail: The Carnegie Pulse | Carnegie Mellon University | University Center, Box 78 | Pittsburgh, PA 15213 ::
(c) Copyright 2004 The Carnegie Pulse, Carnegie Mellon's first exclusively online student-run news source.