The mentorship programme aims to team up young researchers with more senior women researchers in the CiE community, giving them an opportunity to learn from experience and develop a network. The programme originally operated only during the CiE conferences and was available to conference participants. The time of the pandemic helped us realize that mentoring does not need to be restricted to in-person communication. Furthermore, the need for developing a support system for young researchers in our community became pressingly clear.
We invite young researchers working within the scientific scope of the Association CiE and who would like to correspond with a more senior member of our community to apply by filling out the following form:
Application for prospective mentees.
We will consider applications on a continuous basis. To be eligible for this programme you need to have had some research experience or to be enrolled in a masters or PhD programme. Applicants are also invited to review the list of mentors that are currently participating in the program and indicate their top choices. The assignment of a mentor will be based on the applicants research interest and the availability of mentors.
If you are a woman and a senior researcher interested in becoming a mentor, please email: email@example.com
List of mentors
University of Milano–Bicocca
I work on algorithms in genome informatics. My research activity includes also questions in theoretical computer science related to combinatorial properties of graphs and sequences motivated by problems in computational biology. I also have fun dealing with more technical problems in formal languages and combinatorial optimization.
I was born in Crema, a small city close to Milan. After a Master degree in Computer Science I did a PhD in Computer Science in Milan, but I spent one year in Boulder Colorado working on my PhD thesis (on graph structures) under the supervision of A. Ehrenfeucht and G. Rozenberg. It was a great experience of science and life since I just got married. I was hired as a research assistant professor during my PhD and then I started my career first at the University of Milan and then as a full Professor at the University of Milano-Bicocca, fighting to reconcile the desire to devote more time to research with the duties of being mother of two children. I joined the CiE community after attending the Amsterdam edition in 2005 by giving a talk on DNA splicing systems in a special session on Biological computational models. I soon felt to have many affinity with Barry Cooper, and we both took a liking to each other. I have always been attracted by a multidisciplinary approach to research, I found very interesting to adopt a formal computational approach in interpreting and understanding very applicative problems in biology. I am very curious and that is why I do not mind spending time to try to understand and debate open problems. I have been very honored to be the President of CiE from 2016 to 2020. My last achievement is being the coordinator of a MSCA-H2020 RISE network on computational pan-genomics, which gives me the opportunity to keep in contact with international and multidisciplinary views and face new challenges in the fascinating field of genome informatics.
University of Oslo
Research interest: I work in philosophy of mathematics and philosophy of logic. I am particularly interested in exploring philosophical questions related to constructivism and predicativity and the concept of infinity. I have a keen interest also in the history of logic and mathematics and in the philosophy of science more generally. I have worked in proof theory and constructive set theory.
My undergraduate studies are in philosophy. I studied at the University of Florence where I especially enjoyed logic and the history of science. The first logic courses I attended were taught by Ettore Casari, Maria Luisa Dalla Chiara and Andrea Cantini whose enthusiasm and dedication naturally brought me to choose logic as my dissertation topic. In the last year of my degree, I participated in the Erasmus program and visited the University of Leeds. As I was very attracted by topics in logic, I began to attend classes in mathematical logic in the School of Mathematics. On completion of my first degree, I enrolled on a PhD in Logic at the School of Mathematics, University of Leeds. This was a big change compared with my undergraduate studies, not only because of the new topics I was pursuing but also since at the start of my PhD I was the only woman in a large and fast growing logic group. After completion of my PhD, I held Postdoctoral positions in Munich, Florence and Leeds. I have worked on constructive Zermelo Fraenkel set theory, operational set theory and the proof theory there of. Over time, my original interest for foundational and philosophical questions became more and more urgent. Eventually, in 2012, I decided to start again with a new PhD, now in the philosophy of mathematics. At first my interest was chiefly on philosophical questions prompted by my mathematical experience in constructivism and proof theory. Since the completion of my second PhD, I have been Teaching Fellow in the Department of Philosophy, University of Birmingham and I am presently Marie Skłodowska-Curie fellow at the Department of Philosophy, University of Oslo. My current project explores predicativist and constructivist approaches to infinity.
Liesbeth De Mol
University of Lille
Research interest: My general topic is the history, philosophy and foundations of computation. Foundational questions (eg: what does it mean to compute?) that are anchored in history but help to open up new avenues are of particular interest to me.
I was born in Aalst, Belgium where I grew up. The spirit of that city
very much shaped me as a person through its industrial past and its
annual carnival. Since I was told in high school on a regular basis that
I was not too capable and was even advised not to attend university, I
decided not to go for physics (which was my first love) but for art
history and archeology. My parents very much supported me during this
time and convinced me that I am much more capable than I thought I was. During that study, I became interested in basic philosophical questions and decided to pursue a study in philosophy. It was then my reading of Martin Heidegger’s technique essay that convinced me of a need to engage myself with modern technique, that is, computation. I was able to get a PhD scholarship; I learned to program and started reading the foundational papers by Church, Post, Turing and Gödel. During the first year it became clear that my original supervisor did not want me to pursue my own path and tried to undermine me as a person. I was lucky enough to have a lot of support from my then boyfriend (now husband) as well as from several other PhD students – I decided to speak up and could finally change my supervisor. A lack of research context at my home university – history and philosophy of computing was not a popular topic – meant that I had to reach out to others and attend conferences that were not standard in my department. This is how I got involved with CiE. Despite a continuing struggle with self-confidence I never gave up because research was what I wanted to do. Today, I have the position I could only dream of several years ago: a permanent researcher at CNRS in France. I am now ready to help others in paving their own paths through the difficult world that is academia.
King’s College London
Research interest: Development of tools for the specification, analysis and verification of systems (e.g., biochemical systems, financial systems, programming languages). I use rewrite-based techniques to study the foundations of computing and to analyse properties of software, in particular correctness and security properties.
I am a Professor of Computer Science at King’s College London. I did my PhD in France and worked at Ecole Normale Superieure in Paris before moving to King’s. I have always been interested in logic, more precisely, in the applications of logic in computer science. Currently, I am working on three main topics with collaborators from UK and abroad: the development of a modelling tool based on graph rewriting (PORGY), security models for cloud-IoT architectures and nominal techniques for the analysis of programming languages.
Research interest: I work on applications of computability theory to other areas of mathematics. I have worked in algorithmic randomness since I was a graduate student, but I also work in computable analysis and computable structure theory.
When I was a child, I wanted to be a civil rights lawyer. By the time I started high school, I realized that I wanted to become a mathematician instead, and my undergraduate years at Carnegie Mellon University persuaded me that I wanted to study logic, surrounded as I was by mathematical and philosophical logicians. I wrote my master’s thesis in set theory at Carnegie Mellon, but as a graduate student in the logic group at Berkeley, I found that I was more interested in computability theory and wrote my dissertation in algorithmic randomness. After I earned my Ph.D. in 2007, I spent seven total years as a postdoc across five different institutions: the National University of Singapore, the Fields Institute, the University of Waterloo, Dartmouth College, and the University of Connecticut. While moving so much was exhausting, I learned about different subfields of computability theory and the corresponding proof techniques at each institution, which has made me a much more versatile researcher. My location seems to have converged to Hofstra University, where I find incredible joy in both my research and my teaching—and, in keeping with my original career intentions, in trying to turn my professional communities into communities that everyone will want to join.
George Washington University, Washington DC
Research interest: I work in mathematical logic. Most of my research is in computability theory and its applications to algebraic structures, more specifically, computable model theory. I am also interested in
theoretical computer science, in particular, algorithmic learning theory and quantum computing.
University of Helsinki
Research interest: History, Foundations and philosophy of mathematics and set theory.
I am a logician working in the philosophy, history and foundations of mathematics and logic, and in set theory.
Julia F. Knight
University of Notre Dame
Research interest: I work in mathematical logic. My main focus is computable structure theory. I particularly like results that link effectiveness with definability.
I grew up in Logan, Utah. When I was in my first year of high school, in 1957, Russia gave to the scientific community in the U.S. a huge gift—Sputnik. Suddenly, funding increased, and everyone with interest and ability in science and mathematics was encouraged to study these things. I majored in mathematics at Utah State. For graduate school, I went to Berkeley, a tremendously exciting place for mathematics, and for the social atmosphere. My advisor was Robert Vaught. Julia Robinson was also a mentor. I started off in model theory. As a model theorist, I especially liked problems that involved constructing models. Later, I switched to computability theory. I still like problems that involve constructing models. I have been on the faculty at Notre Dame since 1977. I have been lucky to have really fine students to work with. During the past 20 years, I have been involved in a series of NSF grants aimed at fostering collaboration among researchers in computability from the U.S., Russia, Kazakhstan, and, more recently, Bulgaria. The joint work that has resulted from these grants, and the friendships that I now have with international collaborators, mean a great deal to me.
University of Zaragoza
Research interest: Algorithmic Information Theory, Algorithmic randomness, Computational Complexity, Algorithmic Fractal Dimensions, Computational Phylogenetics, and Computational Genomics.
When I was in high school I wanted to become a doctor but then in my senior year, thanks to a good teacher, I realized I loved math. I finished my BS in Mathematics in 1990 and then started reading about Theoretical Computer Science and talking to José Balcázar, whose enthusiasm infected me and who introduced me to resource-bounded measure and Jack Lutz with whom I have worked for the last 30 years. In 1994 I obtained my PhD in Computer Science and an academic job at the University of Zaragoza. Throughout the years I have been interested in various topics in Mathematics, Computer Science, and Biology with the common denominator of information content. Since 2007 I am a Professor of Computer Science at the University of Zaragoza with a collaborator appointment at Iowa State University, USA.
IBM Fellow, IBM Research
Research interest: Computational genomics, Cancer Genomics, Neurogenomics, Topological data analysis.
East Carolina University
Research interest: Model Theory, Computability Theory and Number Theory..
I am a Professor of Mathematics at the East Carolina University in Greenville, North Carolina. I am interested in problems of logic over objects studied in Number Theory or Algebra. So my research interests include Model Theory, Computability Theory and Number Theory. My web page is myweb.ecu.edu/shlapentokha
Alexandra A. Soskova
Research interest: My interests are in Mathematical Logic and especially in Computability theory and Computable structure theory. I am interested in the effective content of abstract structures, their degree spectra from the point of view of enumeration reducibility.
I started to like Mathematics at the end of middle school thanks to my fantastic teacher Nedjalkova. I went to a special mathematical high school. My undergraduate study was in Mathematics at Sofia University. I took in advance some Master courses in Logic and Algorithms and this inspired me to study Mathematical Logic in graduate school at Sofia University. After finishing my PhD I started as assistant professor at the same university, teaching Logic and different topics of Computability. We started to work in computability on abstract structures with my husband Ivan Soskov and our teacher Prof. Skordev, who at that time just finished his book on algebraic recursion theory. We saw the close relationship between enumeration degrees and abstract models of computability. At that time Barry Cooper invited us to join a big research project on Computability in Europe. We organized together in 2009 the Logic Colloquium in Sofia and in 2011 the CiE conference. Julia Knight invited us to be part of a project Collaboration in Computability together with Novosibirsk, Kazan and Kazakhstan and several researchers from the USA. Now I am a professor in Mathematical Logic at Sofia University working mainly on complexity of structures, from the point of view of computability, on some specific structural properties such as jump inversion and definability. I am interested in how difficult is to code and decode one class of structures into another and in the connections between syntactic and semantic properties and the information contents of structures.
Mariya I. Soskova
University of Wisconsin–Madison
Research interest: I work in computability theory, effective mathematics and logic in general. Enumeration reducibility and the structure of the enumeration degrees hold a central place in my research. I particularly enjoy questions and results about first order definability.
I was born in Sofia, Bulgaria. As a kid I spent two years in LA, when my dad, also a logician, started getting worried that the fall of the communist regime and the food shortages it came with will be too severe for our family to bear. My dad Ivan Soskov had a position as an adjunct professor at UCLA. We returned home as soon as hope for a better life in Bulgaria emerged. I went to a German high school and then studied Computer Science as an undergraduate at Sofia University. I was drawn to mathematical logic and computability theory for many reasons: I had seen some of it in my undergraduate courses and it seemed to just make sense to me, but most significantly I remembered that when my father (an unknown young Bulgarian researcher) reached out to the logic community during a time of need, they gave him a chance and helped us out. I switched to mathematical logic for my masters degree, again at Sofia University. I went to graduate school at the University of Leeds. My supervisor Barry Cooper showed me the importance of mentorship. Thanks to him I later became involved with the CiE workshop series Women in Computability. I am now an associate professor at the University of Wisconsin-Madison and am ready to help others figure out their best path through academia.
Research interest: I work in modal logic, both modern approaches/techniques and
the history of the field. I am also interested in logic pedagogy.
I’m an assistant professor of logic and philosophy of language in the
Department of Philosophy at Durham University. My main areas of
research in logic are modal logic, both modern approaches/techniques and the history of the field. I am also extremely interested in the teaching of logic to undergrads — especially non-mathematics students and students who don’t want to be taking logic, and I’d love to provide mentorship for people who are interested in logic pedagogy. Outside of logic, I’ve got nine years experience navigating academia as a parent and am happy to talk about that as well.