Subject: 
Pure Mathematics (PMATH)
Catalog number: 
632
Unit weight: 
0.50
Meet type: 
LEC
Grading basis: 
NUM
Cross-listing(s): 
N/A
Requisites: 
Antireq: PMATH 432
Description: 
The concepts of formal provability and logical consequence in first order logic are introduced, and their equivalence is proved in the soundness and completeness theorems. Goedel's incompleteness theorem is discussed; making use of the halting problem of computability theory. Relative computability and the Turing degrees are further studied.
Topic titles: 
N/A
Faculty: 
Mathematics (MAT)
Academic level: 
GRD
Course ID: 
002339