The Carnegie Pulseabout the carnegie pulse | advertise | contact | subscriptions | join 
newsart & cultureopinionseventscourse schedule

My schedule
Most popular
View departments
View locations
View times

Find course by title:


80-310 Logic and Computation

Prerequisites:15-251 or 80-210 or 80-211
Related URLs:

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 Lowenheim-Skolem theorems, nonstandard models of arithmetic, definability, other logics, and automated deduction.

  Popularity index
Rank for this semester:#0
Rank in this department:#0

  Students also scheduled
15-451 Algorithm Design and Analysis
21-301 Combinatorics
15-462 Computer Graphics
18-447 Introduction to Computer Architectu...
15-384 Robotic Manipulation
24-354 General Robotics
15-212 Principles of Programming
18-349 Introduction to Embedded Systems
80-291 Issue in Multimedia Authoring
57-338 Sound Editing and Mastering

  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 address:

  (c) Copyright 2004 The Carnegie Pulse, Carnegie Mellon's first exclusively online student-run news source. campus mirror | RSS