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. 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 detected. The conference provides a unique opportunity for people working in the area of computation on real-valued data but coming from different fields to meet, present work in progress and exchange ideas and knowledge.

Conference Web Page: http://cca-net.de/cca2012/

In more than a decade of research, it has been established that a wide variety of state-based dynamical systems, like transition systems, automata (including weighted and probabilistic variants), Markov chains, and game-based systems, can be treated uniformly as coalgebras. Coalgebra has developed into a field of its own interest presenting a deep mathematical foundation, a growing field of applications, and interactions with various other fields such as reactive and interactive system theory, object-oriented and concurrent programming, formal system specification, modal and description logics, artificial intelligence, dynamical systems, control systems, category theory, algebra, analysis, etc. The aim of the CMCS workshop series is to bring together researchers with a common interest in the theory of coalgebras, their logics, and their applications.

For more information, see http://www.coalg.org/cmcs12/

Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic. The conference is intended for computer scientists whose research activities involve logic, as well as for logicians working on issues significant for computer science.

For more information, see http://csl2012.lacl.fr/

The DARC workshop is intended to bring together people interested in the dynamics of formal argumentation understood in a broad sense, to exchange ideas, techniques, and results.

This workshop is associated to the DYNARG project. The event is open to all researchers working, planning to work, or just interested in these topics. There is no registration fee.

The event is open to all researchers working, planning to work, or just interested in these topics. Website: http://icr.uni.lu/darc/.

If you would like to present your work at DARC then please send an abstract to the organisers.

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. This year, BCTCS is part of the Alan Turing Year, and will be collocated with the Automated Reasoning Workshop ARW.

The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Further details are available from the Colloquium website at http://bctcs2012.cs.manchester.ac.uk/.

SSFLA 2012 (formerly the International PhD School in Formal Languages and Applications) offers a broad and intensive series of lectures at different levels on selected topics in language and automata theory and their applications. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career.

Most appropriate degrees include: Computer Science and Mathematics. Other students are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.

For more information, see http://grammars.grlmc.com/ssfla2012/

The DARC workshop is intended to bring together people interested in the dynamics of formal argumentation understood in a broad sense, to exchange ideas, techniques, and results.

This workshop is associated to the DYNARG project. The event is open to all researchers working, planning to work, or just interested in these topics. There is no registration fee.

The event is open to all researchers working, planning to work, or just interested in these topics. Website: http://icr.uni.lu/darc/.

If you would like to present your work at DARC then please send an abstract to the organisers.

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. This year, BCTCS is part of the Alan Turing Year, and will be collocated with the Automated Reasoning Workshop ARW.

The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Further details are available from the Colloquium website at http://bctcs2012.cs.manchester.ac.uk/.

SSFLA 2012 (formerly the International PhD School in Formal Languages and Applications) offers a broad and intensive series of lectures at different levels on selected topics in language and automata theory and their applications. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career.

Most appropriate degrees include: Computer Science and Mathematics. Other students are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.

For more information, see http://grammars.grlmc.com/ssfla2012/

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. This year, BCTCS is part of the Alan Turing Year, and will be collocated with the Automated Reasoning Workshop ARW.

The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Further details are available from the Colloquium website at http://bctcs2012.cs.manchester.ac.uk/.

SSFLA 2012 (formerly the International PhD School in Formal Languages and Applications) offers a broad and intensive series of lectures at different levels on selected topics in language and automata theory and their applications. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career.

Most appropriate degrees include: Computer Science and Mathematics. Other students are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.

For more information, see http://grammars.grlmc.com/ssfla2012/

The purpose of BCTCS is to provide a forum in which researchers in theoretical computer science can meet, present research findings, and discuss developments in the field. It also aims to provide an environment in which PhD students can gain experience in presenting their work, and benefit from contact with established researchers. This year, BCTCS is part of the Alan Turing Year, and will be collocated with the Automated Reasoning Workshop ARW.

The scope of the colloquium includes all aspects of theoretical computer science, including automata theory, algorithms, complexity theory, semantics, formal methods, concurrency, types, languages and logics. Both computer scientists and mathematicians are welcome to attend, as are participants from outside of the UK.

Further details are available from the Colloquium website at http://bctcs2012.cs.manchester.ac.uk/.

SSFLA 2012 (formerly the International PhD School in Formal Languages and Applications) offers a broad and intensive series of lectures at different levels on selected topics in language and automata theory and their applications. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career.

Most appropriate degrees include: Computer Science and Mathematics. Other students are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.

For more information, see http://grammars.grlmc.com/ssfla2012/

SSFLA 2012 (formerly the International PhD School in Formal Languages and Applications) offers a broad and intensive series of lectures at different levels on selected topics in language and automata theory and their applications. The students choose their preferred courses according to their interests and background. Instructors are top names in their respective fields. The School intends to help students initiate and foster their research career.

Most appropriate degrees include: Computer Science and Mathematics. Other students are welcome too provided they have a good background in discrete mathematics. The School is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field.

For more information, see http://grammars.grlmc.com/ssfla2012/

ICITS is a conference about all aspects of information-theoretic security and brings together the leading researchers in the areas of cryptology, information theory and quantum information.

For more information, see http://icits2012.iro.umontreal.ca/.

/PhDs in Logic//IV/is a graduate conference organized by and for PhD-students. This edition is the fourth one of an annual Belgian--Dutch happening; earlier editions took place in Ghent (2009), Tilburg (2010), and Brussels (2011).

As all previous PhDs in Logic conferences, this two-day graduate conference follows this threefold plan:
* Four established tutorial speakers will each give two one-hour tutorial sessions on a relevant topic in logic.
* Ten to twenty PhD students are given the opportunity to do a presentation on their own work.
* Networking will be encouraged by providing for generous breaks and by having lunch with the entire group.

For more information, visit our website at http://www.phdsinlogic2012.ugent.be.

Our conference is an interdisciplinary meeting of philosophers, mathematicians and a wide spectrum of researchers whose interests are in the area of pure or applied logic. Each edition of our conference is devoted to a leading theme which usually concerns important issues and ideas in logic. One of them is the part-whole relation which has been intensively investigated by logicians, philosophers and mathematicians over the centuries. Since in the recent years one can observe a growing interest in this area, we decided to put into perspective the research on the part-whole problem. Therefore, the leading theme of the upcoming conference will be *Part-whole Theory*.

The detailed information regarding conference registration, submission of abstracts, and accommodation will be available on the conference's website at http://www.klmn.uni.wroc.pl/conference.html.

/PhDs in Logic//IV/is a graduate conference organized by and for PhD-students. This edition is the fourth one of an annual Belgian--Dutch happening; earlier editions took place in Ghent (2009), Tilburg (2010), and Brussels (2011).

As all previous PhDs in Logic conferences, this two-day graduate conference follows this threefold plan:
* Four established tutorial speakers will each give two one-hour tutorial sessions on a relevant topic in logic.
* Ten to twenty PhD students are given the opportunity to do a presentation on their own work.
* Networking will be encouraged by providing for generous breaks and by having lunch with the entire group.

For more information, visit our website at http://www.phdsinlogic2012.ugent.be.

The conference Kant and Modality seeks to promote the important issues of Kant's theory of modality and to exchange ideas by bringing together scholars working on all issues relating to his conception and theory of modality. It takes place at Humboldt University of Berlin on July 5-7 2012.

For more information, see here

The aim of the workshop series Developments in Computational Models is to bring together researchers who are currently developing new computational models or new features for traditional computational models, in order to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in this area.

The eighth workshop in the series, DCM 2012, will be a satellite event of the conference Computability in Europe and part of the celebrations of the Turing Centenary.

For more information, see http://www.math.uni-hamburg.de/home/loewe/DCM2012 or contact bloewe at science.uva.nl.

Now in its 31st year, Eurocrypt 2012 will take place in Cambridge, United Kingdom, from April 15 to April 19. Devoted to all aspects of cryptology, Eurocrypt is one of the three flagship conferences organised by the IACR.

It is especially apt that Eurocrypt 2012 is held in Cambridge as this year marks the 100th anniverary of the birth of Alan Turing. Eurocrypt 2012 is forming part of the celebrations of the Alan Turing Year.

In addition to Eurocrypt 2012, Cambridge is hosting a six month program at the Isaac Newton Institute for Mathematical Sciences devoted to recent work inspired by the work of Alan Turing. This program features a significant cryptologic component.

For more information, see http://www.cs.bris.ac.uk/eurocrypt2012/

The TIME symposium series is a well-established annual event that brings together researchers from all areas of computer science that involve temporal representation and reasoning. This includes, but is not limited to, artificial intelligence, temporal databases, and the verification of software and hardware systems. In addition to fostering interdisciplinarity, the TIME symposia emphasize bridging the gap between theoretical and applied research.

The conference will span three days, and will be organized as a combination of technical paper presentations, keynote lectures, and tutorials. In addition, TIME 2012 will feature a special track on Temporal Representation and Reasoning in Medicine. TIME 2012 is an official event of THE ALAN TURING YEAR.

For more information, see http://www.tech.dmu.ac.uk/STRL/time12/ or contact time12 at dmu.ac.uk (for questions related to submission, reviewing, and program) or time12-org at dmu.ac.uk (for questions related to local organization).

Now in its 31st year, Eurocrypt 2012 will take place in Cambridge, United Kingdom, from April 15 to April 19. Devoted to all aspects of cryptology, Eurocrypt is one of the three flagship conferences organised by the IACR.

It is especially apt that Eurocrypt 2012 is held in Cambridge as this year marks the 100th anniverary of the birth of Alan Turing. Eurocrypt 2012 is forming part of the celebrations of the Alan Turing Year.

In addition to Eurocrypt 2012, Cambridge is hosting a six month program at the Isaac Newton Institute for Mathematical Sciences devoted to recent work inspired by the work of Alan Turing. This program features a significant cryptologic component.

For more information, see http://www.cs.bris.ac.uk/eurocrypt2012/

A Π⁰₁ ordinal analysis of Peano arithmetic can be based on provability logics with infinitely many modalities. The aims of the workshop are to report and to discuss progress on extending the analysis to stronger theories, as well as to study the corresponding logics and algebras from topological, set-theoretical and algebraic points of view.

Topics include but are not restricted to: reflection principles; Turing--Feferman recursive progressions; provability logics and algebras; conservation results for fragments of arithmetic and analysis; ordinal notation systems; topological and set-theoretic interpretations of modal logic.

To register, please contact Joost J. Joosten at jjoosten at ub.edu by April 10th. There is a registration fee of 80€. Upon registration you will receive information on the method of payment. Students and young researchers that wish to waive the fee should mention this when registering.

For more information, see http://www.phil.uu.nl/~jjoosten/WormShop/.

Now in its 31st year, Eurocrypt 2012 will take place in Cambridge, United Kingdom, from April 15 to April 19. Devoted to all aspects of cryptology, Eurocrypt is one of the three flagship conferences organised by the IACR.

It is especially apt that Eurocrypt 2012 is held in Cambridge as this year marks the 100th anniverary of the birth of Alan Turing. Eurocrypt 2012 is forming part of the celebrations of the Alan Turing Year.

In addition to Eurocrypt 2012, Cambridge is hosting a six month program at the Isaac Newton Institute for Mathematical Sciences devoted to recent work inspired by the work of Alan Turing. This program features a significant cryptologic component.

For more information, see http://www.cs.bris.ac.uk/eurocrypt2012/

A Π⁰₁ ordinal analysis of Peano arithmetic can be based on provability logics with infinitely many modalities. The aims of the workshop are to report and to discuss progress on extending the analysis to stronger theories, as well as to study the corresponding logics and algebras from topological, set-theoretical and algebraic points of view.

Topics include but are not restricted to: reflection principles; Turing--Feferman recursive progressions; provability logics and algebras; conservation results for fragments of arithmetic and analysis; ordinal notation systems; topological and set-theoretic interpretations of modal logic.

To register, please contact Joost J. Joosten at jjoosten at ub.edu by April 10th. There is a registration fee of 80€. Upon registration you will receive information on the method of payment. Students and young researchers that wish to waive the fee should mention this when registering.

For more information, see http://www.phil.uu.nl/~jjoosten/WormShop/.

Now in its 31st year, Eurocrypt 2012 will take place in Cambridge, United Kingdom, from April 15 to April 19. Devoted to all aspects of cryptology, Eurocrypt is one of the three flagship conferences organised by the IACR.

It is especially apt that Eurocrypt 2012 is held in Cambridge as this year marks the 100th anniverary of the birth of Alan Turing. Eurocrypt 2012 is forming part of the celebrations of the Alan Turing Year.

In addition to Eurocrypt 2012, Cambridge is hosting a six month program at the Isaac Newton Institute for Mathematical Sciences devoted to recent work inspired by the work of Alan Turing. This program features a significant cryptologic component.

For more information, see http://www.cs.bris.ac.uk/eurocrypt2012/

A Π⁰₁ ordinal analysis of Peano arithmetic can be based on provability logics with infinitely many modalities. The aims of the workshop are to report and to discuss progress on extending the analysis to stronger theories, as well as to study the corresponding logics and algebras from topological, set-theoretical and algebraic points of view.

Topics include but are not restricted to: reflection principles; Turing--Feferman recursive progressions; provability logics and algebras; conservation results for fragments of arithmetic and analysis; ordinal notation systems; topological and set-theoretic interpretations of modal logic.

To register, please contact Joost J. Joosten at jjoosten at ub.edu by April 10th. There is a registration fee of 80€. Upon registration you will receive information on the method of payment. Students and young researchers that wish to waive the fee should mention this when registering.

For more information, see http://www.phil.uu.nl/~jjoosten/WormShop/.

Now in its 31st year, Eurocrypt 2012 will take place in Cambridge, United Kingdom, from April 15 to April 19. Devoted to all aspects of cryptology, Eurocrypt is one of the three flagship conferences organised by the IACR.

It is especially apt that Eurocrypt 2012 is held in Cambridge as this year marks the 100th anniverary of the birth of Alan Turing. Eurocrypt 2012 is forming part of the celebrations of the Alan Turing Year.

In addition to Eurocrypt 2012, Cambridge is hosting a six month program at the Isaac Newton Institute for Mathematical Sciences devoted to recent work inspired by the work of Alan Turing. This program features a significant cryptologic component.

For more information, see http://www.cs.bris.ac.uk/eurocrypt2012/

A Π⁰₁ ordinal analysis of Peano arithmetic can be based on provability logics with infinitely many modalities. The aims of the workshop are to report and to discuss progress on extending the analysis to stronger theories, as well as to study the corresponding logics and algebras from topological, set-theoretical and algebraic points of view.

Topics include but are not restricted to: reflection principles; Turing--Feferman recursive progressions; provability logics and algebras; conservation results for fragments of arithmetic and analysis; ordinal notation systems; topological and set-theoretic interpretations of modal logic.

To register, please contact Joost J. Joosten at jjoosten at ub.edu by April 10th. There is a registration fee of 80€. Upon registration you will receive information on the method of payment. Students and young researchers that wish to waive the fee should mention this when registering.

For more information, see http://www.phil.uu.nl/~jjoosten/WormShop/.

Formal philosophy relies increasingly on simulations, and sometimes on empirical test, coming closer to both computer-, cognitive- and social sciences. Some examples are learning-theoretic models of inquiry, network theory-based approaches in social epistemology, and game-theoretic evolutionary approaches of communication. The aim of the G.I.R.L.'12 Conference is to bring together researchers in philosophy, cognitive science and artificial intelligence, to investigate new areas where the game- and learning-theoretic simulation approaches can lead to fruitful results.

For more information, see http://www.fil.lu.se/conferences/conference.asp?id=49&lang=se

Formal philosophy relies increasingly on simulations, and sometimes on empirical test, coming closer to both computer-, cognitive- and social sciences. Some examples are learning-theoretic models of inquiry, network theory-based approaches in social epistemology, and game-theoretic evolutionary approaches of communication. The aim of the G.I.R.L.'12 Conference is to bring together researchers in philosophy, cognitive science and artificial intelligence, to investigate new areas where the game- and learning-theoretic simulation approaches can lead to fruitful results.

For more information, see http://www.fil.lu.se/conferences/conference.asp?id=49&lang=se

Formal philosophy relies increasingly on simulations, and sometimes on empirical test, coming closer to both computer-, cognitive- and social sciences. Some examples are learning-theoretic models of inquiry, network theory-based approaches in social epistemology, and game-theoretic evolutionary approaches of communication. The aim of the G.I.R.L.'12 Conference is to bring together researchers in philosophy, cognitive science and artificial intelligence, to investigate new areas where the game- and learning-theoretic simulation approaches can lead to fruitful results.

For more information, see http://www.fil.lu.se/conferences/conference.asp?id=49&lang=se

The third official meeting of the EUSFLAT Working Group on Mathematical Fuzzy Logic will be held on 10-14 September 2012 in Kanazawa, Japan. The conference is organized by Research Center for Integrated Science, Japan Advanced Institute of Science and Technology.

Mathematical Fuzzy Logic is a subdiscipline of Mathematical Logic which studies the notion of comparative truth. The assumption that 'truth comes in degrees' has proved to be very useful in many, both theoretical and applied, areas of Mathematics, Computer Science and Philosophy. The main goal of this meeting is to foster collaboration between researchers in the area of Mathematical Fuzzy Logic, and to promote communication and cooperation with members of neighbouring fields. The deadline for contributions is 22 April 2012. The notification of acceptance/rejection will be sent until 3 June 2012.

For more information, see http://www.jaist.ac.jp/rcis/latd12/

WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The nineteenth WoLLIC will be held at the University of Buenos Aires, Argentina, from September 3rd to 6th, 2012.

WoLLIC is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), the European Association for Computer Science Logic (EACSL), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL).

For more information, see http://wollic.org/wollic2012/

SADAF, the Argentine Society for Philosophical Analysis, is organizing a Tribute to Horacio Arló-Costa, to take place in Buenos Aires, August 2nd to 4th, 2012.

For further particulars, see here or check the SADAF webpage for the conference (in Spanish) at http://www.sadaf.org.ar/web/actividades/reuniones-academicas/item/187.html, or contact the organisers by sending an e-mail to info at sadaf.org.ar

For more information, see here or http://www.sadaf.org.ar/web/actividades/reuniones-academicas/item/187.html

The aim of this conference is to bring together PhD students, postdocs and young researchers in Set Theory in order to learn from leading researchers in the field, hear about the latest research and to discuss research issues in a co-operative environment. The conference format will be similar to previous years, including tutorials, research talks and discussion sessions.

if you are interested in attending the conference, please see the registration page on the website and/or contact Lionel Nguyen Van Thé (lionel at latp.univ-mrs.fr).

For more information, please see the conference website at http://math.univ-lyon1.fr/~melleray/yst2012-info.html