BLC Newsletter June 2004

BRITISH LOGIC COLLOQUIUM
Registered Charity No 275541

http://www.cs.bham.ac.uk/~exr/blc

President           Professor J B Paris FBA [Manchester]
Vice-President      Professor J M E Hyland [Cambridge]
Treasurer           Dr R Dyckhoff [St Andrews]
Secretary           Dr M Dzamonja [East Anglia]
                    Professor D Macpherson [Leeds]
                    Dr E Ritter [Birmingham]
                    Professor T Williamson FBA FRSE [Oxford]

---------------------------------------------------------
Dear members,

Various announcements below.

Recall also that=20
our Annual Meeting will be held in Leeds from 6-8 of September.
Watch the web site http://www.cs.bham.ac.uk/~exr/blc/blc-meetings.html
for further announcements and please note the enclosed announcement
and the attached poster.

(1) positions at Swansea

(2) Infinite Games Conference in Bonn, November 26-29, 2004

(3) BLC Annual Meeting

(4) LICS Newsletter + Conference

(5) Unilog '05 Montreux

    Best wishes to all, Mirna.

--------------------------------------------------
(1)

Professorships, Readerships, Lectureships, Tutorships.
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D
The department of computer science at Swansea (Wales, UK) is
currently advertising academic positions at all levels.
We hope expecially to expand our groups in visual
computing and in logic/theoretical computer
science.

Our department was rated 5 in the last research assessment exericse.
It has a strong group in logic and
theoretical computer science which is amongst the biggest in
UK. The members of that group are Ulrich Berger (proof theory,
computability theory, type theory),  Phil Grant (artificial
intelligence), Andy Gimblett (algebraic specification),
Neal Harman (hardware verification, models of computation,
algebraic specification), Oliver Kullmann (satisfiability problems),
Markus Michelbrink (proof theory, type theory),
Faron Moller (automata theory, modal and temporal logic),
Markus Roggenbach (algebraic specification), Monika Seisenberger
(proof theory, type theory, computability theory),
Anton Setzer (proof theory, type theory) and
John Tucker (algebraic specification, algebraic methods,
computability theory). We have as well strong links to the
mathematics department, with Roger Hindley (lambda-calculus) and
Jiang-Lun Wu (nonstandard analysis).

The deadline for application is 25 June 2004 (I have been
signalled that late applications might still be acceptable).
The official advertisements can be found at=20
http://www.jobs.ac.uk/jobfiles/IS433.html and
http://www.jobs.ac.uk/jobfiles/IS434.html

--=20
---------------------------------------------------------------------------=
--
Anton Setzer                            Telephone:
Department of Computer Science          (national)        (01792) 513368=20
University of Wales Swansea             (international) +44 1792  513368
Singleton Park                          Fax:
Swansea SA2 8PP                         (national)        (01792) 295708
UK                                      (international) +44 1792  295708
                                       =20
Visiting address:                       Email: a.g.setzer@swan.ac.uk
Faraday Building,                       WWW:
Computer Science Dept.            http://www.cs.swan.ac.uk/~csetzer/=20
2nd floor, room 211.      -------------------------------------------------=
-----------------------------
=20
 (2)


FOUNDATIONS OF THE FORMAL SCIENCES V:
Infinite Games

http://www.math.uni-bonn.de/people/fotfs/V/

Rheinische Friedrich-Wilhelms-Universit=E4t Bonn
Mathematisches Institut

November 26th to 29th, 2004

Infinite Games have been investigated by mathematicians since the
beginning of the twentieth century and have played a central role in
mathematical logic. However, their applications go far beyond mathematics:
they feature prominently in theoretical computer science, philosophical
Gedankenexperiments, as limit cases in economical applications, and in
many other applications. The conference FotFS V wants to bring together
researchers from the various areas that employ infinitary game techniques
to talk about similarities and dissimilarities of the different approaches
and develop cross-cultural bridges.

We invite all researchers from areas applying infinitary game-theoretic
methods (economists, mathematicians, logicians, philosophers, computer
scientists, sociologists) to submit their papers before September 15th,
2004. Topics will include Games in Algebra and Logic, Games in Higher Set
Theory, Games in Set-Theoretic Topology, Infinite Games & Computer
Science, Infinite Games in Philosophy, Infinite Evolutionary Games,
Machine Games, Game Logics, Infinite Games in the Social Sciences.

Invited Speakers:

    * Samson Abramsky, Oxford UK
    * Alessandro Andretta, Torino
    * Natasha Dobrinen, State College PA
    * Ian Hodkinson, London UK
    * Kevin Kelly, Pittsburgh PA
    * Hamid Sabourian, Cambridge UK
    * Marion Scheepers, Boise ID  =20
    * Brian Skyrms, Irvine CA

Organizing & Scientific Committee: Stefan Bold (Bonn / Denton TX),
Boudewijn de Bruin (Amsterdam), Peter Koepke (Bonn), Benedikt L=F6we
(Amsterdam / Bonn, Coordinator), Thoralf R=E4sch (Potsdam), Johan van
Benthem (Amsterdam / Stanford).

Coordinating e-mail Address: fotfs@math.uni-bonn.de


(3)=20

British Logic Colloquium 2004, University of Leeds, September 6--8.=20
Registrations are now invited for this event, and there is an online=20
registration form on the website,
http://www.maths.leeds.ac.uk/Pure/logic/blc04.html
A late registration fee is incurred for registrations after July 5, so=20
please register promptly. General enquiries should be addressed to=20
Dugald Macpherson (h.d.macpherson@leeds.ac.uk). A poster=20
advertising the event is attached (WORD file), and it would be very=20
much appreciated if you can display this.

The meeting is supported by the London Mathematical Society annd=20
the British Logic Colloquium

(4)


******************************************************************* =20
* Past issues of the newsletter are available at
  http://www.lfcs.informatics.ed.ac.uk/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
  can be found at=20
  http://www.lfcs.informatics.ed.ac.uk/lics/newsletters/inst.html
*******************************************************************


TABLE OF CONTENTS
* IN MEMORIAM
  Harald Ganzinger 1950-2004
* CONFERENCES AND WORKSHOPS
  LICS 2004 - Call for Participation
  LCC'04 - Call for Participation
  FCS 04 - Call for Participation
  MOMPES 2004 - Call for Participation
  TLCA 05 - Call for Papers
  FST&TCS 2004 - Call for Papers
  FAST 2004 - Call for Papers
  VODCA 2004 - Call for Papers
* SCHOOLS AND COURSES
  ESSLI 2005 - Call for Course and Workshop Proposals
  1st World Congress and School on Universal Logic
  International Master in Computational Logic
* VACANCIES
  Academic Positions at University of Wales Swansea
* BOOK ANNOUNCEMENT
  Interactive Theorem Proving and Program Development, Coq'Art: the=20
    Calculus of Inductive Constructions - Y. Bertot, P. Casteran

 =20
HARALD GANZINGER 1950-2004
  http://www.mpi-sb.mpg.de/inmemoriam/HaraldGanzinger.html
* The LICS community mourns the loss of Harald Ganzinger,=20
  LICS 2004 Program Committee Chair, who died on June 3, 2004.
  Although he had been in poor health for quite some time,
  Harald made a valiant effort to guide the LICS 2004 Program
  Committee through the selection of the papers for the conference.
  Unfortunately, he will not be present at the conference
  for which he worked so hard. He will also not be present to receive=20
  the 2004 Herbrand Award at the IJCAR conference in July 2004 (see=20
  http://domino.mpi-sb.mpg.de/internet/news.nsf/Press+Releases/20040420).
  Harald's passage leaves a void in our community that will be hard to fill=
=2E
  A tribute to his memory and contributions will be paid during
  the joint 2004 ICALP/LICS Conference at Turku in July.
* Andrei Voronkov has now assumed the duties of LICS 2004 Program
  Committee Chair.


19TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2004)
  (co-located with ICALP 2004)
  Turku, Finland, July 13-17, 2004
  http://www.lfcs.informatics.ed.ac.uk/lics/
  Call for Participation
* The LICS Symposium is an annual international forum on theoretical and
  practical topics in computer science that relate to logic in a broad
  sense.  We invite submissions on that theme. Suggested, but not
  exclusive, topics of interest for submissions include: automata
  theory, automated deduction, categorical models and logics,
  concurrency and distributed computation, constraint programming,
  constructive mathematics, database theory, domain theory, finite model
  theory, proof theory, formal aspects of program analysis, formal
  methods, hybrid systems, lambda and combinatory calculi, linear logic,
  logical aspects of computational complexity, logics in artificial
  intelligence, logical representation of knowledge, logics of programs,
  logic programming, modal and temporal logics, model checking,
  programming language semantics, reasoning about security, rewriting,
  specifications, type systems and type theory, and verification.
* Invited speakers:=20
  LICS: S. Abramsky (U. Oxford), D. Sangiorgi (U. di Bologna),
    I. Walukiewicz (U. Bordeaux),
  Joint ICALP/LICS: R. Harper (Carnegie Mellon), A. Razborov
    (Princeton & Moscow), M. Yannakakis (Stanford).
* For registration visit
  http://www.math.utu.fi/ICALP04/registration.html


WORKSHOP ON LOGIC AND COMPUTATIONAL COMPLEXITY (LCC'04) =20
  (affiliated with ICALP'04 and LICS 2004)
  Turku, Finland, July 12-13, 2004
  Call for participation
* Preliminary Program:
    Stephen Cook,     Making Sense of Bounded Arithmetic
    Victor Dalmau,    The Complexity of Retraction Problems
    Andrei Bulatov,   Polymorphisms of Relational Structures
    Phokion Kolaitis, Data Exchange: Aspects of Logic and Complexity=20
    Patrick Baillot,  Type Inference for Light Affine Logic Via
      Constraints on Words =20
    Jean-Yves Marion, Resource Analysis by Quasi-Interpretations
    Daniel Leivant,   Implicit Complexity Via Logics of Programs=20
    Kazushige Terui,  Decomposition of Computation Via Linear Logic=20
    James Royer,      Adventures in Time and Space
* For details see
  http://www.cis.syr.edu/~royer/lcc/LCC04


FOUNDATIONS OF COMPUTER SECURITY (FCS'04)
  affiliated with LICS'04 and ICALP'04
  Turku, Finland, July 12-13, 2004
  Call for Participation
* Invited Speaker: Martin Abadi, University of California at Santa Cruz
* For details see:
  http://www.cs.chalmers.se/~andrei/FCS04/


1ST WORKSHOP ON MODEL-BASED METHODOLOGIES FOR PERVASIVE AND EMBEDDED
SOFTWARE (MOMPES 2004)=20
  Hamilton, Ontario, Canada, June 15, 2004=20
  within the 4th International Conference on Application of=20
    Concurrency to System Design 2004 (ACSD 2004)=20
* The Object Management Group's Model Driven Architecture (MDA)=20
  paradigm is an approach to the development of software, based on=20
  the separation between the specification of the systems and their=20
  implementation using specific platforms. This workshop focuses on=20
  the scientific and practical aspects related with the adoption of=20
  Model Driven Development MDD) methodologies (notation, process,=20
  methods, and tools) for supporting the construction of pervasive=20
  and embedded software.=20
* For details see:
  http://www.di.uminho.pt/mompes04=20


SEVENTH INTERNATIONAL CONFERENCE ON TYPED LAMBDA CALCULI AND=20
APPLICATIONS (TLCA 05)
  Nara, Japan, 21-23 April 2005
  Colocated with RTA'05 as RDP 2005
  Call for Papers
* The TLCA series of conferences serves as a forum for presenting original=
=20
  research results that are broadly relevant to the theory and applications=
=20
  of typed lambda calculi and related systems.
* The programme of TLCA'05 will consist of three invited talks and about=20
  25 papers selected from original contributions. Accepted papers will=20
  be published as a volume of Springer Lecture Notes in Computer Science=20
  series.
* Deadlines:
  Titles and abstracts due:  October 25, 2004
  Paper submission deadline: November 2, 2004
* For details see
  http://www.kurims.kyoto-u.ac.jp/rdp05/tlca/


THE 24th CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY
AND THEORETICAL COMPUTER SCIENCE - FST&TCS 2004
  December 16-18, 2004, Chennai, INDIA
  Call for Papers
* Important dates:
  Submissions:    21st June   2004
  Notification:   20th August 2004
* Satellite Workshops: December 13--15, 2004.
  Algorithms for dynamic data,
    coordinated by S. Muthukrishnan and Pankaj Agarwal.
  Logic for dynamic data, coordinated by Uday Reddy.
* Invited Speakers:
  Javier Esparza, Piotr Indyk, Pavel Pevzner, John C. Reynolds
  and Denis Therien.
* For details see:
  http://www.fsttcs.org/


2ND INTERNATIONAL WORKSHOP ON FORMAL ASPECTS IN SECURITY=20
AND TRUST (FAST2004)
  Toulouse, France, 26-27 August  2004
  Call for Papers
* The second international Workshop on Formal Aspects in Security & Trust
  aims at continuing the successful efforts of FAST 2003 for the=20
  aggregation of researchers in the areas of security and trust.
* FAST2004 is a satellite event of 18th IFIP World Computer
  Congress (WCC2004) and is under the auspicies of IFIP WG 1.7
  on "Theoretical Foundations of Security Analysis and Design"
* Paper Submission: 18 June 2004
* For details see
  http://www.iit.cnr.it/FAST2004


1ST INTERNATIONAL WORKSHOP ON VIEWS ON DESIGNING COMPLEX
ARCHITECTURES (VODCA 2004)
  Bertinoro (Italy)
  September 11-12, 2004.
* The workshop aims at providing a platform for young scientist to=20
  present their research views on all areas related to the design of=20
  complex architectures, with a special focus on the security and=20
  management of information.=20
* Submission of papers: June 25, 2004
* For details see
  http://www-gris.det.uvigo.es/vodca


SEVENTEENTH EUROPEAN SUMMER SCHOOL IN LOGIC, LANGUAGE AND INFORMATION
  August 8--19, 2005, Edinburgh, U.K
  Call for Course and Workshop Proposals
* The Seventeenth European Summer School in Logic, Language and Information
  will be held at Heriot-Watt, Edinburgh, United Kingdom.  The Summer
  Schools focus on the interface between linguistics, logic and
  computation.  Foundational, introductory and advanced courses together
  with workshops cover a wide variety of topics within the three areas
  of interest: Language and Computation, Language and Logic, and Logic
  and Computation.
* The ESSLLI 2005 Program Committee invites proposals for foundational,
  introductory, and advanced courses, and for workshops for the 17-th
  annual Summer School on a wide range of timely topics that have
  demonstrated their relevance in the following fields:
  - Language & Computation
  - Language & Logic
  - Logic & Computation
* All proposals should be submitted no later than Thursday July 15,
  2004.  Authors of proposals will be notified of the committee's
  decision no later than Wednesday September 15, 2004.=20
* For details see
  http://www.esslli.org/2005/cfp.txt


1ST WORLD CONGRESS AND SCHOOL ON UNIVERSAL LOGIC
  Montreux Switzerland
  School: March 26-30; Congress: March 31 - April 3, 2005
* This event will focus on:
  1) Techniques that can be used for a general theory of logics =20
  (Labelled deductive systems, Kripke structures, Logical matrices, etc.)
  2) Studies  of classes of logics (Substructural logics, Non monotonic =20
  logics, Paraconsistent logics, etc.)
  3) Scope of validity and domain of application of fundamental theorems =
=20
  of logic (Completeness, Deduction, Cut-elimination, etc.)
  4) Philosophical considerations about the nature of logic and the =20
  universality of some logical laws or axioms
* The school is intended for advanced students and young researchers. =20
  There will be about 20 tutorials on many subjetcs: combination of =20
  logics, multiple conclusion logic, combinatory logic, logics and =20
  games,  abstract model theory, logic as language vs. logic as =20
  calculus,  category theory for logics, etc.
* Invited speakers of the congress will include A.Avron, D.Batens, =20
  J.Corcoran, M.Dunn, D.Gabbay, R.Jansana, A.Koslow, V.de Paiva, =20
  K.Segerberg.
* Contributed papers for the congress can be submitted before=20
  October 30, 2004.
* More information on the website: http://www.uni-log.org


MSC IN COMPUTATIONAL LOGIC 2004-5
  International Master in Computational Logic
  Departamento de Informatica, FCT/UNL, Lisbon
  Computer Science Dept., T.U. Dresden=20
* For information see: http://www.di.fct.unl.pt/mcl/


PROFESSORSHIPS, READERSHIPS, LECTURESHIPS, TUTORSHIPS
* The department of computer science at Swansea (Wales, UK) is
  currently advertising academic positions at all levels.
  We hope especially to expand our groups in visual
  computing and in logic/theoretical computer science.
* Our department was rated 5 in the last research assessment exericse.
  It has a very strong group in logic and
  theoretical computer science which is amongst the biggest in
  UK. The members of that group are Ulrich Berger (proof theory,
  computability theory, type theory),  Phil Grant (artificial
  intelligence), Andy Gimblett (algebraic specification),
  Neal Harman (hardware verification, models of computation,
  algebraic specification), Oliver Kullmann (satisfiability problems),
  Markus Michelbrink (proof theory, type theory),
  Faron Moller (automata theory, modal and temporal logic),
  Markus Roggenbach (algebraic specification), Monika Seisenberger
  (proof theory, type theory, computability theory),
  Anton Setzer (proof theory, type theory) and
  John Tucker (algebraic specification, algebraic methods,
  computability theory). We have as well strong links to the
  mathematics department, with Roger Hindley (lambda-calculus)=20
  and Jiang-Lun Wu (nonstandard analysis).
* The deadline for application is 25 June 2004 (it is
  possible that late applications may be acceptable).
* The official advertisements can be found at=20
  http://www.jobs.ac.uk/jobfiles/IS433.html
  http://www.jobs.ac.uk/jobfiles/IS434.html


BOOK ANNOUNCEMENT
  Interactive Theorem Proving and Program Development,
    Coq'Art: the Calculus of Inductive Constructions
  Yves Bertot, Pierre Casteran
  Springer Verlag, 2004, ISBN 3-540-20854-2
  http://www.labri.fr/Perso/~casteran/CoqArt/
* Coq is an interactive proof assistant for the development of mathematical
  theories and formally certified software. It is based on a theory called=
=20
  the calculus of inductive constructions, a variant of type theory.
* This book provides a pragmatic introduction to the development of proofs=
=20
  and certified programs using Coq. With its large collection of examples=
=20
  and exercises it is an invaluable tool for researchers, students, and=20
  engineers interested in formal methods and the development of zero-fault=
=20
  software.
* This book can be ordered directly from Springer (see the URL above)

From=20als+lics-replies-ignored@inf.ed.ac.uk Thu Jun 17 18:04:37 2004
Date: Thu, 10 Jun 2004 12:11:42 +0100
From: Alex Simpson 
To: LICS List 
Subject: LICS 2004 - Call for Participation


The deadline for early registration for LICS 2004 is *June 15, 2004*.

------------------------------------------------------------------------

                        CALL FOR PARTICIPATION

                 Nineteenth Annual IEEE Symposium on=20
                LOGIC IN COMPUTER SCIENCE (LICS 2004)

               July  13th - 17th, 2004, Turku, Finland
              http://www.lfcs.informatics.ed.ac.uk/lics/


The LICS Symposium is an annual international forum on theoretical and
practical topics in computer science that relate to logic in a broad
sense.


For registration visit

  http://www.math.utu.fi/ICALP04/registration.html

The deadline for early registration is June 15, 2004.


Collocated events:=20
ICALP'04 will be collocated with LICS'04; for details see
http://www.math.utu.fi/ICALP04/.=20


Invited Speakers:
The following distinguished speakers will give invited talks at LICS 2004:=
=20
  Samson Abramsky (U. of Oxford),
  Robert Harper (Carnegie Mellon University),
  Alexander Razborov (IAS, Princeton, and Steklov Math. Inst., Moscow),
  Davide Sangiorgi (U. di Bologna),
  Igor Walukiewicz (U. Bordeaux), and
  Mihalis Yannakakis (Stanford U.).


For full program visit LICS website

  http://www.lfcs.informatics.ed.ac.uk/lics/


Program Committee:
Rajeev Alur, U. of Pennsylvania
Andrew Appel, Princeton U.
Albert Atserias, UPC, Barcelona
Franz Baader, Dresden U.
Samuel Buss, U. of California, San Diego
Roberto Di Cosmo, U. de Paris VII=20
Gilles Dowek, Ecole Polytechnique, Paris
Harald Ganzinger, MPI, Saarbruecken (chair)
Martin Hofmann, LMU Muenchen
Achim Jung, U. of Birmingham
Kim Larsen, Aalborg U.
Leonid Libkin, U. of Toronto=20
Rocco de Nicola, U. di Firenze
Damian Niwinski, Warsaw U.
Prakash Panangaden, McGill U., Montreal
Albert Rubio, UPC, Barcelona
Vitaly Shmatikov, SRI International
Moshe Vardi, Rice U., Houston
Helmut Veith, TU Wien
Andrei Voronkov, U. of Manchester


Conference Chair:
Lauri Hella
Department of Math., Stat., and Phil.
Kanslerinrinne 1
33014 University of Tampere,
Finland
Email: lauri.hella@uta.fi


Workshops Chair:
Phil Scott, U. of Ottawa
Email: phil@site.uottawa.ca


Publicity Chair:
Alex Simpson, U. of Edinburgh
Email: Alex.Simpson@ed.ac.uk


General Chair:
Phokion G. Kolaitis, UC Santa Cruz
Email: kolaitis@cse.ucsc.edu


Organizing Committee:
S. Abramsky, A. Broder, E. Clarke, A. Felty,
H. Ganzinger, H. Gabow, J. Halpern, L. Hella,
U. Kohlenbach, P. Kolaitis (chair), D. Leivant,=20
G. Longo, H. Mairson, A. Middeldorp, J. Mitchell,=20
M. Nielsen, P. Panangaden, G. Plotkin,  F. Pfenning,=20
P. Scott, R. Shore, A. Simpson, I.A. Stewart.

Advisory Board:
Y. Gurevich, C. Kirchner, D. Kozen, U. Martin, L. Pacholski,
V. Pratt, A. Scedrov, M.Y. Vardi, G. Winskel.


Sponsorship:=20
The symposium is sponsored by the IEEE Technical Committee on
Mathematical Foundations of Computing in cooperation with the
Association for Symbolic Logic, and the European Association for
Theoretical Computer Science.

(5)


***************************************************************************=
*************************************
***************************************************************************=
***************************************************************************=
*************
1st World Congress and School on Universal Logic (UNILOG 2005) http://www.u=
ni-log.org=20
Montreux - Switzerland, School :  March 26-30 ; Congress : March 31 - April=
 3, 2005=20

This event will focus on:=20

1) Techniques that can be used for a general theory of logics (Labelled ded=
uctive systems, Kripke structures, Logical matrices, etc.) ;=20

2) Studies  of classes of logics (Substructural logics, Non monotonic logic=
s, Paraconsistent logics, etc.)=20

3) Scope of validity and domain of application of fundamental theorems of l=
ogic (Completeness, Deduction, Cut-elimination, etc.)

4) Philosophical considerations about the nature of logic and the universal=
ity of some logical laws or axioms=20

The school is intended for advanced students and young researchers. There w=
ill be about 20 tutorials on many subjetcs: combination of logics, multiple=
 conclusion logic, combinatory logic, logics and games,  abstract model the=
ory, logic as language vs. logic as calculus,  category theory for logics, =
etc.

Invited speakers of the congress will include A.Avron, D.Batens, J.Corcoran=
, M.Dunn, D.Gabbay, R.Jansana, A.Koslow, V.de Paiva, K.Segerberg.

Contributed papers for the congress can be submitted before October 30, 200=
4.=20

More information on the website:  http://www.uni-log.org

***************************************************************************=
*****************************************************************





 =20

---------
Dr Mirna Dzamonja
Reader
School of Mathematics
University of East Anglia
Norwich, NR47TJ
UK

phone: +44-1603-592981
fax: +44-1603-593868

The conference announcement is here


Home Index

+++++++++++++++++++++++++++

Page maintained by E.Ritter@cs.bham.ac.uk

Last modified: Fri Jun 18 11:20:52 BST 2004