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/

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/

RIAO 2007 aims to present recent, substantial, original and unpublished research that has been validated to the level of the creation of a functioning prototype. We are interested in large-scale solutions to the problem of accessing the semantic content found in unstructured text, images, video and audio.

For more information, see http://www.riao.org/index_eng.php

Since the inception of linguistics, the mainstream of researchers considered language as a static system. The situation has changed dramatically over the last few decades as the interests of the scientific community shifted from studying meaning to studying the processes behind the production and comprehension of utterances. This dynamic turn gave a much wider perspective on meaning in the framework of formal semantics and opened the door for new mathematical tools in the conceptual foundations of linguistics. Modal logic, computability theory, game theory and many others have become standard tools for formal semanticists.

PALMYR V will bring together young researchers interested in these dynamic perspectives on language and meaning.

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

This will be the first international congress dedicated entirely to the square of opposition. The square will be considered in its various aspects. There will be talks by the best specialists of the square and this will be also an interdisciplinary event gathering people from various fields : logic, philosophy, mathematics, psychology, linguistics, anthropology, semiotics. Visual and artistic representations of the square will also be presented.

For further information, visit the website below: http://www.square-of-opposition.org/.

(dutch only: the conference itself will be english spoken)
De Vereniging voor Logica en Wijsbegeerte der Exacte Wetenschappen (VvL) nodigt u hierbij uit voor het symposium Logica en Cognitie, georganiseerd in samenwerking met Cover (studievereniging Kunstmatige Intelligentie, Groningen). Het symposium staat onder auspiciën van het Instituut Kunstmatige Intelligentie van de Rijksuniversiteit Groningen, het Cognitieprogramma van NWO en de onderzoeksscholen BCN en SIKS.

Alle belangstellenden zijn van harte welkom. De toegang is gratis, inclusief koffie en thee, lunch en een drankje aan het einde van de middag.

Voor meer informatie en abstracts, zie http://www.ai.rug.nl/~sympocie/2007/

Since the inception of linguistics, the mainstream of researchers considered language as a static system. The situation has changed dramatically over the last few decades as the interests of the scientific community shifted from studying meaning to studying the processes behind the production and comprehension of utterances. This dynamic turn gave a much wider perspective on meaning in the framework of formal semantics and opened the door for new mathematical tools in the conceptual foundations of linguistics. Modal logic, computability theory, game theory and many others have become standard tools for formal semanticists.

PALMYR V will bring together young researchers interested in these dynamic perspectives on language and meaning.

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

This will be the first international congress dedicated entirely to the square of opposition. The square will be considered in its various aspects. There will be talks by the best specialists of the square and this will be also an interdisciplinary event gathering people from various fields : logic, philosophy, mathematics, psychology, linguistics, anthropology, semiotics. Visual and artistic representations of the square will also be presented.

For further information, visit the website below: http://www.square-of-opposition.org/.

This will be the first international congress dedicated entirely to the square of opposition. The square will be considered in its various aspects. There will be talks by the best specialists of the square and this will be also an interdisciplinary event gathering people from various fields : logic, philosophy, mathematics, psychology, linguistics, anthropology, semiotics. Visual and artistic representations of the square will also be presented.

For further information, visit the website below: http://www.square-of-opposition.org/.

The Fourth International Symposium on Neural Networks (ISNN 2007) will be held in Nanjing, as a sequel of ISNN 2004/ISNN 2005/ISNN 2006. Nanjing is the old capital of China, a modern metropolitan with 2470-year history and rich cultural heritage, featuring numerous historic and scenery sites. ISNN 2007 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of neural network research and applications in diverse fields. The symposium will feature plenary speeches given by worldwide renowned scholars, regular sessions with broad coverage, and some special sessions focusing on popular topics.

For more information, see http://liu.ece.uic.edu/ISNN07/

Deadline for registration: 2007

For more information, see http://www.lpar.net/2007/

The Fourth International Symposium on Neural Networks (ISNN 2007) will be held in Nanjing, as a sequel of ISNN 2004/ISNN 2005/ISNN 2006. Nanjing is the old capital of China, a modern metropolitan with 2470-year history and rich cultural heritage, featuring numerous historic and scenery sites. ISNN 2007 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of neural network research and applications in diverse fields. The symposium will feature plenary speeches given by worldwide renowned scholars, regular sessions with broad coverage, and some special sessions focusing on popular topics.

For more information, see http://liu.ece.uic.edu/ISNN07/

The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science.

For more information, see http://www.cs.gc.cuny.edu/lfcs07

The Fourth International Symposium on Neural Networks (ISNN 2007) will be held in Nanjing, as a sequel of ISNN 2004/ISNN 2005/ISNN 2006. Nanjing is the old capital of China, a modern metropolitan with 2470-year history and rich cultural heritage, featuring numerous historic and scenery sites. ISNN 2007 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of neural network research and applications in diverse fields. The symposium will feature plenary speeches given by worldwide renowned scholars, regular sessions with broad coverage, and some special sessions focusing on popular topics.

For more information, see http://liu.ece.uic.edu/ISNN07/

The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science.

For more information, see http://www.cs.gc.cuny.edu/lfcs07

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

The Fourth International Symposium on Neural Networks (ISNN 2007) will be held in Nanjing, as a sequel of ISNN 2004/ISNN 2005/ISNN 2006. Nanjing is the old capital of China, a modern metropolitan with 2470-year history and rich cultural heritage, featuring numerous historic and scenery sites. ISNN 2007 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of neural network research and applications in diverse fields. The symposium will feature plenary speeches given by worldwide renowned scholars, regular sessions with broad coverage, and some special sessions focusing on popular topics.

For more information, see http://liu.ece.uic.edu/ISNN07/

The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science.

For more information, see http://www.cs.gc.cuny.edu/lfcs07

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

The Fourth International Symposium on Neural Networks (ISNN 2007) will be held in Nanjing, as a sequel of ISNN 2004/ISNN 2005/ISNN 2006. Nanjing is the old capital of China, a modern metropolitan with 2470-year history and rich cultural heritage, featuring numerous historic and scenery sites. ISNN 2007 aims to provide a high-level international forum for scientists, engineers, and educators to present the state of the art of neural network research and applications in diverse fields. The symposium will feature plenary speeches given by worldwide renowned scholars, regular sessions with broad coverage, and some special sessions focusing on popular topics.

For more information, see http://liu.ece.uic.edu/ISNN07/

The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science.

For more information, see http://www.cs.gc.cuny.edu/lfcs07

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

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

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

This international conference brings together leading figures in philosophy to discuss the nature and the logic of vagueness. Organised by Arche, The AHRC Research Centre for the Philosophy of Logic, Language, Mathematics and Mind, the conference will conclude the series of workshops hosted by the Arche Vagueness Project since January 2004.

Confirmed Speakers: Graeme Forbes, Leon Horsten, John MacFarlane, Vann McGee, Nathan Salmon, Scott Soames, Crispin Wright

For more information, see http://www.st-andrews.ac.uk/%7Earche/vagueness/

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

This international conference brings together leading figures in philosophy to discuss the nature and the logic of vagueness. Organised by Arche, The AHRC Research Centre for the Philosophy of Logic, Language, Mathematics and Mind, the conference will conclude the series of workshops hosted by the Arche Vagueness Project since January 2004.

Confirmed Speakers: Graeme Forbes, Leon Horsten, John MacFarlane, Vann McGee, Nathan Salmon, Scott Soames, Crispin Wright

For more information, see http://www.st-andrews.ac.uk/%7Earche/vagueness/

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

The 39th ACM Symposium on Theory of Computing (STOC 2007), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in San Diego, CA, June 11 to 13, 2007, as part of the FCRC. 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://research.microsoft.com/research/theory/feige/homepagefiles/stoc07.htm

Recently, the subject of language evolution has received more and more interest in almost all fields related to language: from anthropology and cognitive psychology to linguistics and neurobiology. A very original approach to the subject is through experimentation with robots. Considering the present state of research on Artificial Intelligence it is possible, in principle, to program autonomous (even humanoid) robots in such a way that they independently create a communication system grounded in their perceptual experience of the world.

Monday the 11th of June, the NVP presents a masterclass in which both this approach and more classicical experiments with people are discussed. The masterclass will be of interest to PhD students in a broad range of fields. Motivated master students are also welcome. There will be opportunity to present your ideas on the subject and receive individual feedback.

Participation is limited to 30 participants, so be quick to register. For more information, see http://www.psychonomie.nl/nvpmasterclass.

Speakers include Dirk van Dalen, Henk Barendregt, Alain Michel, Philippe Nabonnand & Gerhard Heinzmann, Per Martin-Löf (E.W. Beth Lecture), Marcel Guillaume, Mohammad Ardeshir, Carl Posy, Richard Tieszen, Bernd Buldt, Mathieu Marion, Dag Prawitz, Charles McCarty, Jacques Dubucs, Jean Fichot, Douglas Bridges, Erik Palmgren, Giovanni Sambin, Peter Schroeder-Heister, Anton Setzer, Mitsu Okada, Göran Sundholm & Mark van Atten and Wim Veldman.

Further information: http://www.ccic-cerisy.asso.fr/intuitionnisme07.html (please note that although the titles and abstracts on the webpage are in French, most talks will actually be in English).

The 39th ACM Symposium on Theory of Computing (STOC 2007), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in San Diego, CA, June 11 to 13, 2007, as part of the FCRC. 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://research.microsoft.com/research/theory/feige/homepagefiles/stoc07.htm

SIGACT is pleased to announce the first Symposium on Theory of Computing (STOC) ACM Student Research Competition (SRC) sponsored by Microsoft Research. The STOC SRC offers an opportunity for undergraduate students conducting theoretical computer science research to present their original work at STOC 2007. Research in all areas of theoretical computer science is welcome.

More information is available on the participation page of the ACM SRC website http://www.acm.org/src

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

The 39th ACM Symposium on Theory of Computing (STOC 2007), sponsored by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT), will be held in San Diego, CA, June 11 to 13, 2007, as part of the FCRC. 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://research.microsoft.com/research/theory/feige/homepagefiles/stoc07.htm

SIGACT is pleased to announce the first Symposium on Theory of Computing (STOC) ACM Student Research Competition (SRC) sponsored by Microsoft Research. The STOC SRC offers an opportunity for undergraduate students conducting theoretical computer science research to present their original work at STOC 2007. Research in all areas of theoretical computer science is welcome.

More information is available on the participation page of the ACM SRC website http://www.acm.org/src

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

On the 14th of June the students association for Cognitive Artificial Intelligence (CKI) at Utrecht University will hold its annual symposium. This year's symposium will focus on the famous mathematical question whether the complexity class P equals NP. In four talks we shall try to gain some insight into the problem from different perspectives, varying from cryptography to quantum logic.

These are the topics:
- Prof. Dr. Jan van Leeuwen, UU: "The history of the P vs. NP problem."
- Dr. Eike Kiltz, CWI Amsterdam: "P vs. NP in Cryptography. Which World Are We Living In?"
- Dr. Joost Joosten, ILLC/UvA: "Looking for hay in a haystack."
- Dr. Elham Kashefi, Oxford UK: "A quantum complexity tour."
Chairman of the day will be Prof. Dr. Pieter Adriaans (UvA).

For more information, see http://symposium.uscki.nl or contact symposium at uscki.nl.

The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation.

The school has developed into an important meeting place and forum for discussion for students, researchers and IT professionals interested in the interdisciplinary study of Logic, Language and Information. ESSLLI-2007 is organised under the auspices of the European Association for Logic, Language and Information (FoLLI).

For more information, see the ESSLLI website at https://www.cs.tcd.ie/esslli2007/.

Quotation is a sort of metarepresentation that is found in all natural languages. Linguistic research has made clear that in quotation, there are complex syntactic, morphological and graphematic mechanisms at work. In philosophy of language, there are long-standing debates on quotation and paradoxes, on the use-mention distinction, and the meaning of quotation marks and quotation expressions. More recently, quotation has become a topic within the debate on the semantics/pragmatics distinction.

For more information, see http://www.zitatundbedeutung.uni-mainz.de/eng/icqm.php or contact Markus Steinbach at steinbac at uni-mainz.de.

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

Recent years have witnessed increased research activity on the interface between logic and universal algebra. In particular, the use of algebraic methods has proved to be fruitful in the study of non-classical logics -- such as modal logic, fuzzy logic, and substructural logics -- and ordered structures play a central role in this relationship. The purpose of the conference is to bring together researchers from these fields to foster collaboration and further research.

For more information, see http://www.math.vanderbilt.edu/~oal2007/

The conference is concerned with the theory of computability and complexity over real-valued data. Unlike the well established classical theory over discrete structures, the theory of computation over continuous data is still in early stages of development, despite remarkable progress in recent years. Many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet and exchange ideas and knowledge.

This year CCA 2007 is co-located with the conference CiE 2007.

For more information, see http://cca-net.de/cca2007/

The conference is concerned with the theory of computability and complexity over real-valued data. Unlike the well established classical theory over discrete structures, the theory of computation over continuous data is still in early stages of development, despite remarkable progress in recent years. Many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet and exchange ideas and knowledge.

This year CCA 2007 is co-located with the conference CiE 2007.

For more information, see http://cca-net.de/cca2007/

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

The conference is concerned with the theory of computability and complexity over real-valued data. Unlike the well established classical theory over discrete structures, the theory of computation over continuous data is still in early stages of development, despite remarkable progress in recent years. Many important fundamental problems have not yet been studied, and presumably numerous unexpected and surprising results are waiting to be detected. Scientists working in the area of computation on real-valued data come from different fields, such as theoretical computer science, domain theory, logic, constructive mathematics, computer arithmetic, numerical mathematics and all branches of analysis. The conference provides a unique opportunity for people from such diverse areas to meet and exchange ideas and knowledge.

This year CCA 2007 is co-located with the conference CiE 2007.

For more information, see http://cca-net.de/cca2007/

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

As part of the workshop and meeting in Amsterdam for the EU FP-6 project "EmCAP: Emergent Cognition Through Active Perception", Monday is devoted to research presentations of contributing project members of the University of Plymouth, Universiteit van Amsterdam, Hungarian Academy of Sciences, and University Pompeu Fabra:

9:00 Neurophysiology and music cognition modeling
11:40 Psychology and music cognition modeling
15:00 Overview presentations
17:00 End of public part of the workshop

For more information, see http://www.hum.uva.nl/mmm/EmCAP/EmCAP-poster-UvA-workshop.pdf, http://www.hum.uva.nl/mmm/EmCAP/ or http://emcap.iua.upf.edu. Workshop participation is limited to EmCAP members. However, interested researchers can register by sending an email to lsmith at science.uva.nl before Monday 11 June 2007.

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

The dynamic turn in logic opens new perspective for epistemology and action theory. Information changes and interactive situations unveil fresh and fascinating issues about fondamental concepts such as knowledge, beliefs and rationality. This workshop aims at giving these issues high priority in the philosophical agenda, by bringing together philosophers and logicians that share interest for dynamics phenomena.

Organization: Mathieu Marion (UQAM), Patrick Girard (Stanford), Olivier Roy (Amsterdam) and Francois Lepage (UdM)

For more information, a program and a registration form, see http://www.unites.uqam.ca/philo/dlmontreal2007/

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

The dynamic turn in logic opens new perspective for epistemology and action theory. Information changes and interactive situations unveil fresh and fascinating issues about fondamental concepts such as knowledge, beliefs and rationality. This workshop aims at giving these issues high priority in the philosophical agenda, by bringing together philosophers and logicians that share interest for dynamics phenomena.

Organization: Mathieu Marion (UQAM), Patrick Girard (Stanford), Olivier Roy (Amsterdam) and Francois Lepage (UdM)

For more information, a program and a registration form, see http://www.unites.uqam.ca/philo/dlmontreal2007/

The 5th International Conference on Logic, Game Theory and Social Choice will be held at the Euskalduna Conference Centre in Bilbao, Spain, from 20th to 22th June 2007. Just like the four previous LGS-conferences (Tilburg 1999, Saint Petersburg 2001, Siena 2003, Caen 2005), LGS5 will focus on the theoretical connections between the three disciplines in the conference title. The conference programme will consist of three invited lectures by Robert J. Aumann, Matthew O. Jackson and Mamoru Kaneko, and contributed papers.

For more information,, see http://www.lgs-5.com/.

The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems.

For more information, see http://www.info.fundp.ac.be/~pys/TARK07/.

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

The dynamic turn in logic opens new perspective for epistemology and action theory. Information changes and interactive situations unveil fresh and fascinating issues about fondamental concepts such as knowledge, beliefs and rationality. This workshop aims at giving these issues high priority in the philosophical agenda, by bringing together philosophers and logicians that share interest for dynamics phenomena.

Organization: Mathieu Marion (UQAM), Patrick Girard (Stanford), Olivier Roy (Amsterdam) and Francois Lepage (UdM)

For more information, a program and a registration form, see http://www.unites.uqam.ca/philo/dlmontreal2007/

The 5th International Conference on Logic, Game Theory and Social Choice will be held at the Euskalduna Conference Centre in Bilbao, Spain, from 20th to 22th June 2007. Just like the four previous LGS-conferences (Tilburg 1999, Saint Petersburg 2001, Siena 2003, Caen 2005), LGS5 will focus on the theoretical connections between the three disciplines in the conference title. The conference programme will consist of three invited lectures by Robert J. Aumann, Matthew O. Jackson and Mamoru Kaneko, and contributed papers.

For more information,, see http://www.lgs-5.com/.

The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems.

For more information, see http://www.info.fundp.ac.be/~pys/TARK07/.

WG 2007 aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists.

For more information, see http://wwwteo.informatik.uni-rostock.de/wg2007/

Analysis of algorithms is a scientific basis for computation, providing a link between abstract algorithms and the performance characteristics of their implementations in the real world. The general effort to precisely predict the performance of algorithms has come to involve research in analytic combinatorics, the analysis of random discrete structures, asymptotic analysis, exact and limiting distributions, and other fields of inquiry in computer science, probability theory, and enumerative combinatorics.

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

AutoMathA 2007 is the main conference of the programme AutoMathA of the European Science Foundation. This five-year multidisciplinary programme (2005-2010), at the crossroads of mathematics, theoretical computer science and applications, gathers 14 European countries. The goal of AutoMathA is to propose a set of co-ordinated actions for advancing the theory of automata and for increasing its application to challenging scientific problems.

For more information, see http://www.math.unipa.it/~ama07/

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

The dynamic turn in logic opens new perspective for epistemology and action theory. Information changes and interactive situations unveil fresh and fascinating issues about fondamental concepts such as knowledge, beliefs and rationality. This workshop aims at giving these issues high priority in the philosophical agenda, by bringing together philosophers and logicians that share interest for dynamics phenomena.

Organization: Mathieu Marion (UQAM), Patrick Girard (Stanford), Olivier Roy (Amsterdam) and Francois Lepage (UdM)

For more information, a program and a registration form, see http://www.unites.uqam.ca/philo/dlmontreal2007/

The 5th International Conference on Logic, Game Theory and Social Choice will be held at the Euskalduna Conference Centre in Bilbao, Spain, from 20th to 22th June 2007. Just like the four previous LGS-conferences (Tilburg 1999, Saint Petersburg 2001, Siena 2003, Caen 2005), LGS5 will focus on the theoretical connections between the three disciplines in the conference title. The conference programme will consist of three invited lectures by Robert J. Aumann, Matthew O. Jackson and Mamoru Kaneko, and contributed papers.

For more information,, see http://www.lgs-5.com/.

The mission of the TARK conferences is to bring together researchers from a wide variety of fields, including Artificial Intelligence, Cryptography, Distributed Computing, Economics and Game Theory, Linguistics, Philosophy, and Psychology, in order to further our understanding of interdisciplinary issues involving reasoning about rationality and knowledge. Topics of interest include, but are not limited to, semantic models for knowledge, belief, and uncertainty, bounded rationality and resource-bounded reasoning, commonsense epistemic reasoning, epistemic logic, knowledge and action, applications of reasoning about knowledge and other mental states, belief revision, and foundations of multi-agent systems.

For more information, see http://www.info.fundp.ac.be/~pys/TARK07/.

WG 2007 aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists.

For more information, see http://wwwteo.informatik.uni-rostock.de/wg2007/

In recent years formalizing actions has become a common theme in formal philosophy and philosophical logic. Understanding actions and agency is important for e.g. dynamic logic, deontic logic and epistemic logic. Actions might be seen as unique or as part of a more general theory of dynamic processes. In this workshop we bring together top researchers who formalize actions within dynamic logic, deontic logic, epistemic logic, formal decision theory, temporal logic - and any combination of these.

For more information, see http://akira.ruc.dk/~mamobe/actionworkshop.html.

Speakers include Ulrich Berger and Stanley Wainer (Festkolloquium) and Peter Aczel, Hajime Ishihara, Gerhard Jaeger, Ralph Matthes, Erik Palmgren, Monika Seisenberger and Anton Setzer (Workshop).

Please register no later than than June 1, 2007 by email to ratiu at math.lmu.de. For more information, see http://www.mathematik.uni-muenchen.de/~pschust/puc2.html.

CiE is a European network of mathematicians, logicians, computer scientists, philosophers, theoretical physicists and others interested in new developments in computability and in their underlying significance for the real world.

CiE 2007 will address various aspects of the ways computability and theoretical computer science enable scientists and philosophers to deal with mathematical and real world issues, ranging through problems related to logic, mathematics, physical processes, real computation and learning theory. At the same time it will focus on different ways in which computability emerges from the real world, and how this affects our way of thinking about everyday computational issues.

CiE 2007 will be co-located with the annual CCA (Computability and Complexity in Analysis) Conference

For more information, an online registration form and a preliminary program, see http://www.mat.unisi.it/newsito/cie07.html

WG 2007 aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in Computer Science, or by extracting new problems from applications. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists.

For more information, see http://wwwteo.informatik.uni-rostock.de/wg2007/

Speakers include Ulrich Berger and Stanley Wainer (Festkolloquium) and Peter Aczel, Hajime Ishihara, Gerhard Jaeger, Ralph Matthes, Erik Palmgren, Monika Seisenberger and Anton Setzer (Workshop).

Please register no later than than June 1, 2007 by email to ratiu at math.lmu.de. For more information, see http://www.mathematik.uni-muenchen.de/~pschust/puc2.html.

This is the 2nd Brussels Conference on Generative Linguistics.

For more information, see http://www.kubrussel.ac.be/onderwijs/onderzoekscentra/crissp/bcgl/2007/index.htm or email info at crissp.be.

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

This is the 2nd Brussels Conference on Generative Linguistics.

For more information, see http://www.kubrussel.ac.be/onderwijs/onderzoekscentra/crissp/bcgl/2007/index.htm or email info at crissp.be.

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

The International Conference on Rewriting Techniques and Applications RTA is the major forum for the presentation of research on all aspects of rewriting. The 18th Conference (RTA'07) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'07), which comprises, in addition to RTA'07, the conference on Typed Lambda Calculi and Applications (TLCA'07) and eight workshops (HOR, PATE, RULE, SecReT, UNIF, WFLP, WRS, and WST).

For more information, see http://www.lsv.ens-cachan.fr/rdp07/rta.html

This is the 2nd Brussels Conference on Generative Linguistics.

For more information, see http://www.kubrussel.ac.be/onderwijs/onderzoekscentra/crissp/bcgl/2007/index.htm or email info at crissp.be.

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

The International Conference on Rewriting Techniques and Applications RTA is the major forum for the presentation of research on all aspects of rewriting. The 18th Conference (RTA'07) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'07), which comprises, in addition to RTA'07, the conference on Typed Lambda Calculi and Applications (TLCA'07) and eight workshops (HOR, PATE, RULE, SecReT, UNIF, WFLP, WRS, and WST).

For more information, see http://www.lsv.ens-cachan.fr/rdp07/rta.html

Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and automated deduction systems (ADS) towards the development of universal mathematical assistant systems (MAS).

Currently, symbolic computation is divided into several (more or less) independent branches, traditional ones (e.g. computer algebra and theorem proving) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.). The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated MAS that will routinely be used by mathematicians, computer scientists, and engineers in their every-day business.

For more information, see http://www.risc.uni-linz.ac.at/about/conferences/Calculemus2007/

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

The International Conference on Rewriting Techniques and Applications RTA is the major forum for the presentation of research on all aspects of rewriting. The 18th Conference (RTA'07) is organized as part of the Federated Conference on Rewriting, Deduction, and Programming (RDP'07), which comprises, in addition to RTA'07, the conference on Typed Lambda Calculi and Applications (TLCA'07) and eight workshops (HOR, PATE, RULE, SecReT, UNIF, WFLP, WRS, and WST).

For more information, see http://www.lsv.ens-cachan.fr/rdp07/rta.html

Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and automated deduction systems (ADS) towards the development of universal mathematical assistant systems (MAS).

Currently, symbolic computation is divided into several (more or less) independent branches, traditional ones (e.g. computer algebra and theorem proving) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.). The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated MAS that will routinely be used by mathematicians, computer scientists, and engineers in their every-day business.

For more information, see http://www.risc.uni-linz.ac.at/about/conferences/Calculemus2007/

The workshop GPMR-LS1 is the inaugural workshop of the working group "Logic & Semantics" of the Gesellschaft für Philosophie des Mittel-alters und der Renaissance. We aim to bring together all researchers interested in logical and semantical aspects of medieval and early modern philosophy.

Invited Speakers include Bert Bos, Catarina Dutilh Novaes, Sten Ebbesen, Peter King, Gyula Klima, Simo Knuuttila, Peter Ohrstrom and Stephen Read

For more information, see https://www.illc.uva.nl/GPMR-LS1/

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

The 28th annual international Petri Net conference and tutorials will be organised by the Institute of Computer Science at the University of Podlasie and Institute of Computer Science of the Polish Academy of Sciences.

For more information, see http://atpn2007.ap.siedlce.pl.

Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and automated deduction systems (ADS) towards the development of universal mathematical assistant systems (MAS).

Currently, symbolic computation is divided into several (more or less) independent branches, traditional ones (e.g. computer algebra and theorem proving) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.). The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated MAS that will routinely be used by mathematicians, computer scientists, and engineers in their every-day business.

For more information, see http://www.risc.uni-linz.ac.at/about/conferences/Calculemus2007/

The workshop GPMR-LS1 is the inaugural workshop of the working group "Logic & Semantics" of the Gesellschaft für Philosophie des Mittel-alters und der Renaissance. We aim to bring together all researchers interested in logical and semantical aspects of medieval and early modern philosophy.

Invited Speakers include Bert Bos, Catarina Dutilh Novaes, Sten Ebbesen, Peter King, Gyula Klima, Simo Knuuttila, Peter Ohrstrom and Stephen Read

For more information, see https://www.illc.uva.nl/GPMR-LS1/

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

In 1957 Andrzej Mostowski published his paper introducing the notion of generalized quantifier. Later on wide area of logical research was opened and many papers devoted to generalized quantifiers were published. The main purpose of the meeting is to summarize current knowledge on this subject.

For more information, see http://www.logika.uw.edu.pl/50yearsGQ/.

Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and automated deduction systems (ADS) towards the development of universal mathematical assistant systems (MAS).

Currently, symbolic computation is divided into several (more or less) independent branches, traditional ones (e.g. computer algebra and theorem proving) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.). The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated MAS that will routinely be used by mathematicians, computer scientists, and engineers in their every-day business.

For more information, see http://www.risc.uni-linz.ac.at/about/conferences/Calculemus2007/

The workshop GPMR-LS1 is the inaugural workshop of the working group "Logic & Semantics" of the Gesellschaft für Philosophie des Mittel-alters und der Renaissance. We aim to bring together all researchers interested in logical and semantical aspects of medieval and early modern philosophy.

Invited Speakers include Bert Bos, Catarina Dutilh Novaes, Sten Ebbesen, Peter King, Gyula Klima, Simo Knuuttila, Peter Ohrstrom and Stephen Read

For more information, see https://www.illc.uva.nl/GPMR-LS1/