Higher-order logic (type theory). Syntax, Lambda-notation, Axioms of Description and Choice, computer-assisted formal proofs, semantics, soundness, standard and non-standard models, completeness, compactness, formalization of mathematics, definability of natural numbers, representability of recursive functions, Church's Thesis. Godel's Incompleteness Theorems, undecidability, undefinability.
| Popularity index|
| Students also scheduled || |
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.