Advice In case you are interested in doing this master program, please get in touch with Professor Gehrke or Professor Geuvers, also to discuss your choice of courses. (Not all courses will be given every year.)
In this Research Master Program, mathematicians working in areas pertinent to (theoretical) computer science, like algebra and logic, and theoretical computer scientists, working in areas as formal methods and theorem proving, join forces to establish a master program in the Mathematical Foundations of Computer Science, (MFoCS). The emphasis of the Master is on a combination of a genuine theoretical and up-to-date foundation in the pertinent mathematical subjects combined with an equally genuine and up-to-date training in key aspects of theoretical computer science. For this reason, the mathematics courses in this curriculum concentrate on Algebra, General Topology, Logic, Number Theory, and Combinatorics. The computer science courses concentrate on Formal Methods, Type Theory and Theorem Proving.
For this master program we solicit students with a bachelor in mathematics or computer science that have a strong mathematical background and theoretical interests. We will select students based on their motivation and their background.
| Semester 1 | Semester 2 | ||||
| 3 x 6 ec fixed | 18 | 3 x 6 ec fixed | 18 | ||
| 6 ec Elective | 6 | 6 ec Elective | 6 | ||
| 6 ec Kaleidoscope* | 6 | 6 ec Research Seminar ** | 6 | ||
| TOTAL | 30 | TOTAL | 30 | ||
| Semester 3 | Semester 4 | ||||
| 3 ec Philosophy | 3 | Master Thesis | 25 | ||
| 2 x 6 ec Elective | 12 | 6 ec Elective | 6 | ||
| Master Thesis | 15 | ||||
| TOTAL | 30 | TOTAL | 31 |
| Type Theory and Proof Assistants IMC010 | 1 | Geuvers Wiedijk |
| Category Theory WM033C (not in 2010-2011) | 1 | Jacobs |
| Lattice Theory WB050C (not in 2010-2011) | 1 | Gehrke |
| Semantics and Domain Theory IMC011 | 2 | Geuvers McKinna |
| Universal algebra WB058B | 2 | Gehrke |
| Computer Algebra WM069B (not in 2010-2011) | 2 | Bosma |
| Automatic Sequences WM080A | Bosma | CM |
| Advanced Programming I00032 | Plasmeijer Koopman | C |
| Information Theory WM079B | Maassen | CM |
| Commutative Algebra WM026B 8ec | Berson | M |
| Model Theory WM036C 8ec | Veldman | M |
| Representation Theory (Mastermath 8ec) | Lenstra Cuypers | M |
| Parallel Algorithms (Mastermath 8ec) | Bisseling | CM |
| Number Theory and Cryptography (Mastermath 6ec) | Lange | CM |
| Proof Assistants I00139 | Wiedijk | C |
| Analysis of Embedded Systems I00154 | Vaandrager | C |
| Automated Reasoning IMC009 | Zantema | C |
| Compiler Construction IMC004 | Plasmeijer Achten Smetsers | C |
| Intuitionistic Mathematics WM037A | Veldman | M |
| Complexity Theory (Mastermath 8ec) | Pietrzak, Terwijn | CM |
| Proof Theory (Mastermath 8ec) | Iemhoff, van Oosten | CM |
| Set Theory (Mastermath 8ec) | Hart, Lowe | M |
| Axiomatic Set theory WM038B (was given in 2009-2010, 8ec) | Veldman | M |
| Duality Theory | Gehrke | M |
| Graph Theory | Bosma | CM |
| Algorithmic Number Theory | Bosma | CM |
| Recursion Theory | Veldman | CM |
| Algebraic Topology | Clauwens | M |
| Term Rewriting Systems | Zantema | CM |
| Advanced Lambda Calculus | Barendregt | CM |
| Coalgebras | Rutten | CM |
See the university's International Masters page for general information about doing a master at the Radboud University.
Students from an EEA country may apply for either a student grant within the Dutch student grants and loans system or a tuition fee allowance: Read more.... Students from the Netherlands can use their normal studiefinanciering from IB, as this Master curriculum officially falls under both the master of computer science and the master of mathematics of the Radboud University Nijmegen, which are CROHO-accredited.
The Radboud University has special scholarships for non-EEA students, like the Radboud Scholarship Programme. The university provides a special information page on scholarships and grants.
Students who need financial support may be interested to know that the Dutch government, runs special schemes to help students finance their education.