CADE-23 is the 23rd International Conference on Automated Deduction, the major forum for the presentation of research in all aspects of automated deduction.

Topics of interest range from theoretical foundations to high-performance implementations in a wide variety of logics and logical theories, methods, and applications.

For more information, see http://cade23.ii.uni.wroc.pl/.

For more information, see http://www.bslps.be/YRD2.html

We are pleased to announce that Winter School in Abstract Analysis, section Set Theory will take place between January 29th and February 5th in Hejnice, Czech Republic. Intended audience are researchers, postdocs and students from Set Theory, Topology, Analysis and related fields. Tutorial speakers for this year are Andreas Blass, Péter Komjáth, Petr Simon and Lionel Nguyen Van Thé

Deadlines for grand application and registration are December 11th and December 31st, respectively. To get more information about the conference and grants and to register please visit our web page at http://www.winterschool.eu.

The conference CCR, also known as conference on Logic, Computability and Randomness, will be in the tradition of the previous meetings in Córdoba (Argentina) 2004, Buenos Aires (Argentina) 2007, Nanjing (China) 2008, Luminy (France) 2009 and Notre Dame (USA) 2010. Topics include Algorithmic randomness, Computability theory, Kolmogorov complexity, Computational complexity and Reverse mathematics and logic

For more information, see http://cca-net.de/ccr2011/. CCR-2011 is co-located with CCA-2011.

The conference is concerned with the theory of computability and complexity over real-valued data.

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. 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 discovered.

For more information, see http://cca-net.de/cca2011/. CCA-2011 is co-located with CCR-2011.

For more information, see http://www.bslps.be/YRD2.html

We are pleased to announce that Winter School in Abstract Analysis, section Set Theory will take place between January 29th and February 5th in Hejnice, Czech Republic. Intended audience are researchers, postdocs and students from Set Theory, Topology, Analysis and related fields. Tutorial speakers for this year are Andreas Blass, Péter Komjáth, Petr Simon and Lionel Nguyen Van Thé

Deadlines for grand application and registration are December 11th and December 31st, respectively. To get more information about the conference and grants and to register please visit our web page at http://www.winterschool.eu.

The conference CCR, also known as conference on Logic, Computability and Randomness, will be in the tradition of the previous meetings in Córdoba (Argentina) 2004, Buenos Aires (Argentina) 2007, Nanjing (China) 2008, Luminy (France) 2009 and Notre Dame (USA) 2010. Topics include Algorithmic randomness, Computability theory, Kolmogorov complexity, Computational complexity and Reverse mathematics and logic

For more information, see http://cca-net.de/ccr2011/. CCR-2011 is co-located with CCA-2011.

The conference is concerned with the theory of computability and complexity over real-valued data.

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. 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 discovered.

For more information, see http://cca-net.de/cca2011/. CCA-2011 is co-located with CCR-2011.

For more information, see http://www.bslps.be/YRD2.html

We are pleased to announce that Winter School in Abstract Analysis, section Set Theory will take place between January 29th and February 5th in Hejnice, Czech Republic. Intended audience are researchers, postdocs and students from Set Theory, Topology, Analysis and related fields. Tutorial speakers for this year are Andreas Blass, Péter Komjáth, Petr Simon and Lionel Nguyen Van Thé

Deadlines for grand application and registration are December 11th and December 31st, respectively. To get more information about the conference and grants and to register please visit our web page at http://www.winterschool.eu.

The conference CCR, also known as conference on Logic, Computability and Randomness, will be in the tradition of the previous meetings in Córdoba (Argentina) 2004, Buenos Aires (Argentina) 2007, Nanjing (China) 2008, Luminy (France) 2009 and Notre Dame (USA) 2010. Topics include Algorithmic randomness, Computability theory, Kolmogorov complexity, Computational complexity and Reverse mathematics and logic

For more information, see http://cca-net.de/ccr2011/. CCR-2011 is co-located with CCA-2011.

The conference is concerned with the theory of computability and complexity over real-valued data.

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. 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 discovered.

For more information, see http://cca-net.de/cca2011/. CCA-2011 is co-located with CCR-2011.

For more information, see http://www.bslps.be/YRD2.html

We are pleased to announce that Winter School in Abstract Analysis, section Set Theory will take place between January 29th and February 5th in Hejnice, Czech Republic. Intended audience are researchers, postdocs and students from Set Theory, Topology, Analysis and related fields. Tutorial speakers for this year are Andreas Blass, Péter Komjáth, Petr Simon and Lionel Nguyen Van Thé

Deadlines for grand application and registration are December 11th and December 31st, respectively. To get more information about the conference and grants and to register please visit our web page at http://www.winterschool.eu.

The conference CCR, also known as conference on Logic, Computability and Randomness, will be in the tradition of the previous meetings in Córdoba (Argentina) 2004, Buenos Aires (Argentina) 2007, Nanjing (China) 2008, Luminy (France) 2009 and Notre Dame (USA) 2010. Topics include Algorithmic randomness, Computability theory, Kolmogorov complexity, Computational complexity and Reverse mathematics and logic

For more information, see http://cca-net.de/ccr2011/. CCR-2011 is co-located with CCA-2011.

The conference is concerned with the theory of computability and complexity over real-valued data.

Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science. Computability theory is the study of the limitations and abilities of computers in principle. Computational complexity theory provides a framework for understanding the cost of solving computational problems, as measured by the requirement for resources such as time and space. The classical approach in these areas is to consider algorithms as operating on finite strings of symbols from a finite alphabet. Such strings may represent various discrete objects such as integers or algebraic expressions, but cannot represent general real or complex numbers, unless they are rounded.

Most mathematical models in physics and engineering, however, are based on the real number concept. Thus, a computability theory and a complexity theory over the real numbers and over more general continuous data structures is needed. 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 discovered.

For more information, see http://cca-net.de/cca2011/. CCA-2011 is co-located with CCR-2011.

The next Very Informal Gathering of Logicians at UCLA (VIG) will be held February 4 to 6, 2011. This is the sixteenth in a series of logic meetings at UCLA that began in 1976, and honors Yiannis Moschovakis on the occasion of his formal retirement from UCLA.

Invited speakers include Uri Andrews, Lou van den Dries, Rachel Epstein, Ilijas Farah, Haim Gaifman, Itay Kaplan, Phokion Kolaitis, Stephan Kreutzer, Joan Moschovakis, Larry Moss, and Slawek Solecki.

The meeting is open to all, and modest Travel Awards are available for graduate students in logic. Further information can be found on the UCLA Logic Center website, http://www.logic.ucla.edu/.

For more information, see http://www.bslps.be/YRD2.html

We are pleased to announce that Winter School in Abstract Analysis, section Set Theory will take place between January 29th and February 5th in Hejnice, Czech Republic. Intended audience are researchers, postdocs and students from Set Theory, Topology, Analysis and related fields. Tutorial speakers for this year are Andreas Blass, Péter Komjáth, Petr Simon and Lionel Nguyen Van Thé

Deadlines for grand application and registration are December 11th and December 31st, respectively. To get more information about the conference and grants and to register please visit our web page at http://www.winterschool.eu.

The next Very Informal Gathering of Logicians at UCLA (VIG) will be held February 4 to 6, 2011. This is the sixteenth in a series of logic meetings at UCLA that began in 1976, and honors Yiannis Moschovakis on the occasion of his formal retirement from UCLA.

Invited speakers include Uri Andrews, Lou van den Dries, Rachel Epstein, Ilijas Farah, Haim Gaifman, Itay Kaplan, Phokion Kolaitis, Stephan Kreutzer, Joan Moschovakis, Larry Moss, and Slawek Solecki.

The meeting is open to all, and modest Travel Awards are available for graduate students in logic. Further information can be found on the UCLA Logic Center website, http://www.logic.ucla.edu/.

LACL'2011 is the 6th edition of a series of international conferences on logical and formal methods in computational linguistics. It addresses in particular the use of type theoretic, proof theoretic and model theoretic methods for describing natural language syntax and semantics, as well as the implementation of natural language processing software relying on such models. It will be held at the LIRMM, Montpellier, France. It will be co-located with TALN, the conference of the French association for NLP (ATALA).

For more information, see http://lacl.gforge.inria.fr/

For more information, see http://www.bslps.be/YRD2.html

The next Very Informal Gathering of Logicians at UCLA (VIG) will be held February 4 to 6, 2011. This is the sixteenth in a series of logic meetings at UCLA that began in 1976, and honors Yiannis Moschovakis on the occasion of his formal retirement from UCLA.

Invited speakers include Uri Andrews, Lou van den Dries, Rachel Epstein, Ilijas Farah, Haim Gaifman, Itay Kaplan, Phokion Kolaitis, Stephan Kreutzer, Joan Moschovakis, Larry Moss, and Slawek Solecki.

The meeting is open to all, and modest Travel Awards are available for graduate students in logic. Further information can be found on the UCLA Logic Center website, http://www.logic.ucla.edu/.

RPPW13 will be held at the Max Planck Institute for Human Cognitive and Brain Sciences in Leipzig, Germany. This event continues the tradition of workshops catering for those engaged in the scientific study of rhythm perception and production. The three-day workshop will include invited spoken presentations and posters. Spoken presentations will be held in a single stream, and posters will be displayed during two poster sessions. As with past RPPWs, the number of participants will be limited in order to facilitate lively interaction and discussion. We plan to have around 80 presenters (30 spoken presentations and 40-50 posters).

Previous meetings have been held in France, Ireland, Belgium, England, the Netherlands, and Germany. The last workshop to be held in Germany took place at Ohlstadt in 1996. We are delighted to welcome the RPPW community to Leipzig in 2011.

For more information, see http://www.cbs.mpg.de/news/events/workshops/ws-rpp.

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

Established in 2004, the ICDCIT conference series has become a platform for researchers to exchange research results and ideas on the foundations and applications of Distributed Computing and Internet Technologies. Increasingly, such technologies enable individuals and organizations to jointly engage in the production, processing and dissemination of knowledge.

The 7th International Conference on Distributed Computing and Internet Technologies (ICDCIT - 2011) will take place in Bhubaneswar during 9 - 12 February 2011. It will be co-organized by KIIT University, Bhubaneswar, India and Centre for Electronic Governance, UNU-IIST, Macao.

For more information, see http://www.icdcit.ac.in/.

The ProDi workshop focuses on the relationship between proof-theoretic and dialogical approaches to logic. Formally, it is an internal meeting organized by two collaborative research projects within the ESF programme "Modelling intelligent interaction - Logic in the Humanities, Social and Computational sciences (LogICCC)" (http://www.esf.org/index.php?id=3241) together with some external experts (including Andreas Blass, George Metcalfe, Helge Rückert and Morten Sørensen).

However, there will be two or three slots for contributed talks (30 min). If you are interested to contribute such a talk, please send an abstract to Thomas Piecha (ProDi-CfP at informatik.uni-tuebingen.de). The deadline is 7 February 2011. We would notify you until 10 February of whether we can accept it or not.

Participants are welcome. In that case please send an e-mail to Thomas Piecha until 10 February.

For more information, see http://www-ls.informatik.uni-tuebingen.de/prodi/

For more information, see http://www.bslps.be/YRD2.html

Established in 2004, the ICDCIT conference series has become a platform for researchers to exchange research results and ideas on the foundations and applications of Distributed Computing and Internet Technologies. Increasingly, such technologies enable individuals and organizations to jointly engage in the production, processing and dissemination of knowledge.

The 7th International Conference on Distributed Computing and Internet Technologies (ICDCIT - 2011) will take place in Bhubaneswar during 9 - 12 February 2011. It will be co-organized by KIIT University, Bhubaneswar, India and Centre for Electronic Governance, UNU-IIST, Macao.

For more information, see http://www.icdcit.ac.in/.

For more information, see http://www.bslps.be/YRD2.html

Established in 2004, the ICDCIT conference series has become a platform for researchers to exchange research results and ideas on the foundations and applications of Distributed Computing and Internet Technologies. Increasingly, such technologies enable individuals and organizations to jointly engage in the production, processing and dissemination of knowledge.

The 7th International Conference on Distributed Computing and Internet Technologies (ICDCIT - 2011) will take place in Bhubaneswar during 9 - 12 February 2011. It will be co-organized by KIIT University, Bhubaneswar, India and Centre for Electronic Governance, UNU-IIST, Macao.

For more information, see http://www.icdcit.ac.in/.

For more information, see http://www.bslps.be/YRD2.html

Established in 2004, the ICDCIT conference series has become a platform for researchers to exchange research results and ideas on the foundations and applications of Distributed Computing and Internet Technologies. Increasingly, such technologies enable individuals and organizations to jointly engage in the production, processing and dissemination of knowledge.

The 7th International Conference on Distributed Computing and Internet Technologies (ICDCIT - 2011) will take place in Bhubaneswar during 9 - 12 February 2011. It will be co-organized by KIIT University, Bhubaneswar, India and Centre for Electronic Governance, UNU-IIST, Macao.

For more information, see http://www.icdcit.ac.in/.

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

The conference theme is "The Computational Turn: Past, Presents, Futures?" In part, the phrase "the computational turn" refers to the multiple ways in which the increasing availability and usability of computers allowed philosophers to explore a range of traditional philosophical interests in new ways, often shedding significant new light on traditional issues and arguments. Simultaneously, computer scientists, mathematicians, and others whose work focused on computation and computational devices often found their work to evoke (if not force) reflection and debate precisely on the philosophical assumptions and potential implications of their research. These two large streams of development inspired what became the first of the Computing and Philosophy (CAP) conferences in 1986 (devoted to Computer-Assisted Instruction in philosophy). Since 1986, CAP conferences have grown in scope and range, to include a bewildering array of intersections between computation and philosophy as explored across a global range of cultures and traditions.

For more information, see http://www.imv.au.dk/en/iacap/ and http://www.ia-cap.org/conferences.php.

All logical systems make a distinction between logical and non-logical symbols, and the meaning of the former needs to be specified in detail and in effect defines the logic in question. This distinction is usually stipulated (though it can be argued that natural languages make a similar distinction), but the issue of the grounds for it, i.e. of what characterizes a logical constant, is a central question in logic, cutting across the huge variety of logical systems existing today. This question has been tackled from various sides, ranging from historical investigation to formal criteria spelled out within different logical frameworks. The main aim of this ESSLLI-2001 workshop is to gain a better understanding of the problem by bringing together complementary approaches coming from various fields, namely logic, philosophy of logic and mathematics, linguistics and the history of logic.

For more information, see http://lumiere.ens.fr/~dbonnay/files/conference/logicalconstants.htm.

In Generalized Quantifier Theory (GQT) and Discourse Representation Theory (DRT), many quantifiers are semantically identical to one another: most and more than half; at least three, more than two and three; and about 100 and some 100. Even when there is no identity, the meanings of quantifiers overlap, and many quantifiers could be used truthfully to describe the same situation. Nevertheless, the choice of a specific quantifier by a speaker has semantic and pragmatic consequences, and listeners are sensitive to the subtleties of a speaker's choice. The goal of a theory of quantifier use is an account of how speakers choose one of the many true quantifiers and how listeners interpret a speaker's choice. The PUQOL workshop aims to bring together current research within semantics, logic, pragmatics, and cognitive science that addresses quantifier use within the perspective of model theoretic semantics and pragmatics.

PUQOL will take place as part of the 23rd European Summer School in Logic, Language and Information (ESSLLI 2011).

For more information, see http://www.zas.gwz-berlin.de/workshop_puqol.html

The 2011 EPISTEME conference will focus on the intersection of formal and social epistemology. The use of formal models in social epistemology is not a new development. Many philosophers have modeled concepts and ideas in social epistemology by using formal tools of various types (e.g., game theory, Bayesian decision theory, the theory of judgment aggregation, the recently developed theory of networks, multi-agent epistemic logic, social choice theory, etc.). This conference intends to explore the many fertile relations between various branches of formal epistemology and many sub-areas of contemporary social epistemology.

The 2011 EPISTEME conference will be hosted by the Center for Formal Epistemology in the Department of Philosophy at Carnegie Mellon University. The topic of the conference is: "Social Epistemology meets Formal Epistemology: Recent developments and new trends"

For more information, see http://epistemejournal.wordpress.com/conference/2011-carnegie-melon/

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

*PhDs in Logic* is an annual two-day graduate conference and winter school in logic. Each year we invite four established professors to do a tutorial on their work in two one-hour sessions. We also give about ten PhD students the opportunity to do a thirty-minute presentation on (a) their own work or (b) an overview of some topic in their field.

The current conference will feature the tutorials by Eric Pacuit (*Epistemic Logic*), Sonja Smets (*Quantum Logic*), Mai Gehrke (*Algebraic Logic*) and Peter Koepke (*Set Theory*). PhD students in logic with a background in philosophy, computer science, or mathematics are the intended audience for these tutorials. They are also the type of students we have in mind for our thirty-minute student sessions.

For more information, visit our website at http://www.vub.ac.be/phdsinlogic2011/.

For more information, see http://www.bslps.be/YRD2.html

*PhDs in Logic* is an annual two-day graduate conference and winter school in logic. Each year we invite four established professors to do a tutorial on their work in two one-hour sessions. We also give about ten PhD students the opportunity to do a thirty-minute presentation on (a) their own work or (b) an overview of some topic in their field.

The current conference will feature the tutorials by Eric Pacuit (*Epistemic Logic*), Sonja Smets (*Quantum Logic*), Mai Gehrke (*Algebraic Logic*) and Peter Koepke (*Set Theory*). PhD students in logic with a background in philosophy, computer science, or mathematics are the intended audience for these tutorials. They are also the type of students we have in mind for our thirty-minute student sessions.

For more information, visit our website at http://www.vub.ac.be/phdsinlogic2011/.

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

The 20th edition of Workshop Series "Games, Logic, Language and Computation" (GLLC) will bring together logicians, philosophers and computer scientists working on representations of information for non-ideal agents, and the fine actions that modify this information. The workshop will be hosted by the ILLC on the occasion of the defence of the PhD dissertation Small Steps in Dynamics of Information (http://staff.science.uva.nl/~fvelazqu/english/defence.php).

For more information, see the workshop's website at http://staff.science.uva.nl/~fvelazqu/eania/ or contact Fernando Raymundo Velázquez Quesada (F.R.VelazquezQuesada at uva.nl)

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

For more information, see http://www.bslps.be/YRD2.html

This workshop is an informal gathering of people that study universal models or use them in their research. There will be presentations both on finished studies and on work in progress. Universal models were originated by V. Shethman and V. Rybakov, anticipated by D. de Jongh's dissertation in 1968. In intuitionistic logic the subject reemerged in N. Bezhanishvili's dissertation in 2006. The logics involved today comprise intuitionistic propositional logic and modal logics. In intuitionistic logic one has finite universal models for some fragments missing some of the usual connectives, and the usual complicated infinite ones for the full logic. One of the modal logics that will be presented is GLP, an extension of Gödel-Löb's logics GL that has a different provability modality for each ordinal. Another modal logic that will be discussed is S4. At the workshop the subject will be approached from the algebraic/co-algebraic side as well.

For more information, see https://www.illc.uva.nl/UniversalModels/.

Speakers include:

David Fernández Duque (Sevilla)
Sam van Gool (Nijmegen)
Dick de Jongh (ILLC)
Joost Joosten (Barcelona)
Gerard Renardel de Lavalette (Groningen)
Yde Venema (ILLC)

More information will be made available in a few weeks.
Organizers: Dick de Jongh (d.h.j.dejongh at uva.nl), Joost Joosten (jjoosten at ub.edu) and Peter van Ormondt (P.vanOrmondt at uva.nl).

For more information, see https://www.illc.uva.nl/UniversalModels/.

For more information, see http://www.bslps.be/YRD2.html

This is the second in a series of four one-day workshops, 2010-11, between groups from Copenhagen (CPH) and Lund (LU), on the themes of Pluralistic Ignorance, Belief Polarization, Echo Chambers and Informational Cascades.

To participate, contact frank.zenker at fil.lu.se by February 16th. Please indicate if you attend lunch and/or dinner. For more information, see the website at http://www.fil.lu.se/conferences/conference.asp?id=43&lang=eng

The ProDi workshop focuses on the relationship between proof-theoretic and dialogical approaches to logic. Formally, it is an internal meeting organized by two collaborative research projects within the ESF programme "Modelling intelligent interaction - Logic in the Humanities, Social and Computational sciences (LogICCC)" (http://www.esf.org/index.php?id=3241) together with some external experts (including Andreas Blass, George Metcalfe, Helge Rückert and Morten Sørensen).

However, there will be two or three slots for contributed talks (30 min). If you are interested to contribute such a talk, please send an abstract to Thomas Piecha (ProDi-CfP at informatik.uni-tuebingen.de). The deadline is 7 February 2011. We would notify you until 10 February of whether we can accept it or not.

Participants are welcome. In that case please send an e-mail to Thomas Piecha until 10 February.

For more information, see http://www-ls.informatik.uni-tuebingen.de/prodi/

For more information, see http://www.bslps.be/YRD2.html

The ProDi workshop focuses on the relationship between proof-theoretic and dialogical approaches to logic. Formally, it is an internal meeting organized by two collaborative research projects within the ESF programme "Modelling intelligent interaction - Logic in the Humanities, Social and Computational sciences (LogICCC)" (http://www.esf.org/index.php?id=3241) together with some external experts (including Andreas Blass, George Metcalfe, Helge Rückert and Morten Sørensen).

However, there will be two or three slots for contributed talks (30 min). If you are interested to contribute such a talk, please send an abstract to Thomas Piecha (ProDi-CfP at informatik.uni-tuebingen.de). The deadline is 7 February 2011. We would notify you until 10 February of whether we can accept it or not.

Participants are welcome. In that case please send an e-mail to Thomas Piecha until 10 February.

For more information, see http://www-ls.informatik.uni-tuebingen.de/prodi/

For more information, see http://www.bslps.be/YRD2.html

The ProDi workshop focuses on the relationship between proof-theoretic and dialogical approaches to logic. Formally, it is an internal meeting organized by two collaborative research projects within the ESF programme "Modelling intelligent interaction - Logic in the Humanities, Social and Computational sciences (LogICCC)" (http://www.esf.org/index.php?id=3241) together with some external experts (including Andreas Blass, George Metcalfe, Helge Rückert and Morten Sørensen).

However, there will be two or three slots for contributed talks (30 min). If you are interested to contribute such a talk, please send an abstract to Thomas Piecha (ProDi-CfP at informatik.uni-tuebingen.de). The deadline is 7 February 2011. We would notify you until 10 February of whether we can accept it or not.

Participants are welcome. In that case please send an e-mail to Thomas Piecha until 10 February.

For more information, see http://www-ls.informatik.uni-tuebingen.de/prodi/

This conference will be an international one, bringing together scholars from Europe and North America to mark the 300th anniversary of Hume’s birth. It will be the first conference devoted to Hume’s work to be held in the Czech Republic. The central topic will be Hume’s epistemology, including his views on belief, evidence, induction, probability, testimony, natural theology and scepticism, as well as the epistemological questions surrounding his account of the self and of causation. The proceedings will last for three days, from September 6th to 8th (Tuesday to Thursday), 2011.

For more information, see http://www.flu.cas.cz/hume2011/.

Logica 2011 is the 25th in the series of annual international symposia devoted to logic. Invited speakers are Edwin Mares, Pavel Materna, Krister Segerberg, and Gila Sher.

Contributions devoted to any of the wide range of logical problems are welcome except those focused on specialized technical applications. Particularly welcome are contributions that cover issues interesting both for 'philosophically' and for 'mathematically' oriented logicians. Deadline for submissions is 28 February 2011.

For more information, see http://www.flu.cas.cz/logica.

For more information, see http://www.bslps.be/YRD2.html