MA 1114 - Conceptual Mathematics - Fall Semester 2006, Polytechnic University. Jonathan Bain * Syllabus * Lectures o 01. The Branches of Mathematics o 02. Paradoxes o 03. Greeks & Aristotle o 04. Calculus o 05. Proofs o 06. Naive Set Theory o 07. Ordinals and Cardinals o 08. Formal Set Theory o 09. Problems: The Skolem Paradox o 10. Problems: Godel's Incompleteness Theorems o 11. Category Theory: Intro o 12. Isomorphisms, Sections, Retractions o 13. More Categories o 14. Generalized Elements o 15. Terminal Objects & Initial Objects o 16. Products o 17. Sums
Suppose that we wanted to construct a mathematical universe where all objects were computable in some sense. How would we do it? Well, we could certainly allow the set \mathbb{N} into our universe: natural numbers are the most basic computational objects there are. (Notation: I’ll use N to refer to \mathbb{N} when we’re considering it as part of the universe we’ll building, and just \mathbb{N} when we’re talking about the set of natural numbers in the “real” world.) What should we take as our set of functions N^N from N to N? Since we want to admit only computable things, we should let N^N be the set of computable functions from \mathbb{N} to \mathbb{N}, which we can represent non-uniquely by their indices (i.e., by the programs which compute them).