Traditionally, there has been a deep divide between philosophy of mathematics dealing with foundational issues (questions about mathematical ontology, connections between logic and mathematics, and the proper axiomatic framework) and sociological and didactical approaches to mathematics deadling with a description of mathematical practice (including mathematics education and related matters). Currently, we witness this picture undergoing considerable changes. Recent developments question the special character of philosophy of mathematics as traditionally conceived. Our workshop is devoted to developing this line of development further, putting special emphasis on the epistemological issues involved.

For more information, an online registration form and a preliminary program, see http://www.phimsamp.uni-bonn.de/GAP6/

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/

We are pleased to announce our fifteenth annual BEST conference. There will be four talks by invited speakers:
Natasha Dobrinen (Kurt Godel Research Center for Mathematical Logic)
Michael Hrusak (UNAM)
Istvan Juhasz (Alfred Renyi Institute of Mathematics)
Boban Velickovic (Universite de Paris 7)

For more information, see http://math.boisestate.edu/~best/best15/.

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/

We are pleased to announce our fifteenth annual BEST conference. There will be four talks by invited speakers:
Natasha Dobrinen (Kurt Godel Research Center for Mathematical Logic)
Michael Hrusak (UNAM)
Istvan Juhasz (Alfred Renyi Institute of Mathematics)
Boban Velickovic (Universite de Paris 7)

For more information, see http://math.boisestate.edu/~best/best15/.

The series of MFCS symposia, organized alternately in the Czech Republic, Poland and Slovakia since 1972, has a long and well-established tradition. The MFCS symposia encourage high-quality research in all branches of theoretical computer science. Their broad scope provides an opportunity to bring together specialists who do not usually meet at specialized conferences. Quality papers presenting original research on theoretical aspects of computer science are solicited

For more information, see http://www.mfcs.sk/

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/

Continuing the highly successful series of Workshops on Automated Reasoning, this event will provide an informal forum for the automated reasoning community. The ARW workshop series aims to bring together researchers from all areas of automated reasoning in order to foster links and facilitate cross-fertilisation of ideas among researchers from various disciplines; among researchers from academia, industry and government; and between theoreticians and practitioners.

We invite interested persons to submit a camera-ready, two-page abstract about recent work or work in progress, or a system description. Anyone wishing to attend but not interested in presenting should send a shorter position statement (1/2 - 1 page).

Deadline for submission of papers is February 10th, 2006. For more information, see here, http://www.csc.liv.ac.uk/~clare/ARW/about.html or http://www.cs.nott.ac.uk/~mxw/arw06/

The European Chapter of the ACL (EACL) is the primary professional association for computational linguistics in Europe.

Deadline for early registration is 6 March 2006. For more information and an online registration form, see http://eacl06.itc.it/ or contact jzuidema at science.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/

Continuing the highly successful series of Workshops on Automated Reasoning, this event will provide an informal forum for the automated reasoning community. The ARW workshop series aims to bring together researchers from all areas of automated reasoning in order to foster links and facilitate cross-fertilisation of ideas among researchers from various disciplines; among researchers from academia, industry and government; and between theoreticians and practitioners.

We invite interested persons to submit a camera-ready, two-page abstract about recent work or work in progress, or a system description. Anyone wishing to attend but not interested in presenting should send a shorter position statement (1/2 - 1 page).

Deadline for submission of papers is February 10th, 2006. For more information, see here, http://www.csc.liv.ac.uk/~clare/ARW/about.html or http://www.cs.nott.ac.uk/~mxw/arw06/

The European Chapter of the ACL (EACL) is the primary professional association for computational linguistics in Europe.

Deadline for early registration is 6 March 2006. For more information and an online registration form, see http://eacl06.itc.it/ or contact jzuidema at science.uva.nl

BCTCS provides a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.

Deadline for registration and contributions: February 20, 2006. For more information, an online registration form and a preliminary program, see http://www.cs.swan.ac.uk/bctcs2006/

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 European Chapter of the ACL (EACL) is the primary professional association for computational linguistics in Europe.

Deadline for early registration is 6 March 2006. For more information and an online registration form, see http://eacl06.itc.it/ or contact jzuidema at science.uva.nl

BCTCS provides a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.

Deadline for registration and contributions: February 20, 2006. For more information, an online registration form and a preliminary program, see http://www.cs.swan.ac.uk/bctcs2006/

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 European Chapter of the ACL (EACL) is the primary professional association for computational linguistics in Europe.

Deadline for early registration is 6 March 2006. For more information and an online registration form, see http://eacl06.itc.it/ or contact jzuidema at science.uva.nl

BCTCS provides a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.

Deadline for registration and contributions: February 20, 2006. For more information, an online registration form and a preliminary program, see http://www.cs.swan.ac.uk/bctcs2006/

CCCT'06 is an International Conference that will bring together researchers, developers, practitioners, consultants and users of Computer, Communications and Control Technologies, with the aim to serve as a forum to present current and future work, solutions and problems in these fields, as well as in the relationships among them. Consequently, efforts will be done in order to promote and to foster the analogical thinking required by the Systems Approach for interdisciplinary cross-fertilization, "epistemic things" generation and "technical objects" production.

For more information, see http://www.info-cybernetics.org/ccct06/

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 European Chapter of the ACL (EACL) is the primary professional association for computational linguistics in Europe.

Deadline for early registration is 6 March 2006. For more information and an online registration form, see http://eacl06.itc.it/ or contact jzuidema at science.uva.nl

BCTCS provides a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers.

Deadline for registration and contributions: February 20, 2006. For more information, an online registration form and a preliminary program, see http://www.cs.swan.ac.uk/bctcs2006/

A conference in memory of Stanley Tennenbaum.

For more information, see http://mamls.org/Tennenbaum

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/

Proof complexity is an area of mathematics (and mathematical logic and computational complexity theory in particular) centered around the problem whether the complexity class NP is closed under complementation. With a suitable general definition of a propositional proof system (Cook and Reckhow 1979) this becomes a lengths-of-proofs question: Is there a propositional proof system in which every tautology admits a proof whose length is bounded above by a polynomial in the length of the tautology? The ultimate goal of proof complexity is to show that there is no such proof system; that is, to demonstrate superpolynomial lower bounds for all proof systems.

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

The 47th Annual Symposium on Foundations of Computer Science (FOCS 2006), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held on October 22-24, 2006, at the Doubletree Hotel, in Berkeley, CA.

For more information and a call for papers, see http://focs06.cs.princeton.edu/

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/

Proof complexity is an area of mathematics (and mathematical logic and computational complexity theory in particular) centered around the problem whether the complexity class NP is closed under complementation. With a suitable general definition of a propositional proof system (Cook and Reckhow 1979) this becomes a lengths-of-proofs question: Is there a propositional proof system in which every tautology admits a proof whose length is bounded above by a polynomial in the length of the tautology? The ultimate goal of proof complexity is to show that there is no such proof system; that is, to demonstrate superpolynomial lower bounds for all proof systems.

For more information, see http://www.newton.cam.ac.uk/programmes/LAA/laaw04.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/

Proof complexity is an area of mathematics (and mathematical logic and computational complexity theory in particular) centered around the problem whether the complexity class NP is closed under complementation. With a suitable general definition of a propositional proof system (Cook and Reckhow 1979) this becomes a lengths-of-proofs question: Is there a propositional proof system in which every tautology admits a proof whose length is bounded above by a polynomial in the length of the tautology? The ultimate goal of proof complexity is to show that there is no such proof system; that is, to demonstrate superpolynomial lower bounds for all proof systems.

For more information, see http://www.newton.cam.ac.uk/programmes/LAA/laaw04.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/

Proof complexity is an area of mathematics (and mathematical logic and computational complexity theory in particular) centered around the problem whether the complexity class NP is closed under complementation. With a suitable general definition of a propositional proof system (Cook and Reckhow 1979) this becomes a lengths-of-proofs question: Is there a propositional proof system in which every tautology admits a proof whose length is bounded above by a polynomial in the length of the tautology? The ultimate goal of proof complexity is to show that there is no such proof system; that is, to demonstrate superpolynomial lower bounds for all proof systems.

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

SPIRE 2006 is the 13th Symposium on String Processing and Information Retrieval. The first four editions focused primarily on string processing and South America, and were called WSP (South American Workshop on String Processing). Starting in 1998, the focus of the workshop was broadened to include the area of information retrieval due to its increasing relevance and its inter-relationship with the area of string processing. In addition, since 2000, the conference venue has been in Europe in even years.

SPIRE 2006 covers research in all aspects of string processing, information retrieval, computational biology, pattern matching, semi-structured data, and related applications.

For more information, see http://www.cis.strath.ac.uk/external/spire06/

In recent years, multi-agent systems have come to form one of the key technologies for software development. The second edition of the FAMAS workshop series, after a success of FAMAS'03 affiliated to ETAPS'03 in Warsaw, 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.

FAMAS'06 is affiliated to ECAI 2006. For more information, see http://www.mimuw.edu.pl/MAS/FAMAS/

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 symposium covers research in the use, design and analysis of efficient algorithms and data structures in computer science, discrete applied mathematics, operations research and mathematical programming. It has two tracks, which deal respectively with:
- the design and mathematical analysis of algorithms (the "Design and Analysis" track);
- real-world applications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track).
ESA 2006 is organised in the context of ALGO 2006.

For more information, see http://algo06.inf.ethz.ch/esa/

Artificial Intelligence researchers continue to face huge challenges in their quest to develop truly intelligent systems. The recent developments in the field of neural-symbolic integration bring an opportunity to integrate well-founded symbolic artificial intelligence with robust neural computing machinery to help tackle some of these challenges.

The Workshop on Neural-Symbolic Learning and Reasoning is intended to create an atmosphere of exchange of ideas, providing a forum for the presentation and discussion of the key topics related to neural-symbolic integration.

For more information, see http://www.neural-symbolic.org/NeSy06/

This is the seventh in a series of conferences on the applications of logical methods to foundational issues in the theory of individual and interactive decision-making.

The aim of the LOFT conferences is to promote exchange across different disciplines. Preference is given to papers which bring together the work and problems of several fields, such as game and decision theory, logic, computer science and artificial intelligence, philosophy, cognitive psychology, mathematics and mind sciences.

For more information see http://www.csc.liv.ac.uk/~wiebe/LOFT06/

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 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

Each PALMYR consists of two workshops, one in Paris and one in Amsterdam, and is aimed at fostering connections between two lively logic communities. This year's first meeting will be in Paris on June 27th and 28th, and will have as a theme "What is the relationship between logic and reasoning?" As in the previous editions, each talk will be commented.

For a long time, logic and reasoning have been bedfellows, for better or for worst. Boole viewed logic as nothing less than An investigation into the Laws of Thought, while Frege argued for an irrevocable split up. But even if modern logical literature abound with attempts at getting closer to real-life reasoning (e.g. epistemic, fuzzy, conditional, intensional, paraconsistent, and other "non-classical" logics) the state of their relationship is still unclear. Does logic describe reasoning? Does it provide normative standards for reasoning? For this third PALMYR, we are looking for researchers from, but not only, Paris or Amsterdam interested to share their opinion on this long-standing relationship.

For more information, see https://www.illc.uva.nl/PALMYR/PALMYR-3/.

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 Fourth International Conference on Information, Information'06, and the Fourth Irish Conference on the Mathematical Foundations of Computer Science and Information Technology'06, MFCSIT'06, will be co-located on the campus of the National University of Ireland, Cork (NUI, Cork).

Information'06 will focus on Information and Communication Technologies (ICT) in a broad sense, and the applications of these. MFCSIT'06 will focus on mathematical and theoretical aspects of ICT and, conversely, with the applications of ICT to the mathematical sciences. Both conferences are part of interdisciplinary, international conference series held every two years.

For more information, see http://www.ucc.ie/info-mfcsit/

The Logic Colloquium is the annual European conference on logic, organised under the auspices of the Association for Symbolic Logic (ASL). It provides a forum for presenting and discussing the new developments in the area of logic. The conference attracts researchers from logic, with an emphasis on mathematical logic, but also including researchers from computer science logic and philosophical logic. In previous years, the Logic Colloquium has been organised in Athens (2005) and Turin (2004). The leading researchers on logic participate in the conference, as invited speaker, tutorial speaker or as participant. It also attracts students (master and Ph.D. students) in logic from all over the world and in that way it also serves for students as an introduction into the research field of logic.

For more information, see http://www.cs.ru.nl/lc2006/ or contact lc2006 at cs.ru.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/

The 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006), and the 10th International Workshop on Randomized Techniques in Computation (RANDOM 2006) will be held at UPC Barcelona, from August 28-31, 2006. APPROX 2006 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2006 focuses on applications of randomness to computational and combinatorial problems.

For more information, see http://cui.unige.ch/tcs/random-approx/

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 Parameterized and Exact Computation covers research in all aspects of parameterized and exact computation and complexity. The goal is to present recent research results, including significant work-in-progress, and to identify and explore directions for future research.

For more information, see http://algo06.inf.ethz.ch/iwpec

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 third MODNET SUMMER SCHOOL will be in Freiburg, 19-22 April, 2006. It is intended for PhD-students, but other participants are welcome. There will be three 5 hour courses, supported by tutorials:

• Introduction to Algebraic Geometry (Anand Pillay)>
• Finite Model Theory (Joerg Flum)
• Advanced Stability Theory (Enrique Casanovas)

For more information, see http://home.mathematik.uni-freiburg.de/ziegler/modnet.freiburg.06.html

The 2006 meeting is the ninth installment of the Symposium series, which is designed to provide a forum where logicians and linguists can meet to share and discuss ideas and issues about how linguistics and logic influence each other, with the aim of promoting a fruitful cooperation. This year's symposium theme is "information structure". Invited speakers include Jonathan Ginzburg, Marcus Kracht, Manfred Krifka and Barbara H. Partee.

For more information, see http://www.nytud.hu/lola9/

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 third MODNET SUMMER SCHOOL will be in Freiburg, 19-22 April, 2006. It is intended for PhD-students, but other participants are welcome. There will be three 5 hour courses, supported by tutorials:

• Introduction to Algebraic Geometry (Anand Pillay)>
• Finite Model Theory (Joerg Flum)
• Advanced Stability Theory (Enrique Casanovas)

For more information, see http://home.mathematik.uni-freiburg.de/ziegler/modnet.freiburg.06.html

Mathematical Logic has been contributing in a relevant way to the birth and the development of Computer Science. Accordingly the AILA Logic and Computer Science workshop just aims at bringing together researchers interested in the interactions between Mathematical Logic and several fields in Computer Science.

AILA Logic, Model and Computer Science workshop LMCS06 wishes also to honour the memory of Sauro Tulipani, who so largely and brilliantly, and for so many years contributed to this research area. Hence the workshop will focus in particular on Sauro's main research interests
- computability and computational complexity,
- uncertainty logic,
but it will also deal with other topics such as
- logic of concurrency,
- game semantics
and further themes concerned with the relationship between Mathematical Logic and Computer Science.

For more information, see http://dmi.unicam.it/merelli/LMCS06/

The CP conference is the annual international conference on constraint programming and related areas. It is concerned with all aspects of computing with constraints, including: theory, algorithms, applications, environments, languages, models and systems. CP 2006 includes a technical programme, where presentations of theoretical and application papers, as well as invited talks, tutorials, posters and system demos aim at describing the best results and techniques in the state-of-the-art of constraint programming. Moreover, CP 2006 continues the tradition of the CP doctoral programme, in which PhD students can present their work, listen to tutorials on career and ethical issues, and discuss their work with senior researchers via a mentoring scheme. Finally, there will also be a number of workshops, where researchers will be able to meet in an informal setting and discuss their most recent ideas with their peers.

For more information, see http://www.sciences.univ-nantes.fr/cp06/

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 third MODNET SUMMER SCHOOL will be in Freiburg, 19-22 April, 2006. It is intended for PhD-students, but other participants are welcome. There will be three 5 hour courses, supported by tutorials:

• Introduction to Algebraic Geometry (Anand Pillay)>
• Finite Model Theory (Joerg Flum)
• Advanced Stability Theory (Enrique Casanovas)

For more information, see http://home.mathematik.uni-freiburg.de/ziegler/modnet.freiburg.06.html

Mathematical Logic has been contributing in a relevant way to the birth and the development of Computer Science. Accordingly the AILA Logic and Computer Science workshop just aims at bringing together researchers interested in the interactions between Mathematical Logic and several fields in Computer Science.

AILA Logic, Model and Computer Science workshop LMCS06 wishes also to honour the memory of Sauro Tulipani, who so largely and brilliantly, and for so many years contributed to this research area. Hence the workshop will focus in particular on Sauro's main research interests
- computability and computational complexity,
- uncertainty logic,
but it will also deal with other topics such as
- logic of concurrency,
- game semantics
and further themes concerned with the relationship between Mathematical Logic and Computer Science.

For more information, see http://dmi.unicam.it/merelli/LMCS06/

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 third MODNET SUMMER SCHOOL will be in Freiburg, 19-22 April, 2006. It is intended for PhD-students, but other participants are welcome. There will be three 5 hour courses, supported by tutorials:

• Introduction to Algebraic Geometry (Anand Pillay)>
• Finite Model Theory (Joerg Flum)
• Advanced Stability Theory (Enrique Casanovas)

For more information, see http://home.mathematik.uni-freiburg.de/ziegler/modnet.freiburg.06.html

Mathematical Logic has been contributing in a relevant way to the birth and the development of Computer Science. Accordingly the AILA Logic and Computer Science workshop just aims at bringing together researchers interested in the interactions between Mathematical Logic and several fields in Computer Science.

AILA Logic, Model and Computer Science workshop LMCS06 wishes also to honour the memory of Sauro Tulipani, who so largely and brilliantly, and for so many years contributed to this research area. Hence the workshop will focus in particular on Sauro's main research interests
- computability and computational complexity,
- uncertainty logic,
but it will also deal with other topics such as
- logic of concurrency,
- game semantics
and further themes concerned with the relationship between Mathematical Logic and Computer Science.

For more information, see http://dmi.unicam.it/merelli/LMCS06/

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/

Mathematical Aspects of Computer and Information Sciences (MACIS) is a new series of conferences where foundational research on theoretical and practical problems of mathematics for computing and information processing may be presented and discussed. MACIS also addresses experimental and case studies, scientific and engineering computation, design and implementation of algorithms and software systems, and applications of mathematical methods and tools to outstanding and emerging problems in applied computer and information sciences.

For more information, see http://www.cc4cm.org/macis2006/

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/

Logics, Foundations of Mathematics, and the Quest for Understanding the Nature of Knowledge.
An International Symposium Celebrating the 100th Birthday of Kurt Goedel.
Organized by the Kurt Goedel Society (http://kgs.logic.at/).

The Symposium will consist of more than 20 invited lectures by eminent scientists in the fields of logics, mathematics, philosophy, physics, cosmology, and theology. There will be a young researchers competition and a poster session, and a social program including a visit to Goedel's birthplace Brno.

For more information, including the list of invited speakers and an online registration form, please see http://www.logic.at/goedel2006/ or contact goedel2006team at logic.at

The entire ILLC-community is invited to attend this workshop organized to celebrate Krister Segerberg's 70th birthday. After the talks, there will be a reception on the 3d floor of the Euclides Building.

For more information, please contact f.veltman at 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/

Logics, Foundations of Mathematics, and the Quest for Understanding the Nature of Knowledge.
An International Symposium Celebrating the 100th Birthday of Kurt Goedel.
Organized by the Kurt Goedel Society (http://kgs.logic.at/).

The Symposium will consist of more than 20 invited lectures by eminent scientists in the fields of logics, mathematics, philosophy, physics, cosmology, and theology. There will be a young researchers competition and a poster session, and a social program including a visit to Goedel's birthplace Brno.

For more information, including the list of invited speakers and an online registration form, please see http://www.logic.at/goedel2006/ or contact goedel2006team at logic.at

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/

Logics, Foundations of Mathematics, and the Quest for Understanding the Nature of Knowledge.
An International Symposium Celebrating the 100th Birthday of Kurt Goedel.
Organized by the Kurt Goedel Society (http://kgs.logic.at/).

The Symposium will consist of more than 20 invited lectures by eminent scientists in the fields of logics, mathematics, philosophy, physics, cosmology, and theology. There will be a young researchers competition and a poster session, and a social program including a visit to Goedel's birthplace Brno.

For more information, including the list of invited speakers and an online registration form, please see http://www.logic.at/goedel2006/ or contact goedel2006team at logic.at

The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm.

LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress, so it is a real workshop in the sense that it is also intended to provide useful feedback to authors on their research. Formal proceedings are produced only after the conference, so that authors can incorporate this feedback in the published papers. This year, tool demonstrations are also solicited as a separate submission category. LOPSTR'06 is colocated with ICALP'06, PPDP'06 and CSWF'06.

For more information, see http://www.dsi.unive.it/lopstr2006/

The XIII SLALM will take place in the beautiful city of OAXACA, MEXICO, from August 7th to August 12th. Prior to the conference the "Escuela Latinoamericana de Logica Matematica" will be held, giving four introductory courses.

For more information, see here or http://slalm.izt.uam.mx/

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/