The meeting aims at bringing together young researchers in the history, philosophy and didactics of mathematics or related fields from all over Europe, especially PhD students and PostDocs, to exchange their results and discuss work in progress. This year's theme, Mathematical practice & development throughout history, offers a wide scope for contributions, providing the opportunity of interaction between historians, philosophers, and researchers in the didactics of mathematics. It allows for a variety of conceptions of mathematics, and for a combination of different research methods used in history, philosophy and didactics.

Our invited guest speaker will be Leo Corry from the University of Tel Aviv.

The deadline for participant registration is September 1st. For more information, see http://www.novembertagung.uni-bonn.de/.

The Amsterdam Colloquia aim at bringing together linguists, philosophers, logicians and computer scientists who share an interest in the formal study of the semantics and pragmatics of natural and formal languages. The spectrum of topics covered ranges from descriptive (syntactic and semantic analyses of all kinds of expressions) to theoretical (logical and computational properties of semantic theories, philosophical foundations, evolution and learning of language).

For more information, see

https://www.illc.uva.nl/AC2007/

AQIS'07 will focus on quantum information science and technology. This is a new interdisciplinary field that bridges quantum physics, computer science, mathematics, as well as computing technologies. AQIS'07 is the successor of the series EQIS'01-EQIS'05 and AQIS'06. Following tradition, AQIS'07 will consist of invited talks and selected oral communications and posters.

For more and the latest information, please check the conference website at http://qc.naist.jp/aqis07/ or e-mail to aqis07 at is.naist.jp.

Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logics say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for discussing possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents.

LRBA 2007 is part of Multi-Agent Logics, Languages, and Organisations: Federated Workshops (MALLOW'007)

For more information, see http://www.agents.cs.nott.ac.uk/events/lrba07/

AQIS'07 will focus on quantum information science and technology. This is a new interdisciplinary field that bridges quantum physics, computer science, mathematics, as well as computing technologies. AQIS'07 is the successor of the series EQIS'01-EQIS'05 and AQIS'06. Following tradition, AQIS'07 will consist of invited talks and selected oral communications and posters.

For more and the latest information, please check the conference website at http://qc.naist.jp/aqis07/ or e-mail to aqis07 at is.naist.jp.

Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logics say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for discussing possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents.

LRBA 2007 is part of Multi-Agent Logics, Languages, and Organisations: Federated Workshops (MALLOW'007)

For more information, see http://www.agents.cs.nott.ac.uk/events/lrba07/

AQIS'07 will focus on quantum information science and technology. This is a new interdisciplinary field that bridges quantum physics, computer science, mathematics, as well as computing technologies. AQIS'07 is the successor of the series EQIS'01-EQIS'05 and AQIS'06. Following tradition, AQIS'07 will consist of invited talks and selected oral communications and posters.

For more and the latest information, please check the conference website at http://qc.naist.jp/aqis07/ or e-mail to aqis07 at is.naist.jp.

Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logics say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for discussing possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents.

LRBA 2007 is part of Multi-Agent Logics, Languages, and Organisations: Federated Workshops (MALLOW'007)

For more information, see http://www.agents.cs.nott.ac.uk/events/lrba07/

There are a plethora of views as to the relationship between probability and logic and a panoply of proposals for combining the two. In particular, probabilistic logics offer formal combinations of probability and logic - often, however, at the expense of perspicuity and tractability. The question arises as to whether probabilistic networks might be used to render probabilistic logics more comprehensible and computationally feasible. In this workshop we aim to bring researchers from a variety of disciplines together to assess the prospects of applying probabilistic networks to probabilistic logics, and more generally to elucidate the relationship between probability and logic.

For more information, see http://www.kent.ac.uk/secl/philosophy/jw/2007/progic/

AQIS'07 will focus on quantum information science and technology. This is a new interdisciplinary field that bridges quantum physics, computer science, mathematics, as well as computing technologies. AQIS'07 is the successor of the series EQIS'01-EQIS'05 and AQIS'06. Following tradition, AQIS'07 will consist of invited talks and selected oral communications and posters.

For more and the latest information, please check the conference website at http://qc.naist.jp/aqis07/ or e-mail to aqis07 at is.naist.jp.

Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logics say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for discussing possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents.

LRBA 2007 is part of Multi-Agent Logics, Languages, and Organisations: Federated Workshops (MALLOW'007)

For more information, see http://www.agents.cs.nott.ac.uk/events/lrba07/

There are a plethora of views as to the relationship between probability and logic and a panoply of proposals for combining the two. In particular, probabilistic logics offer formal combinations of probability and logic - often, however, at the expense of perspicuity and tractability. The question arises as to whether probabilistic networks might be used to render probabilistic logics more comprehensible and computationally feasible. In this workshop we aim to bring researchers from a variety of disciplines together to assess the prospects of applying probabilistic networks to probabilistic logics, and more generally to elucidate the relationship between probability and logic.

For more information, see http://www.kent.ac.uk/secl/philosophy/jw/2007/progic/

In recent years, multi-agent systems have come to form one of the key technologies for software development. The third edition of the FAMAS workshop series, after the success of FAMAS'03 affiliated to ETAPS'03 in Warsaw and FAMAS'06 affiliated with ECAI'06 in Riva del Garda, aims at bringing together researchers from the fields of logic, theoretical computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems

The workshop will be part of this year's Multi-Agent Logics, Languages, and Organisations federated Workshops, MALLOW'007 hosted by the Department of Computer Science and St. Chad's College, University of Durham, U.K. Participants in the FAMAS workshop are urged to participate in the co-located workshops. For more details of MALLOW, please see http://www.dur.ac.uk/durham.agents007/MALLOW007/

For more information, see http://www.mimuw.edu.pl/MAS/FAMAS007/

The British Logic Colloquium (BLC 2007) will be held in De Morgan House, Central London, 6th September to 8th September 2007.

For more information, see here or http://www.dcs.bbk.ac.uk/~roman/blc/

The workshop "Methods for Modalities" (M4M) aims to bring together researchers interested in developing algorithms, verification methods and tools based on modal logics. Here the term "modal logics" is conceived broadly, including temporal logic, description logic, guarded fragments, conditional logic, temporal and hybrid logic, etc.

To stimulate interaction and transfer of expertise, M4M will feature a number of invited talks by leading scientists, research presentations aimed at highlighting new developments, and submissions of system demonstrations.

For more information, see http://m4m.loria.fr/M4M5

Logics of knowledge and belief, as well as other attitudes such as desire or intention, have been extensively studied. However, most of the treatments of knowledge and belief make strong and idealised assumptions about the reasoners. For example, traditional epistemic logics say that agents know all logical consequences of their knowledge. Similarly, logics of action and strategic interaction are usually based on game theoretic models which assume perfect rationality. Models based on such assumptions can be used to describe ideal agents without bounds on resources such as time, memory, etc, but they fail to accurately describe non-ideal agents which are computationally bounded. The workshop aims to provide a forum for discussing possible solutions to the problem of formally capturing the properties of knowledge, belief, action, etc. of non-idealised resource-bounded agents.

LRBA 2007 is part of Multi-Agent Logics, Languages, and Organisations: Federated Workshops (MALLOW'007)

For more information, see http://www.agents.cs.nott.ac.uk/events/lrba07/

There are a plethora of views as to the relationship between probability and logic and a panoply of proposals for combining the two. In particular, probabilistic logics offer formal combinations of probability and logic - often, however, at the expense of perspicuity and tractability. The question arises as to whether probabilistic networks might be used to render probabilistic logics more comprehensible and computationally feasible. In this workshop we aim to bring researchers from a variety of disciplines together to assess the prospects of applying probabilistic networks to probabilistic logics, and more generally to elucidate the relationship between probability and logic.

For more information, see http://www.kent.ac.uk/secl/philosophy/jw/2007/progic/

In recent years, multi-agent systems have come to form one of the key technologies for software development. The third edition of the FAMAS workshop series, after the success of FAMAS'03 affiliated to ETAPS'03 in Warsaw and FAMAS'06 affiliated with ECAI'06 in Riva del Garda, aims at bringing together researchers from the fields of logic, theoretical computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems

The workshop will be part of this year's Multi-Agent Logics, Languages, and Organisations federated Workshops, MALLOW'007 hosted by the Department of Computer Science and St. Chad's College, University of Durham, U.K. Participants in the FAMAS workshop are urged to participate in the co-located workshops. For more details of MALLOW, please see http://www.dur.ac.uk/durham.agents007/MALLOW007/

For more information, see http://www.mimuw.edu.pl/MAS/FAMAS007/

The British Logic Colloquium (BLC 2007) will be held in De Morgan House, Central London, 6th September to 8th September 2007.

For more information, see here or http://www.dcs.bbk.ac.uk/~roman/blc/

Paul Vitányi is one of the world's most distinguished researchers in the area of Kolmogorov complexity. His research deserves broad attention. To honor Paul and his research, CWI has invited three of the world's most important researchers in theoretical computer science: Andrew Yao (Turing award 2000), Ming Li (coauthor of 'Introduction to Kolmogorov Complexity and its Applications) and Leonid Levin (co-inventor of NP-completeness). Paul's research is the central theme of this afternoon.

For more information and registration, see http://www.cwi.nl/events/2007/cwilectures1.html/.

The British Logic Colloquium (BLC 2007) will be held in De Morgan House, Central London, 6th September to 8th September 2007.

For more information, see here or http://www.dcs.bbk.ac.uk/~roman/blc/

Within the course of the last 50 years, Artificial Intelligence has developed into a major field of research with a multitude of facets and application areas. While, in general, Artificial Intelligence research is driven by application needs, it is nevertheless a fact that foundational questions and theoretical insights have always been one of the driving forces behind its development. This includes the quest for realising intelligent behaviour in artificial systems as envisioned in the early days of AI research. But it also comprises biological inspirations e.g. for robot design, artificial neural networks, or emergent intelligence, as well as logical underpinnings of automated deduc-tion and knowledge representation.

Indeed, formal and foundational aspects of artificial intelligence are being studied in many sub areas in order to serve application needs. It lies in the nature of such fundamental research that a critical mass of different formal perspectives can generate a cross-fertilization of ideas and applications. We therefore intend to bring together researchers working on foundational aspects of Artificial Intelligence across different communities, in order to stimulate an exchange of ideas and methods between them.

For more information, see http://logic.aifb.uni-karlsruhe.de/wiki/FAInt-07

The 2007 Annual Meeting of the GAMES Network "Games and Automata for Synthesis and Validation" will be held in Lausanne from the 10th to 13th September 2007. It will be co-located with CSL 2007 (www2.unil.ch/csl07), with a joint GAMES-CSL programme on 11th September.

As in previous years, GAMES 2007 will be an informal workshop, without proceedings, with a programme consisting of 5-6 invited tutorials (90 min), contributed talks (30 min) and short presentations (15 min).

For more information, see http://www.games.rwth-aachen.de/.

Topics include halting problems, minimal universal codes, computational complexity, self-reproduction and decidability in areas such as Digital computation (fundamental classical models), Digital models of computation, and Analog and Hybrid Computations.

For more information, see http://www.univ-orleans.fr/lifo/Manifestations/MCU07/

The 2007 Annual Meeting of the GAMES Network "Games and Automata for Synthesis and Validation" will be held in Lausanne from the 10th to 13th September 2007. It will be co-located with CSL 2007 (www2.unil.ch/csl07), with a joint GAMES-CSL programme on 11th September.

As in previous years, GAMES 2007 will be an informal workshop, without proceedings, with a programme consisting of 5-6 invited tutorials (90 min), contributed talks (30 min) and short presentations (15 min).

For more information, see http://www.games.rwth-aachen.de/.

Topics include halting problems, minimal universal codes, computational complexity, self-reproduction and decidability in areas such as Digital computation (fundamental classical models), Digital models of computation, and Analog and Hybrid Computations.

For more information, see http://www.univ-orleans.fr/lifo/Manifestations/MCU07/

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007.

For more information, see http://www.unil.ch/csl07/.

The 2007 Annual Meeting of the GAMES Network "Games and Automata for Synthesis and Validation" will be held in Lausanne from the 10th to 13th September 2007. It will be co-located with CSL 2007 (www2.unil.ch/csl07), with a joint GAMES-CSL programme on 11th September.

As in previous years, GAMES 2007 will be an informal workshop, without proceedings, with a programme consisting of 5-6 invited tutorials (90 min), contributed talks (30 min) and short presentations (15 min).

For more information, see http://www.games.rwth-aachen.de/.

Topics include halting problems, minimal universal codes, computational complexity, self-reproduction and decidability in areas such as Digital computation (fundamental classical models), Digital models of computation, and Analog and Hybrid Computations.

For more information, see http://www.univ-orleans.fr/lifo/Manifestations/MCU07/

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007.

For more information, see http://www.unil.ch/csl07/.

The 2007 Annual Meeting of the GAMES Network "Games and Automata for Synthesis and Validation" will be held in Lausanne from the 10th to 13th September 2007. It will be co-located with CSL 2007 (www2.unil.ch/csl07), with a joint GAMES-CSL programme on 11th September.

As in previous years, GAMES 2007 will be an informal workshop, without proceedings, with a programme consisting of 5-6 invited tutorials (90 min), contributed talks (30 min) and short presentations (15 min).

For more information, see http://www.games.rwth-aachen.de/.

Topics include halting problems, minimal universal codes, computational complexity, self-reproduction and decidability in areas such as Digital computation (fundamental classical models), Digital models of computation, and Analog and Hybrid Computations.

For more information, see http://www.univ-orleans.fr/lifo/Manifestations/MCU07/

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007.

For more information, see http://www.unil.ch/csl07/.

Topics include halting problems, minimal universal codes, computational complexity, self-reproduction and decidability in areas such as Digital computation (fundamental classical models), Digital models of computation, and Analog and Hybrid Computations.

For more information, see http://www.univ-orleans.fr/lifo/Manifestations/MCU07/

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007.

For more information, see http://www.unil.ch/csl07/.

This is the first of set of meetings researchers in the Netherlands and Germany on Optimality Theory and Interpretation are organising for keeping in touch about issues they are working on. Interested others are very welcome (please announce your attendance to henk.zeevat@uva.nl, also saying whether you are joining in for lunch).

For more information, see here

The Center for Junior Research Fellows (ZWN) at the University of Konstanz sponsors a winter school program at the University of Konstanz every year. The program is targeted at postdoctoral scholars who do not hold a tenured position. Running a winter/summer school offers young researchers the opportunity to popularize their own research fields and ideas, to intensive discuss their research topic with experts in their field in a calm, inspiring environment and beyond time pressure. Moreover,

According to the multidisciplinary character of the ZWN, postdoctoral scholars of all research disciplines may apply. Alternating every other year, the program is open to members of the University of Konstanz only and to external applicants. For the winter 2007/2008 the ZWN announces the financing of a winter/summer school up to EUR 14,000. Young scholars both with and without German residency are invited to apply by 15 September 2007.

For more information, see http://www.uni-konstanz.de/forschung/zwn/Ausschreibung/.

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL). The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science. CSL'07, the 16th annual EACSL conference will be organized in Lausanne by the Western Swiss Center for Logic, History and Philosophy of Sciences, and the University of Lausanne. The Ackermann Award for 2007 is sponsored by Logitech and will be presented to the recipients at CSL'07. A joint session with GAMES 07, the annual meeting of the European Network will take place on 11 September, 2007.

For more information, see http://www.unil.ch/csl07/.

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

On the one hand, computer science is now aiming at the development of more and more complex and autonomous computer systems which call for forms of meta-systems with regulating and controlling functions. On the other hand, philosophical disciplines are now trying to systematically address key notions in the understanding of social agency, e.g., "norm", "intention", "obligation".

Aim of the symposium is to bring together leading researchers from computer-science and philosophy in order to exchange points of view and stimulate scientific cooperation on the issue of normative systems. Speakers include Johan van Benthem, Christiano Castelfranchi Davide Grossi John Horty and Marek Sergot

Participation is free and includes lunch and coffee and tea breaks. However, advance registration is required. Please register before September 11 by sending an email to henry at cs.uu.nl or broersen at cs.uu.nl. For more information, see http://people.cs.uu.nl/davide/ANS/home.htm

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

LATIN was launched in 1992 to foster the interaction between the Latin-American community and computer scientists around the world. LATIN'08 will be the eighth of a series.

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

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

The broad theme of the Fall schools is the interaction of Mathematical Logic and Complexity Theory, with special emphasis on Proof Complexity. The main guest speaker of this school will be Albert Atserias (Universitat Politecnica de Catalunya) who will deliver a tutorial on "Finite Model Theory and Complexity". The second tutorial series will concentrate on recent advances in Proof Complexity and will be given by members of the Prague school.

Deadline for registration: May 1, 2007

For more information, see http://www.math.cas.cz/~krajicek/trest07.html

The Third Vienna Tbilisi Summer School in Logic and Language is held from 24-28 September in Tbilisi. The event is co-located with the Seventh International Tbilisi Symposium on Language, Logic and Computation, held October 1-5.

For more information, see http://www.logic.at/tbilisi07/

The Third Vienna Tbilisi Summer School in Logic and Language is held from 24-28 September in Tbilisi. The event is co-located with the Seventh International Tbilisi Symposium on Language, Logic and Computation, held October 1-5.

For more information, see http://www.logic.at/tbilisi07/

The annual IEEE Congress on Evolutionary Computation is one of the leading events in the area of evolutionary computation. CEC 2007 will feature a world-class conference that aims to bring together researchers and practitioners in the field of evolutionary computation and computational intelligence from all around the globe. Technical exchanges within the research community will encompass keynote speeches, special sessions, tutorial workshops, panel discussions as well as poster presentations.

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

The Third Vienna Tbilisi Summer School in Logic and Language is held from 24-28 September in Tbilisi. The event is co-located with the Seventh International Tbilisi Symposium on Language, Logic and Computation, held October 1-5.

For more information, see http://www.logic.at/tbilisi07/

The annual IEEE Congress on Evolutionary Computation is one of the leading events in the area of evolutionary computation. CEC 2007 will feature a world-class conference that aims to bring together researchers and practitioners in the field of evolutionary computation and computational intelligence from all around the globe. Technical exchanges within the research community will encompass keynote speeches, special sessions, tutorial workshops, panel discussions as well as poster presentations.

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

The Third Vienna Tbilisi Summer School in Logic and Language is held from 24-28 September in Tbilisi. The event is co-located with the Seventh International Tbilisi Symposium on Language, Logic and Computation, held October 1-5.

For more information, see http://www.logic.at/tbilisi07/

The annual IEEE Congress on Evolutionary Computation is one of the leading events in the area of evolutionary computation. CEC 2007 will feature a world-class conference that aims to bring together researchers and practitioners in the field of evolutionary computation and computational intelligence from all around the globe. Technical exchanges within the research community will encompass keynote speeches, special sessions, tutorial workshops, panel discussions as well as poster presentations.

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

The Third Vienna Tbilisi Summer School in Logic and Language is held from 24-28 September in Tbilisi. The event is co-located with the Seventh International Tbilisi Symposium on Language, Logic and Computation, held October 1-5.

For more information, see http://www.logic.at/tbilisi07/

The annual IEEE Congress on Evolutionary Computation is one of the leading events in the area of evolutionary computation. CEC 2007 will feature a world-class conference that aims to bring together researchers and practitioners in the field of evolutionary computation and computational intelligence from all around the globe. Technical exchanges within the research community will encompass keynote speeches, special sessions, tutorial workshops, panel discussions as well as poster presentations.

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

Games are an important tool in set theory and model theory. This GLLC meeting (the 14th in the GLLC series) will focus on the current work of students from Amsterdam and Helsinki dealing with aspects of games in set theory and model theory. It is also to be seen as an encounter between Dutch and Finnish culture in mathematical logic and a great opportunity to learn about each others' research plans, goals, techniques and questions.

Speakers include Ioanna Dimitriou, Tapio Eerola, Jokke Hasa, Daisuke Ikegami, Lauri Keskinen, Yurii Khomskii, Vadim Kulikov, Brian Semmes, Laura Sutinen and Lauri Tuomi.

For more information, see https://www.illc.uva.nl/lgc/gllc14.5/ or contact Daisuke Ikegami <ikegami at science.uva.nl>.