| | Model Theory and Mysteries in Computer Science
J. P. Ressayre
University of Paris 7, France
| Abstract
| |
This is introduction and survey; no proofs, only ideas.
Math is 2 - sided; one side is tame, the other is for ever mysterious.
o-minimality is a supergood example of a part of model theory which is on
the tame side; we shall review it. Non standard models of Arithmetic is another part, much more on the mysterious side. We shall review the reasons for this status as well as a part of the subject.
Some non standard models of Arithmetic are 2 - sided, with one part tame
and the other part oracular. We shall explain the interplay between o-
minimality and NS models which they produce.
Some P versus NP issues may well stand on the for ever mysterious side of
math; we discuss the reasons why, and what the preceding topics can do
about
it. |
Information |
| Time: | Sat. June 11, 16:30-18:00
Sun. June 12, 14:00-15:30
Mon. June 13, 14:00-15:30
|
| Place: | Lecture Hall, Niavaran Bldg., Niavaran Sqr., Tehran, Iran |
| | |
|
