and its Summer School
The last European Congress of the Association for Symbolic Logic of the millennium will be held in Paris, July 23 - 31, 2000. The meeting site will be the Sorbonne, where David Hilbert presented his famous list of problems at the International Congress of Mathematicians in August 1900.
Local registration is on Sunday morning, July 23rd at the Sorbonne (17 rue de la Sorbonne), and the congress activities will start in late morning. We will have 24 plenary talks and 4 tutorials, as well as parallel sessions of contributed talks. There will be two free afternoons with planned excursions, and a banquet.
Main themes of the conference: Proof theory and logical foundations of computer science, Set theory, Model theory, Computability and complexity theory, History of 20th century logic, Philosophy, and Applications of logic to cognitive sciences.
Program Committee : Daniel Andler (Paris IV), Chantal Berline (CNRS-Paris7), Barry Cooper (Leeds), Dirk van Dalen (Utrecht), Akihiro Kanamori (Boston), Charles Parsons (Harvard), Alexander Razborov (Steklov, Moscou), Helmut Schwichtenberg (München), John Steel (Berkeley), Stevo Todorcevic (CNRS-Paris7), Alex Wilkie (Oxford), Carol Wood (Chairperson, Wesleyan University).
Organising Committee : Chantal Berline
(CNRS-Paris7), Zoé Chatzidakis (CNRS-Paris7), René
Cori (Chairman, Paris7-CNRS), Máximo Dickmann (CNRS-Paris7),
Jacques Dubucs (CNRS-Paris1), Jean-Baptiste Joinet (Paris1-CNRS), Daniel
Lascar (CNRS-Paris7), Yves Legrandgérard (Paris7-CNRS), Jean Mosconi
(Paris1-CNRS), Marie-Hélène Mourgues (IUFM de Créteil
- CNRS), Catherine Muhlrad-Greif (Paris7-CNRS), Leszek Pacholski (Wroclaw,
representing the ASL), Donald Pelletier (York), Jean-Pierre Ressayre (CNRS-Paris7), Boban
(Paris7-CNRS), Françoise Ville (Paris7-CNRS).
Incorporated into the nine days of this Logic Colloquium will be the European Logic Summer School 2000 (ELSS 2000), which is partially supported by the European Community. Through ELSS 2000 we are able to emphasise the importance of training of young researchers in logic. The summer school portion of the program includes all the tutorials, together with invited lectures chosen for the combination of high scientific level and broad perspective each offers to the newest members of the community of logicians.
If you wish to receive the congress announcements, please send us a request
At the international level:
The ASL (Association for Symbolic Logic, President: Donald A. Martin, UCLA): Department of Mathematics, University of Illinois, 1409 West Green Street, Urbana - Illinois 61801, USA. Tel: 1-217-244 7902; Fax: 1-217-333 9576; e-mail address: email@example.comLocally:
The Équipe de Logique Mathématique (ESA 7056, CNRS, Université Denis Diderot, Director: Daniel Lascar): UFR de Mathématiques, case 7012, Université Denis Diderot (Paris 7), 2 place Jussieu, 75251 Paris Cedex 05, France.Book Exhibits:
The UFR de Philosophie de l'Université Paris 1-Panthéon-Sorbonne and the Institut d'Histoire et Philosophie des Sciences et Techniques (UMR 8590, CNRS, Director: Philippe de Rouilhan). Address of the UFR: 17 rue de la Sorbonne, 75231 Paris Cedex 05, France ; address of the IHPST: 13 rue du Four, 75006 Paris, France.
Sponsors: LC 2000 and ELSS 2000 are sponsored by:
Université Paris 7 - Denis-Diderot
Université Paris I - Panthéon-Sorbonne
Université Paris IV - Paris-Sorbonne
Direction de la Recherche du Ministère de l'Éducation Nationale, de la Recherche et de la Technologie
The European Community
Association for Symbolic Logic
Centre National de la Recherche Scientifique
IUFM de Créteil
Société Mathématique de France
Cité des Sciences et de l'Industrie.
Fixed Points in Computer Science, 22nd and 23rd of July 2000, Paris, France. Organised by the LIAFA (ERS 586, CNRS, Université Denis Diderot - Paris 7) and by the UFR d'Informatique de l'Université Pierre et Marie Curie - Paris 6. E-mail address: firstname.lastname@example.org
Least fixed point operators are linked to inductive structures and inductive reasoning, while largest fixed point operators correspond to co-induction. When formalizing mathematics within logical systems one is often lead to axiomatize inductive and co-inductive reasoning via such operators. More generally, fixed point operators are used to represent recursive structures or functions, in logic and in theoretical computer science.
Updated July 21, 2000.