|
Date | Speaker | Title (Click for Abstract) |
---|---|---|---|
Special! | 17 October at 10:10 | Jeff Zucker (McMaster) | Computation on topological data types |
0. | 21 October | -- | (Organizational get together) |
1. | 28 October | Udi Boker | A proof of the Church-Turing thesis |
2. | 4 November | Danièle Beauquier (Paris 12) | Secrecy for cryptographic protocols is easy |
3. | 11 November | Beata Konikowska (Polish Acad. of Science) | Decompositional proof systems for logics based on non-deterministic matrices |
4. | 18 November | Arnon Avron and Anna Zamansky |
Theory and applications of two-valued nondeterministic matrices |
5. | 25 November | Mayer Goldberg (Ben Gurion) | One point bases in lambda-calculi with constants |
6. | 2 December | Iddo Tzameret | Propositional
and algebraic proof complexity |
7. | 9 December | Guy Gildor | Fuzzy class theory |
8. | 16 December | Iddo Tzameret | Propositional and algebraic proof complexity (part II) |
9. | 23 December | Greta Yorsh | A combination method for generating interpolants |
10. | 30 December | Michael Benedikt (Bell Labs) | Some decision problems on tree automata |
11. | 6 January | Eyal Amir (UIUC) | Compact propositional encoding of first-order theories |
12. | 13 January ** in Melamud Hall ** | Hilary Putnam (Harvard) | Goedel, the mind, and epistemology |
13. | 20 January | Janos Makowsky (Technion) |
What did Tarski mean with "Elementary geometry is decidable"? |