printer friendly pageMATH 293A: Proof Theory (PHIL 353A)
Gentzen's natural deduction and sequential calculi for first-order propositional and predicate logics. Normalization and cut-elimination procedures. Relationships with computational lambda calculi and automated deduction. Prerequisites: 151, 152, and 161, or equivalents.
MATH 295: Computation and Algorithms in Mathematics
Use of computer and algorithmic techniques in various areas of mathematics. Computational experiments. Topics may include polynomial manipulation, Groebner bases, computational geometry, and randomness. May be repeated for credit.
| Repeatable
for credit
MATH 301: Advanced Topics in Convex Optimization
Modern developments in convex optimization: semidefinite programming; novel and efficient first-order algorithms for smooth and nonsmooth convex optimization. Emphasis on numerical methods suitable for large scale problems arising in science and engineering. Prerequisites: convex optimization (
EE 364), linear algebra (
Math 104), numerical linear algebra (
CME 302); background in probability, statistics, real analysis and numerical optimization.
| Repeatable
3 times
(up to 9 units total)
MATH 381: Seminar in Analysis
| Repeatable
3 times
MATH 384: Seminar in Geometry
| Repeatable
3 times
(up to 9 units total)
MATH 385: Seminar in Topology
| Repeatable
3 times
(up to 9 units total)
MATH 388: Seminar in Probability and Stochastic Processes
| Repeatable
3 times
(up to 9 units total)
MATH 389: Seminar in Mathematical Biology
| Repeatable
3 times
(up to 9 units total)
MATH 394: Classics in Analysis
Original papers in analysis.
| Repeatable
3 times
(up to 9 units total)
MATH 395: Classics in Geometry and Topology
Original papers in geometry and in algebraic and geometric topology. May be repeated for credit.
| Repeatable
for credit
Filter Results: