BRITISH LOGIC COLLOQUIUM
Registered Charity No 275541
http://www.cs.bham.ac.uk/~exr/blc
President Professor J M E Hyland [Cambridge]
Vice-President Professor T Williamson FBA FRSE [Oxford]
Treasurer Professor D Macpherson [Leeds]
Secretary Dr N Alechina [Nottingham]
Dr U Berger [Swansea]
Dr E Ritter [Birmingham]
Dr G Wilmers [Manchester]
---------------------------------------------------------
(1) The BLC 2009 deadlines
(2) PhD positions:
(2a) PhD student position in Leeds
(2b) Two PhD student positions in Algorithms and Complexity, Oxford
(2c) PhD student position on logic and formal verification, Liverpool
(3) 9-21 July 2010, Fifth Federated Logic Conference (FLoC'10),
Edinburgh, Scotland
(CFP workshop proposals, submission deadline: 31 July 2009)
---------------------------------------------------------
(1) The web page of the British Logic Colloquium meeting
to be held in September 2009 is available at:
http://www.cs.swan.ac.uk/blc09/
Some deadlines (see the web page for details):
Contirbuted talks deadline: Monday, August 3, 2009
Grants for UK-based research students: Sunday, July 12, 2009
Campus accommodation deadline: Monday, August 10, 2009.
--------------------------------------------------------
(2a) DEPARTMENT OF PURE MATHEMATICS, UNIVERSITY OF LEEDS
Homogeneous structures, homomorphism-homogeneity and automorphism
groups
As part of an EPSRC grant at the University of Leeds with the title
above, there will be a fully funded PhD studentship, and we seek
suitably qualified candidates to begin their PhD in the autumn of
2009.
The PhD student appointed will be jointly supervised by Professors
Macpherson and Truss, and will work on an aspect of the EPSRC
research grant. He or she will interact not only with the two
investigators, but also with the postdoctoral research assistant, Dr
Deborah Lockett. There will be regular meetings between the RA, the
PhD student, and the investigators, and other interested research
students, and probably a seminar with this group. We plan to hold a
short meeting in Leeds on homogeneous structures.
The project concerns aspects of homogeneous structures. A countable
structure is said to be 'homogeneous' if any isomorphism between
finite substructures extends to an automorphism. The initial theory of
homogeneous structures was developed as part of model theory. One of
the key achievements was a classification by Cherlin (1998), of the
homogeneous digraphs. The class of examples has great complexity but
the description is clean and beautiful. However, the classification
sheds little light on what homogeneous (even binary) structures look
like in general.
The very general framework of homogeneity means that the subject
touches many parts of mathematics, such as model theory, connections
of finite model theory with computer science, group theory,
descriptive set theory, and, in particular, combinatorics. Much of
this has developed since Cherlin's memoir. For example, there is now
wide interest in homogeneous metric spaces, in connections with
structural Ramsey theory in combinatorics, and with topological
dynamics. It has become urgent to revisit classification in
homogeneous structures, to identify how far it can reasonably be
taken, and whether, if one requires less than full classification,
meaningful descriptions remain.
This is a project in combinatorics, but it has strong connections with
model theory, group theory, and theoretical computer
science. Candidates with interests in any or all of these areas may
apply.
The studentship is advertised on
http://www.findaphd.com/search/showproject.asp?projectid=22740&searchtype=n&page=1
and anyone interested is encouraged to contact one or both of the
investigators on pmtjkt@leeds.ac.uk or
pmthdm@leeds.ac.uk.
-----------------------------------------------------------------------
(2b) Two PhD student positions in Algorithms and Complexity, Oxford
The Verification Research Group is offering two D.Phil studentships in
Oxford University's Computing Laboratory (web.
comlab.ox.ac.uk). These positions are associated with the EPSRC
project "Model Checking Real-Time Systems: Algorithms and Complexity''
under the supervision of Dr James Worrell, which will deal with a
logical and automata-theoretic fr amework for model checking real-time
systems.
The studentships will suit candidates with a strong background in
theoretical computer science, including at least on e of the following
areas: algorithms, automata theory, complexity theory and logic.
The closing date for applications is 5th July 2009. For more
information, see http://web.comlab.ox.ac.uk/news/94-full .html or
contact James Worrell at jbw@comlab.ox.ac.uk.
----------------------------------------------------------------------
(2c) - PhD student position on logic and formal verification, Liverpool
The "Verifying Interoperability Requirements in Pervasive Systems"
project is a collaboration between the universities of Birmingham,
Glasgow and Liverpool. As part of this project we are supporting a 3
year PhD project to tackle relevant aspects in logic and formal
verification.
The project tackles the development of logical foundations and
verification techniques for pervasive systems. This Ph D will involve
one or more of: formal specification; autonomous systems; security;
organisational/context models; mod el-checking; non-classical logics;
deductive verification; executable specifications; fault tolerance.
You will study under the supervision of Prof. Michael Fisher in the
Logic and Computation group of the Department of Computer Science at
the University of Liverpool. The group has an international reputation
for research in the areas of formal logics, verification, and
execution.
Closing date for receipt of applications: 6 July 2009. Ref: FISHER/WWW.
For more information, see
http://www.liv.ac.uk/working/job_vacancies/studentships/PhD_Studentship
_Fish.htm or contact email Michael Fisher at MFisher@liverpool.ac.uk
------------------------------------------------------------------------
(3) - 9-21 July 2010, Fifth Federated Logic Conference (FLoC'10),
Edinburgh, Scotland
The fifth Federated Logic Conference (FLoC'10), will be 9-21 July,
2010 hosted by the University of Edinburgh. The following seven
conferences will participate in FLoC:
- International Conference on Computer-Aided Verification (CAV).
- International Conference on Interactive Theorem Proving (ITP).
- International Conference on Logic Programming (ICLP).
- International Joint Conference on Automated Reasoning (IJCAR).
- IEEE Symposium on Logic in Computer Science (LICS).
- International Conference on Rewriting Techniques and Applications (RTA).
- International Conference on Theory and Applications of Satisfiability Testing (SAT).
The organizers have made arrangements to facilitate the running of
pre-, post-, and mid-FLoC workshops. Researchers a nd practitioners
are invited to submit proposals for workshops on topics relating
logic, broadly understood, applied to computer science. Each workshop
proposal must indicate one sponsoring conference among the
participating conferenc es. Workshops will have to be financially
self-supporting, unless the sponsoring conference accepts financial
respons ibility. Proposals are due by July 31, 2009.
For more information, see http://www.floc-conference.org/ or contact
Philip Scott (FLoC Workshop Chair) at phil@site.uottawa.ca.
(4) Logic and Mathematics Conference
Theme: the interaction between ideas or techniques from mathematical
logic and other areas of mathematics.
University of York, 3-7 August 2009
more details: http://maths.york.ac.uk/www/York2009