|
| Home | Positions | Eligibility | Fellows |
1. University of
Leeds, UK (Coordinator)
Scientist-in-Charge and coordinator of proposed
network: H.D.
Macpherson
Model theory (H.D.
Macpherson,
A. Pillay, J.K.
Truss): most areas of model theory, including classification theory,
o-minimality, model theory of groups and fields, and applications.
Proof theory (M. Rathjen, P. Schuster, S. Wainer): ordinal analysis of theories, constructivisim (constructive set theory, Martin-Löf type theory, admissible set theory, large cardinals in constructive set theory, combinatorial principles in constructive mathematics).
Computability theory (S.B. Cooper, A.E.M. Lewis): Turing degrees and other degree structures, randomness, applications of computability to science and the humanities.
Set Theory: This is not a specialism of the group, but Rathjen works extensively in constructive set theory, and Truss has recent work in set theory without the Axiom of Choice.
Details of the position advertised in Leeds: There will be a 36 month Early Stage Researcher position under MALOA in the logic group in Leeds. The appointed candidate should start his/her appointment on or before 1 October 2010. Applications are welcome in the areas of model theory, proof theory, and computability theory.
2. University of Manchester, UK
G. Wilmers
(Scientist-in-Charge)
Model theory (Borovik, Korovina, Prest, Tressl, Wilkie): o-minimality, model theory of groups, especially groups of finite Morley rank, model theory of analytic structures.
Real-valued logics (uncertain reasoning) (Paris, Wilmers):
probability logic, rationality principles.
Complexity theory
(Kambites).
Details of the position advertised in Manchester
3. University of
Oxford, UK. Logic group in the Mathematics department and in the Computer Science department.
B. Zilber
(Scientist-in-Charge)
Model theory (J. Koenigsmann, B. Zilber): Model theory and
applications in algebra, geometry, and number theory. In particular,
model theory of fields, model theory of groups, complex analytic
geometry, connections of model theory to non-commutative geometry.
Computer science (M.
Benedikt, G. Gottlob,
S. Kreutzer): Database theory,
information exchange, web data management, data extaction and
integration, complexity theory, finite model theory, graph algorithms,
finite model theory, database and descriptive complexity theory,
verification, other applications of logic in computer science.
Set theory (R. Knight): Set theoretic aspects of general topology, connections to model theory (Vaught's Conjecture), descriptive set theory, combinatorial set theory.
4. CNRS-Lyon, France
(combining Lyon 1 and Lyon ENS)
I. Ben Yaacov
(Scientist-in-Charge)
Model theory (T. Altinel, T. Blossier, I. Ben Yaacov, E. Jaligot,
A. Martin Pizarro, A. Ould
Houcine, B. Poizat, F. Wagner):
Stable, simple, dependent theories. Model theory of fields,
Hrushovski amalgamations. Model theory of groups, groups of finite
Morley ranks. Model Theory of metric structures.
Theoretical Computer Science
(P. Baillot,
D. Hirshckoff,
P. Koiran,
O. Laurent,
P. Lescanne,
A. Miquel,
N. Portier): Proof theory, especially linear
logic and proof nets, computational content of classical logic,
computational complexity, Ptime complexity and light logic.
Set Theory
(J. Melleray):
Descriptive set theory, Borel equivalence relations and actions of
Polish groups, metric geometry.
Details of the positions advertised in Lyon: The position at Lyon I (in Model Theory or Descriptive Set Theory) has a deadline of 31 March 2009; the position at ENS Lyon (in Theoretical Computer Science) has a deadline of 30 April 2010.
5. Université Paris Diderot Paris 7, Paris 7, France
Z. Chatzidakis
(Scientist-in-Charge)
Model Theory (Chatzidakis, Cori, Delon,
Dickmann, Hils, Oger, Simonetta,
Sureson): Model
theory of algebraic structures, such as groups, fields
(with operators), modules, C-minimal structures; Hrushovski
amalgamations.
Set theory (Todorcevic, Velickovic): Classification of countable
and uncountable structures (descriptive set theory, Borel reducibility);
Infinite dimensional Ramsey theory.
Complexity and Logic applied to Computer Science (Boughattas, Durand,
Finkel,
Lassaigne, Malod, Prouté, Labib-Sami): Structural complexity;
counting and enumeration problems, algebraic complexity; Descriptive
complexity and finite model theory; complexity classes
characterization, complexity of Database query problems.
Details of the position advertised in Paris: A three-year PhD studentship is offered at the university Paris Diderot Paris 7. Starting date 1 October 2010. The candidate must have an M2, or equivalent (Masters, or 5 years university training; some exceptions are possible, please enquire if you do not fulfill these conditions). The successful candidate will be expected to work in one of the following areas of research:
- Complexity theory: circuit complexity, arithmetic complexity,
computing polynomials, complexity of counting and enumeration problems.
- Automata on infinite objects (words or trees) and descriptive set
theory.
- Automatic structures (presentable by various kinds of automata, in
particular over infinite objects).
- Finite model theory and descriptive complexity, database query
problems.
However, applications from students in the other two research areas represented in Paris 7 (model theory and set theory) will also be considered.
6. Ludwig
Maximilians-Universität, Munich, Germany
H.
Schwichtenberg (Scientist-in-Charge)
Proof theory, constructive mathematics, connections to computer
science (W.
Buchholz, H.-W.
Schuster, H. Schwichtenberg): Proof-theoretic techniques
(ordinal notation systems, collapsing functions, Omega-rule) for
complexity estimates of the computational content of proofs,
co-recursion equations; constructive mathematics (especially in algebra,
point-free topology); lambda calculus, complexity analysis (via type
theory) of algorithms contained in formal proofs. There are slight
industrial connections to research at Siemens and at Giesecke &
Devrient.
Set theory (H.-D.
Donder): Inner models of set theory, combinatorial
principles of L, and extensions of the forcing technique.
7. Westfälische
Wilhelms-Universität Münster, Germany
K.
Tent (Scientist-in-Charge)
Model theory (K. Tent) Model theory and algebra, especially, model theory of groups, buildings and groups of finite Morley rank, pseudofinite groups and permutation groups, asymptotic cones.
Set theory (R. Schindler) Core models in set theory, large cardinals, forcing axioms and determinacy.
8. Charles
University, Prague, Czech republic
J. Krajicek
(Scientist-in-Charge)
Complexity theory (J. Krajicek, P. Pudlak, Stepanek, V. Svejdar): Proof complexity, automated theorem proving, interpretability of axiomatic theories, arithmetization, related modal logics, and complexity of non-classical logics.
Real valued logic and computer science (P. Hajek): Fuzzy logic.
Set theory (T. Jech, J. Zapletal, P. Stepanek): Boolean algebras, descriptive set theory, forcing.
Computability theory (Kucera): Algorithmic randomness.
Logic applied to algebra (Trlifaj): Set theory, infinite
combinatorics, and model theory applied to algebra (e.g. to the
structure of modules).
Details of the position advertised in Prague
Associated partners:
9. University of East Anglia, UK
Scientist-in-Charge: M. Dzamonja
(Scientist-in-Charge)
10. Onera, France
Scientist-in-Charge: R. Kervarc
(Scientist-in-Charge)
11. British Telecommunications plc, UK
Scientist-in-Charge: P. Cofta (Scientist-in-Charge)