Philosophers, psychologists, and linguists who are interested in interdisciplinary work are very welcome to attend the conference. Invited Speakers: György Gergely (Budapest), Susan Goldin-Meadow (Chicago), Patrick Haggard (London) and Kevin Mulligan (Geneva)

Invited Symposia:
AUDITORY PERCEPTION opened by Jerome Dokic, IJN Paris
MODALITY AND LANGUAGE opened by Bencie Woll, UCLLondon
MENTAL TIME TRAVEL opened by Teresa McCormack, Belfast
PRETENCE opened by Hannes Rakoczy, MPG Leipzig

For more information, see http://www.psych.qub.ac.uk/eurospp2006/. Information about the Society can be found at http://www.eurospp.org/.

The AMLaP conferences have established themselves as the premier European venue for interdisciplinary research on how people process language. The conference aims to bring together psychological, computational, and theoretical perspectives on the cognitive architectures and mechanisms which underlie any aspect of human language processing.

For more information, see http://www2.ru.nl/congres/AMLaP2006/welcome.htm

JELIA'06 will bring together researchers interested in all aspects concerning the use of logics in AI to discuss current research, results, problems and applications of both a theoretical and practical nature.

For more information, including lists of Conference Officials and Programme Committee, see http://www.csc.liv.ac.uk/~jelia/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

For more information, see http://www.lix.polytechnique.fr/~hermann/LPAR2006/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

The Third International Workshop on Philosophy and Informatics is organized by the Institute for Formal Ontology and Medical Information Science and the Special Interest Group on Philosophy and Informatics of the German Informatics Society.

The workshops are designed to encourage interdisciplinary exchange on the philosophical foundations of informatics. They seek to bring together researchers from philosophy and informatics and neighboring disciplines in order to explore common points of interest and to develop an interface between the disciplines and a common vocabulary. The workshop also serves as the annual meeting platform of the members of the Special Interest Group on Philosophy and Informatics. The 2006 Workshop has a special focus on the area of bio- and biomedical informatics.

For more information, see http://wspi2006.workshop.hm/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

The Third International Workshop on Philosophy and Informatics is organized by the Institute for Formal Ontology and Medical Information Science and the Special Interest Group on Philosophy and Informatics of the German Informatics Society.

The workshops are designed to encourage interdisciplinary exchange on the philosophical foundations of informatics. They seek to bring together researchers from philosophy and informatics and neighboring disciplines in order to explore common points of interest and to develop an interface between the disciplines and a common vocabulary. The workshop also serves as the annual meeting platform of the members of the Special Interest Group on Philosophy and Informatics. The 2006 Workshop has a special focus on the area of bio- and biomedical informatics.

For more information, see http://wspi2006.workshop.hm/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages.

The workshop intends to promote and stimulate international research and collaboration in the area of evaluation strategies. It encourages the presentation of new directions,developments and results as well as surveys and tutorials on existing knowledge in this area.

For more information, see http://www.cs.pdx.edu/~antoy/wrs06/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The COMBSTRU School on Computational Complexity is a forum for advanced training of pre- and post-docs on hot topics in Computer Science at the frontier of current research trends. Such a school is held for the first time in Italy and is an opportunity for young researchers in Computer Science, Economics and Applied Mathematics to meet with research leaders in the areas of Computational Economics and Complexity Theory.

The school is open to Ph.D. students and post-docs in Computer Science, Economics, and Applied Mathematics. There is a limited number of BICI fellowships available to cover registration costs for students without other means of support. For more information, an online registration form and a syllabus, see http://www.iit.cnr.it/cscc06/.

DALT-2006 will be held as a satellite workshop of AAMAS-2006, the 5th International Joint Conference on Autonomous Agents and Multiagent Systems. Topics of interest include logic-based approaches to specifying and developing multiagent systems (including modal and temporal logics, model checking, constraint logic programming) and applications such as the semantic web, security, and electronic contracting. Deadline for submission of papers is the 15 January 2006.

For more information, see http://staff.science.uva.nl/~ulle/DALT-2006/ or contact Ulle Endriss (ulle at illc.uva.nl).

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The aim of this workshop is to bring together psychologists and philosophers who are studying the epistemological and ontological foundations of number.Key topics are: what are numbers? How do we acquire knowledge about them? What is the role of language and other cultural factors in acquiring numerical concepts? What neural correlates underlie numerical competence? What are the implications of psychological foundations of number for the philosophy of mathematics? We expect that bringing together philosophers and psychologists will foster a unique cross-fertilization for both fields. As the workshop will have an in-depth, focused character, we have invited eminent scholars in psychology and philosophy whose work has deepened the understanding of the nature and knowledge of number.

For more details, including full programme, titles and abstracts, follow this link: http://www.vub.ac.be/CLWF/WON2006/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

Information Science is the interface of a number of scientific disciplines, all related to the diverse aspects of the information access, management, retrieval and usage. A number of approaches to the same object of study, the information, converge in this space: technological, mathematical, linguistic, and cognitive aspects as well as those related to the Artificial Intelligence, Natural Language Processing or Human-Computer Interaction, organizational aspects and so on. All these approaches shape the wide range of domains which must interact in order to find the solutions to the problems we all face when deploying and improving these information systems.

InSciT2006, with a strong multi and inter disciplinary focus, aims at creating a forum in Spain where gather together researchers and practitioners coming from the widest range of knowledge domains involved in the study of information.

For more information, an online registration form and a preliminary program, see http://www.instac.es/inscit2006/

The first Lisbon Colloquium for the Philosophy of Science to be held October 25-28th, 2006 is intended to stimulate, discuss and evaluate new approaches to the problem of the unity of science which incorporate logic, decision theory, learning theory, probability theory and other formal methods in creative and productive ways.

For more information, see http://www.lisboncolloquium.org/.

There will be lectures, discussion sessions, round tables and software demonstrations. You are kindly invited to take active part in discussion sessions and to demonstrate your teaching or professional software.

For more information, see here or http://logicae.usal.es/SICTTL/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

Everyone is invited to this informal workshop in medieval logic. The workshop will take place in rooms P3.27 & P0.14 at the Euclides Building (Plantage Muidergracht 24, Amsterdam)

For more information, email Sara Uckelman (suckelma at illc.uva.nl), or go to http://staff.science.uva.nl/~suckelma/may16meeting.html

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

The Seventeenth Annual Gödel Lecture will be given by P. Martin-Löf, and a tutorial on quantum information theory will be offered by P. Selinger. The invited program also includes a symposium to commemorate the centennial of the birth of Gödel, in which J. Avigad, S. Friedman, and A. Kanamori will speak. Special sessions are planned in categorical logic/quantum information theory, effective aspects of measure theory and analysis, model theory, and set theory.

For more information, an online registration form and a preliminary program, see http://asl2006.uqam.ca/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

The Seventeenth Annual Gödel Lecture will be given by P. Martin-Löf, and a tutorial on quantum information theory will be offered by P. Selinger. The invited program also includes a symposium to commemorate the centennial of the birth of Gödel, in which J. Avigad, S. Friedman, and A. Kanamori will speak. Special sessions are planned in categorical logic/quantum information theory, effective aspects of measure theory and analysis, model theory, and set theory.

For more information, an online registration form and a preliminary program, see http://asl2006.uqam.ca/

As Gödel scholars are now becoming increasingly familiar not only with the texts in the Collected Works but also with the still unpublished ones in the Archive, we see changes in our understanding of Gödel's work: his results in logic, the development of which has now begun to be traced in much more detail, but also his philosophical reflections, the full importance of which is becoming ever clearer. The aim of this workshop will be to discuss Gödel's writings and to present and compare different perspectives on the philosophy and career of this logician. We will study his writings in order better to understand his intellectual development, his own reflections on his logical theorems, and, finally, the concomittant metaphysics that he hoped to develop.

The official languages will be English and French

For more information, see here or contact the organisers: Pierre Cassou-Nogués (pierre.cassou-nogues at univ-lille3.fr) and Mark van Atten (mark.vanatten at univ-paris1.fr).

The Eighth International Workshop on Termination will delve into all aspects of termination of processes. The intent is to bring together, in an informal setting, researchers interested in all aspects of termination, whether this interest be practical or theoretical, primary or derived. The workshop is hoped to provide a ground for cross-fertilisation of ideas from term rewriting and from the different programming language communities.

For more information, an online registration form and a preliminary program, see http://www.cs.mu.oz.au/wst2006/

There is a recent trend to study probabilistic extensions of traditional concepts of automata-theory and logics. The applications of such probabilistic formalisms cover the analysis of randomized protocols, biological systems, multi-agent systems with uncertainties, security protocols, speech recognition, logic programming, description logics for the semantic web, and many more.

The goal of this workshop is to bring together researchers that are interested in the foundations of probabilistic automata and probabilistic logics and their applications.

For more information, see http://web.informatik.uni-bonn.de/I/baier/PAuL/paul_workshop.html

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

The Seventeenth Annual Gödel Lecture will be given by P. Martin-Löf, and a tutorial on quantum information theory will be offered by P. Selinger. The invited program also includes a symposium to commemorate the centennial of the birth of Gödel, in which J. Avigad, S. Friedman, and A. Kanamori will speak. Special sessions are planned in categorical logic/quantum information theory, effective aspects of measure theory and analysis, model theory, and set theory.

For more information, an online registration form and a preliminary program, see http://asl2006.uqam.ca/

As Gödel scholars are now becoming increasingly familiar not only with the texts in the Collected Works but also with the still unpublished ones in the Archive, we see changes in our understanding of Gödel's work: his results in logic, the development of which has now begun to be traced in much more detail, but also his philosophical reflections, the full importance of which is becoming ever clearer. The aim of this workshop will be to discuss Gödel's writings and to present and compare different perspectives on the philosophy and career of this logician. We will study his writings in order better to understand his intellectual development, his own reflections on his logical theorems, and, finally, the concomittant metaphysics that he hoped to develop.

The official languages will be English and French

For more information, see here or contact the organisers: Pierre Cassou-Nogués (pierre.cassou-nogues at univ-lille3.fr) and Mark van Atten (mark.vanatten at univ-paris1.fr).

The Rally is a conference intended mainly for YOUNG PEOPLE - undergraduate, postgraduate, and PhD students - who are interested in PHILOSOPHY, LOGIC, cognitive science, artificial intelligence, or linguistics, and are considering an academic career. The program of the Rally will include reported paper presentations as well as WORKSHOPS, DEBATES, and LECTURES of invited speakers (i.e. Diderik Batens, Theo Kuipers, Jaroslav Peregrin, Leslie Stevenson from outside of Poland, and Stanislaw Judycki, Katarzyna Paprzycka, Andrzej Wisniewski, Maciej Witek, Ryszard Wojcicki, Krzysztof Wojtowicz from Poland). In this way, young conference participants will be able not only to present the results of their own work, but also to acquaint themselves with research methods of well-known and respected philosophers and logicans.

Deadline for sending applications, lecture papers and announcements is April 16, 2006. For more information, see http://www.filozofia.pl/zf/en/?nzw=zwiastun

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

TAMC06 is a new annual conference focusing on theory and applications of computation. It is organized as part of the Grand China NSF International Joint Project after which the conference is named, and is supported by the Chinese National Science Foundation, and the Institute of Software of the Chinese Academy of Sciences. Previously two annual meetings were held in 2004 and 2005, with enthusiastic participation from researchers all around the world. TAMC 06 will be a much larger international conference. The scope of the conference will include algorithms, complexity, models of computation, and computability. The conference will be interdisciplinary in nature, and bring together researchers and students with an interest in computer science, mathematics and logic, and applications to the physical sciences.

For more information, see http://gcl.iscas.ac.cn/accl06/TAMC06_Home.htm

The Seventeenth Annual Gödel Lecture will be given by P. Martin-Löf, and a tutorial on quantum information theory will be offered by P. Selinger. The invited program also includes a symposium to commemorate the centennial of the birth of Gödel, in which J. Avigad, S. Friedman, and A. Kanamori will speak. Special sessions are planned in categorical logic/quantum information theory, effective aspects of measure theory and analysis, model theory, and set theory.

For more information, an online registration form and a preliminary program, see http://asl2006.uqam.ca/

As Gödel scholars are now becoming increasingly familiar not only with the texts in the Collected Works but also with the still unpublished ones in the Archive, we see changes in our understanding of Gödel's work: his results in logic, the development of which has now begun to be traced in much more detail, but also his philosophical reflections, the full importance of which is becoming ever clearer. The aim of this workshop will be to discuss Gödel's writings and to present and compare different perspectives on the philosophy and career of this logician. We will study his writings in order better to understand his intellectual development, his own reflections on his logical theorems, and, finally, the concomittant metaphysics that he hoped to develop.

The official languages will be English and French

For more information, see here or contact the organisers: Pierre Cassou-Nogués (pierre.cassou-nogues at univ-lille3.fr) and Mark van Atten (mark.vanatten at univ-paris1.fr).

The Rally is a conference intended mainly for YOUNG PEOPLE - undergraduate, postgraduate, and PhD students - who are interested in PHILOSOPHY, LOGIC, cognitive science, artificial intelligence, or linguistics, and are considering an academic career. The program of the Rally will include reported paper presentations as well as WORKSHOPS, DEBATES, and LECTURES of invited speakers (i.e. Diderik Batens, Theo Kuipers, Jaroslav Peregrin, Leslie Stevenson from outside of Poland, and Stanislaw Judycki, Katarzyna Paprzycka, Andrzej Wisniewski, Maciej Witek, Ryszard Wojcicki, Krzysztof Wojtowicz from Poland). In this way, young conference participants will be able not only to present the results of their own work, but also to acquaint themselves with research methods of well-known and respected philosophers and logicans.

Deadline for sending applications, lecture papers and announcements is April 16, 2006. For more information, see http://www.filozofia.pl/zf/en/?nzw=zwiastun

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The Seventeenth Annual Gödel Lecture will be given by P. Martin-Löf, and a tutorial on quantum information theory will be offered by P. Selinger. The invited program also includes a symposium to commemorate the centennial of the birth of Gödel, in which J. Avigad, S. Friedman, and A. Kanamori will speak. Special sessions are planned in categorical logic/quantum information theory, effective aspects of measure theory and analysis, model theory, and set theory.

For more information, an online registration form and a preliminary program, see http://asl2006.uqam.ca/

The Rally is a conference intended mainly for YOUNG PEOPLE - undergraduate, postgraduate, and PhD students - who are interested in PHILOSOPHY, LOGIC, cognitive science, artificial intelligence, or linguistics, and are considering an academic career. The program of the Rally will include reported paper presentations as well as WORKSHOPS, DEBATES, and LECTURES of invited speakers (i.e. Diderik Batens, Theo Kuipers, Jaroslav Peregrin, Leslie Stevenson from outside of Poland, and Stanislaw Judycki, Katarzyna Paprzycka, Andrzej Wisniewski, Maciej Witek, Ryszard Wojcicki, Krzysztof Wojtowicz from Poland). In this way, young conference participants will be able not only to present the results of their own work, but also to acquaint themselves with research methods of well-known and respected philosophers and logicans.

Deadline for sending applications, lecture papers and announcements is April 16, 2006. For more information, see http://www.filozofia.pl/zf/en/?nzw=zwiastun

The 38th ACM Symposium on Theory of Computing (STOC 2006), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Seattle, WA, May 21 to 23, 2006. Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, computational geometry, algorithmic graph theory and combinatorics, randomness in computing, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing and other alternative models of computation, and theoretical aspects of areas such as databases, information retrieval, and networks.

For more information, see http://www.cs.washington.edu/stoc06/

The international workshop on the Universal Urysohn Metric Space will take place at Ben-Gurion University (Beer Sheva, Israel) from 21-24 May, 2006. The Urysohn space U is the universal complete metric separable space. This remarkable mathematical object, introduced by P. Urysohn 80 years ago, has generated a considerable and steadily growing interest over the past two decades. The purpose of the workshop is to bring together leading mathematicians working in the fields of Topological Groups, Functional Analysis, Geometry, Representation Theory, Dynamics, Logic and Set Theory in order to exchange ideas and present results of current research of the Urysohn space.

For more information, see http://www.math.bgu.ac.il/~arkady/Workshop_2006/main_page.html

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The 38th ACM Symposium on Theory of Computing (STOC 2006), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Seattle, WA, May 21 to 23, 2006. Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, computational geometry, algorithmic graph theory and combinatorics, randomness in computing, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing and other alternative models of computation, and theoretical aspects of areas such as databases, information retrieval, and networks.

For more information, see http://www.cs.washington.edu/stoc06/

The international workshop on the Universal Urysohn Metric Space will take place at Ben-Gurion University (Beer Sheva, Israel) from 21-24 May, 2006. The Urysohn space U is the universal complete metric separable space. This remarkable mathematical object, introduced by P. Urysohn 80 years ago, has generated a considerable and steadily growing interest over the past two decades. The purpose of the workshop is to bring together leading mathematicians working in the fields of Topological Groups, Functional Analysis, Geometry, Representation Theory, Dynamics, Logic and Set Theory in order to exchange ideas and present results of current research of the Urysohn space.

For more information, see http://www.math.bgu.ac.il/~arkady/Workshop_2006/main_page.html

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The 38th ACM Symposium on Theory of Computing (STOC 2006), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in Seattle, WA, May 21 to 23, 2006. Typical but not exclusive topics of interest include: algorithms and data structures, computational complexity, cryptography, computational geometry, algorithmic graph theory and combinatorics, randomness in computing, parallel and distributed computation, machine learning, applications of logic, algorithmic algebra and coding theory, computational biology, computational game theory, quantum computing and other alternative models of computation, and theoretical aspects of areas such as databases, information retrieval, and networks.

For more information, see http://www.cs.washington.edu/stoc06/

The international workshop on the Universal Urysohn Metric Space will take place at Ben-Gurion University (Beer Sheva, Israel) from 21-24 May, 2006. The Urysohn space U is the universal complete metric separable space. This remarkable mathematical object, introduced by P. Urysohn 80 years ago, has generated a considerable and steadily growing interest over the past two decades. The purpose of the workshop is to bring together leading mathematicians working in the fields of Topological Groups, Functional Analysis, Geometry, Representation Theory, Dynamics, Logic and Set Theory in order to exchange ideas and present results of current research of the Urysohn space.

For more information, see http://www.math.bgu.ac.il/~arkady/Workshop_2006/main_page.html

(dutch only)
NWO organiseert op 23 mei 2006 voor de zesde keer Bessensap. We doen dat samen met de Vereniging Wetenschapsjournalisten Nederland (VWN) en met science center NEMO. Het evenement brengt journalisten, redacteuren, voorlichters en mediagenieke onderzoekers dichter bij elkaar. Het motto: wetenschap ontmoet pers, pers ontmoet wetenschap.

Voor meer informatie, zie http://www.nwo.nl/bessensap

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The international workshop on the Universal Urysohn Metric Space will take place at Ben-Gurion University (Beer Sheva, Israel) from 21-24 May, 2006. The Urysohn space U is the universal complete metric separable space. This remarkable mathematical object, introduced by P. Urysohn 80 years ago, has generated a considerable and steadily growing interest over the past two decades. The purpose of the workshop is to bring together leading mathematicians working in the fields of Topological Groups, Functional Analysis, Geometry, Representation Theory, Dynamics, Logic and Set Theory in order to exchange ideas and present results of current research of the Urysohn space.

For more information, see http://www.math.bgu.ac.il/~arkady/Workshop_2006/main_page.html

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The purpose of these workshops is to bring together individuals, both faculty and graduate students, using mathematical methods in epistemology in small focused meetings. Besides papers with respondents, each workshop will typically include short introductory tutorials (three or four topically related presentations) on formal methods. These tutorials will be oriented particularly to graduate students.

For more information and a preliminary program, see http://ist-socrates.berkeley.edu/~fitelson/few/

The FM Symposia continue to be the premier international forum for practitioners and researchers applying mathematical methods to the design of highly trusted computer systems. It enables them to meet and exchange experiences and ideas. This is the 14th event in this series, and for the first time will take place in North America. As in previous years, an Industry Day will be dedicated for practitioners to share their experiences with industrial applications.

For more information, see http://fm06.mcmaster.ca/

Hybrid logic is a branch of modal logic in which it is possible to directly refer to worlds/times/states or whatever the elements of the (Kripke) model are meant to represent. The workshop HyLo 2006 is likely to be relevant to a wide range of people, including those interested in description logic, feature logic, applied modal logics, temporal logic, and labelled deduction. A theme of special interest at this HyLo workshop will be the combination of hybrid logic with other logics, the basic methodological question being "what is the best way of hybridizing a given logic?"
HyLo 2006 is affiliated with LICS 2006.

For more information, see http://hylomol.ruc.dk/HyLo2006/

The conferences, on the theoretical foundations of machine learning and on the evelopment and analysis of methods for intelligent data analysis, knowledge discovery and machine learning, will be held in parallel and share invited talks.

For more information, see http://www-alg.ist.hokudai.ac.jp/~thomas/ALT06/alt06.jhtml and http://www-ai.ijs.si/~ds06/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The purpose of these workshops is to bring together individuals, both faculty and graduate students, using mathematical methods in epistemology in small focused meetings. Besides papers with respondents, each workshop will typically include short introductory tutorials (three or four topically related presentations) on formal methods. These tutorials will be oriented particularly to graduate students.

For more information and a preliminary program, see http://ist-socrates.berkeley.edu/~fitelson/few/

Registration for the Gödel Centenary Celebration on Friday May 26 is open. The symposium is free of charge. The program is as follows.

10:00       Arrival, tea and coffee
10:20-10:30 Opening: Albert Visser (Utrecht)
10:30-11:45 Juliette Kennedy (Helsinki) & Mark van Atten (Paris):
            A Life Dedicated to the Fundamental
11:45-12:00 Tea break
12:00-13:00 Dick de Jongh (Amsterdam) & Albert Visser (Utrecht):
            The Incompleteness Theorems: What They Say and What They do not Say.
13:00-14:00 Lunch break
14:00-15:00 Benedikt Löwe (Amsterdam):
            Gödel's Contribution to Set Theory
15:00-15:30 Tea break
15:30-16:30 Dennis Dieks (Utrecht):
            Gödel on Time and Relativity

Update (2006/05/22): Due to large interest in the symposium there is only a limited number of seats left. Please sign up before the conference hall is full and registration closed.

For more information, see http://ozsl.uu.nl/goedel/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The purpose of these workshops is to bring together individuals, both faculty and graduate students, using mathematical methods in epistemology in small focused meetings. Besides papers with respondents, each workshop will typically include short introductory tutorials (three or four topically related presentations) on formal methods. These tutorials will be oriented particularly to graduate students.

For more information and a preliminary program, see http://ist-socrates.berkeley.edu/~fitelson/few/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The purpose of these workshops is to bring together individuals, both faculty and graduate students, using mathematical methods in epistemology in small focused meetings. Besides papers with respondents, each workshop will typically include short introductory tutorials (three or four topically related presentations) on formal methods. These tutorials will be oriented particularly to graduate students.

For more information and a preliminary program, see http://ist-socrates.berkeley.edu/~fitelson/few/

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The 6th Int. Conference on Algorithms and Complexity covers research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

For more information, see http://www.dsi.uniroma1.it/~ciac/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The 6th Int. Conference on Algorithms and Complexity covers research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

For more information, see http://www.dsi.uniroma1.it/~ciac/.

Theoretical Computer Science is broadly divided into disciplines dealing with logic, semantics and formal methods on the one hand, and algorithmics and computational complexity on the other. The Newton Institute Semester Programme will focus on active areas of research that cut across this divide, dealing with algorithmic and complexity aspects of logic as well as logical methods in complexity.

Satellite workshops include 'Workshop on Finite and Algorithmic Model Theory', 'Logic and Databases', 'Mathematics of Constraint Satisfaction', 'New Directions in Proof Complexity', 'Constaints and Verification' and 'Games and Verification'.

For more information, see here or http://www.newton.cam.ac.uk/programmes/LAA/

The 6th Int. Conference on Algorithms and Complexity covers research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.

For more information, see http://www.dsi.uniroma1.it/~ciac/.