MA 58500, Fall 2009
Credit Hours: 3.00. Propositional and predicate calculus; the Gdel completeness and compactness theorem, primitive recursive and recursive functions; the Gdel incompleteness theorem; Tarski's theorem; Church's theorem; recursive undecidability; special topics such as nonstandard analysis. Typically offered Fall.
MA 58500 001
- ADA policies: please see our ADA Information page for more details
- In the event of a missed exam, see your instructor/professor as soon as possible.
- See the online course evaluation page for more information on how we collect course feedback from students