Place: Shriber 309.
Time: 10-12 Tuesdays.
-
06/06/00
Nachum Dershowitz
Canonical Proof Systems.
-
23/05/00
Arnon Avron
A database approach to Church thesis.
-
16/05/00
Sergei Vorobyov, Uppsala University, SWEDEN
Better Decision Algorithms for Parity Games.
-
8/05/00
Claude Kirchner, INRIA-Lorraine, Nancy, France
2+2 = 4: Shall we prove it?
- 11 /4/00
Shahar Maoz.
Games on Trees.
- 4 /4/00
Shahar Maoz.
Why so many TL climb up the trees.
- 28 /3/00
Iddo Lev.
Selective Systems for Non-Classical Reasoning.
- 14 /3/00
Boaz Trakhtenbrot.
On well-formed circuits.
- 8 /3/00
J. van Benthem
Logic and Games.
- 29 /3/00
Alex Rabinovich
Slectors, choice functions and uniformization.
- 22 /2/00
Oren Spector
Annotated logic as a Many-Sorted Logic.
- 18 /1/00
Boaz Trakhtenbrot.
Synthesis for Hybrid
Systems.
- 11 /1/00
Nachum Dershowitz
Comparison Between Computational Models.
- 4 /1/00
Nachum Dershowitz
Comparison Between Computational Models.
- 29 /12/99
Sergei Artemov
Proof Polynomials.
- 21 /12/99
Alexander Rabinovich
Compositional Theorems for recursively defined structures.
- 14 /12/99
Arnon Avron
The Logic of Provability.
- 7 /12/99
Arnon Avron
The Logic of Provability.
- 30 /11/99
Alexander Rabinovich
Compositional Method.
- 23 /11/99
Boaz Trakhtenbrot.
Survey of works on Continuous time: Grenoble
- 17 /11/99
Alexander Rabinovich
Survey of works by Beauquier and Slissenko on Real time.
- 10 /11/99
Nachum Dershowitz
Grobner Bases and their applications to satisfiability of propositional
formulas.
- 3 /11/99
Mitch Harris
Grobner Bases.
- 27 /10/99
Nachum Dershowitz
Stalmark method.
- 20 /10/99
Nachum Dershowitz
Stalmark method.
- List of the talks in 1998