Newsletter 25

April 4, 1995

The advance program neglected to mention that the "member" registration
rate also applies to members of the ASL (Association for Symbolic Logic).

* Call for Logos.  The organizing committee for the 1996 Federated Logic
  Conference would like a logo for the FLoC WWW pages and for printed
  items such as posters and programs.  The FloC logo should be suitable
  for displaying beside the full name of the conference.  If it uses an
  acronym, it should use "FLoC".  The logo should look good when
  rendered monochromatically.
* Incentives.  In addition to the fame, the winner will also receive
  congratulatory email and approving nods at FLoC'96.
* FLoC.  FLoC is a joint meeting of CADE, CAV, LICS and RTA.  For more
  information on FLoC, see the WWW page.
* Submissions.  Submissions should be sent by May 19, 1995, to the FLoC
  publicity chair: Doug Howe,  Submissions should
  be in some reasonably common electronic form (e.g postscript).  The
  winner will be announced on May 26.
* Further Information.

  July 3-7, 1995, Montreal, Canada
* Preliminary Programme.  Available on the WWW page, and by ftp from, username anonymous, your e-mail address as password,
  directory pub/doc/amast/amast95/, file PreliminaryProgramme.txt.  The
  programme includes abstracts of the invited talks, conference schedule,
  registration information and registration forms, and accommodation and
  travel information.
* Early Registration Deadline.  The deadline for reduced registration fees
  is Monday June 5, 1995.
* Further Information.  For bulletins on current status of the conference:; tools and demos:;
  registration:; local arrangements:  For subscribing to AMAST'95 mailing list:

  July 17-21, 1995, Kloster Irsee, Germany
* Preliminary program.  See the WWW page.
* Invited Lectures.  M. Broy, R. Bird, K. Apt, T. Coquand, N. Shankar.
* Marktoberdorf Summer School.  Attendance at the conference can
  conveniently be combined with participation in the 16th International
  Summer School Marktoberdorf, Logic of Computation, July 25 - Aug. 6,
  1995.  Marktoberdorf is about 20 km from Kloster Irsee.
* Further Information.  Prof. Dr. B. Moeller (MPC '95), Institut fur
  Mathematik, Universitat Augsburg, D-86135 Augsburg, Germany.  E-mail:  Fax: +49 821 598 2274.

The European Institute in the Logical Foundations of Computer Science
invites applications for PostDoctoral Fellowships. These can be held for
periods ranging from six months to one year. 
* Research Area.  The goal of the work in the Institute is to achieve a
  unified and applicable theory of the semantics and logic of languages
  used to describe, design and program computing systems. The research of
  the Insititute is characterised by a unified approach to foundational
  problems that emphasises the combination of ideas arising in design and
  practice with ideas originating in logic and allied mathematical
  areas. The applicability of the ideas developed is demonstrated by
  producing experimental systems for specification, verification and
* Institute Sites and Contact Points.  CWI, Amsterdam, Jaco de Baaker
   (+31) 20 592 4136.  The University of Cambridge, Andrew
  Pitts  (+44) 223 334621.  The University of Edinburgh,
  Don Sannella  (+44) 31 650 5184.  Imperial College,
  London, Samson Abramsky  (+44) 71 589 5111 x5005.  ENS
  and INRIA, Paris, Giuseppi Longo  (+33) 14 432 3328.
  The University of Pisa., Ugo Montanari  (+39) 50 510
  221.  INRIA, Sophia Antipolis; Gilles Kahn 
  (+33) 93 65 78 01.
* Deadline.  All aplications must be received by the host site by 30th
  April 1995.
* Eligibility.  1. The applicant must be a national of one of the Member
  States of the European Community or EFTA, or be resident in the European
  Community.  2.  The applicant must be a national of a country other than
  that in which the host institution is established and must not have
  carried out their normal activity in that country for more than two years
  prior to the date of submission of the application.  3.  Applicants must
  be young researchers, without other income, having at least six years'
  higher education and who hold a doctoral or equivalent degree, or, if
  not, have had two years' research experience following a post-graduate
* Further Information.  More general information on the Institute or the
  fellowship programme may be requested from Gordon Plotkin
   (scientific information), or George Cleland
   (administrative information).

  August 19-20, 1995, FernUniversitaet, Hagen, Germany
* Topics.  The aim of this workshop is to bring together people who are
  interested in computational aspects of analysis to discuss the related
  issues.  Main focuses will be the state of the art in computability and
  complexity theory of analysis, with the emphasis on Turing machine based
  theory, as well as comparison of different models of computation for
  analysis. In particular, discussions in the direction of whether there is
  (can or should be) a standard foundation of computability and
  computational complexity in analysis (i.e., an extension of Church's
  Thesis on real-valued computation) are encouraged.  Topics include:
  computability in analysis ; computational complexity in analysis (both
  with emphasis on models based on Turing machines); foundations of
  computable analysis, presentation and comparison of models of computation
  in analysis.
* Submissions.  Participants who wish to give a talk must send an extended
  abstract (approx. 5-10 pages) as a hardcopy by mail or a printable
  PostScript file by email to one of the organizers by August 4, 1995.
* Organizers.  Ker-I Ko, Department of Computer Science, State University
  of New York, Stony Brook, NY 11794, U.S.A.  Tel: (516)632-8460.  Fax:
  (516)632-8334.  Email:  Klaus Weihrauch,
  Theoretische Informatik I, FernUniversitaet, D-58084 Hagen, Germany.
  Tel: +49-2331-987 2722.  Fax: +49-2331-987 313.  Email (workshop):

  December 8, 1995, Singapore (DOOD'95 post-conference-workshop)
* Topics.  The workshop is intended to bring together researchers to
  discuss the integration of logic-based approaches with temporal or 
  dynamic object bases. Suggested topics are (but are not limited to):
  temporal specification and verification of object-based systems,
  deduction in temporal databases, logical frameworks for transactions
  in deductive and object-oriented databases, temporal constraints in
  deductive and object-oriented databases, non-standard logics for
  modeling temporal aspects of deductive and object-oriented databases.
* Program co-chairs.  Jose Luiz Fiadeiro, Department of Informatics,
  Faculty of Sciences, University of Lisbon, Campo Grande, 1700 Lisboa,
  Portugal. E-mail:  Gunter Saake, University
  of Magdeburg, Institute for Technical Information Systems, P.O.Box 4120,
  D-39016 Magdeburg, Germany. E-mail:
* Program Committee.  Jose Carmo, Weidong Chen, Jose Fiadeiro, Dov Gabbay,
  Udo Lipeck, Gunter Saake, Interpal Singh Mumick, Zoltan Somogyi,
  V.S. Subrahmanian, Kian-Lee Tan, Alexander Tuzhilin, Roel Wieringa,
  Beat Wuthrich.
* Submissions.  Electronic submission (PostScript only) of extended
  abstracts (no longer than 10 pages) to
  In case electronic submission is not possible, send four hardcopies to
  Stefan Conrad (TRDOOD'95) , University of Magdeburg, Institute for 
  Technical Information Systems, P.O.Box 4120, D-39016 Magdeburg, Germany.
  The deadline for submissions is June 1, 1995.
* Further Information: (or see the WWW page).

* Subrecursive Programming Systems: Complexity & Succinctness.  J.S. Royer
  & J.Case, Syracuse University.  Subrecursive programming systems are
  pervasive throughout both theoretical and practical computer science.
  This monograph systematically and rigorously develops the theory of
  subrecursive programming systems and the powerful tools and techniques
  these systems support.  The tools are first applied to provide
  elegant,insightful, new proofs of known results in structural complexity
  theory and are then applied to establish major new theorems regarding
  program-succinctness trade-offs.  1994 Approx.251 pp.  Hardcover $49.50
  ISBN 0-8176-3767-2.  Progress in Theoretical Computer Science.
* The Combinatory Programme.  E. Engeler, ETH, Zurich with collaboration
  from K. Aberer, B.  Amrhein, O.  Gloor, M. von Mohrenschildt, D. Otth,
  G. Schwrzler and T.  Weibel.  Combinatory logic started as a programme in
  the foundation of mathematics and in an historical context at a time when
  such endeavors attracted the most gifted among mathematicians. The
  present small volume arose under quite different circumstances, namely
  within the context of reworking the mathematical foundations of computer
  science.  1994 152 pp.,6 Illus.  Hardcover $49.50 ISBN 0-8176-3801-6
  Progress in Theoretical Computer Science
* To Order.  Call: Toll Free 1-800-777-4643. In NJ please call
  201-348-4033.  Write: Birkhauser, Marketing Dept., 675 Massachusetts
  Ave., Cambridge, MA 02139.  Payment can be made by check, money order or
  credit card. Please enclose $3.00 for shipping & handling for the first
  book ($1.00 for each additional book) and IL, NY, NJ, MA, VT, PA, VA, TX
  & CA residents, please add sales tax. Canadian residents please add 7%
  GST. Prices change without notice. For price and ordering information
  outside North America, please contact Birkhauser Verlag AG, P.O. Box 133,
  Klosterberg 23, CH-4010, Basel, Switzerland, Fax 41 61 271 7666.

  May 2-7, 1995, Certosa di Pontignano (University of Siena, Italy)
* Topics.  The workshop will be held as part of the activity of the
  European network "Complexity, Logic and Recursion Theory" (EC Contract
  No. ERBCHRXCT930415).  Several sessions will be devoted to the
  scientific activity of the network, covering topics that range from
  relative computability to structural complexity, randomness and
* Invited Speakers.  K. Ambos-Spies, J. Balcazar, S.B. Cooper,
  S. Wainer, P. Odifreddi, P. van Emde Boas, F. Montagna, M. Arslanov,
  S. Goncharov, A. Kucera.
* Short Courses.  R. Downey: "Topics in Recursion Theory and
  Complexity"; E. Graedel: "Complexity and definability on finite
* Further Information.  Andrea Sorbi, Dipartimento di Matematica, Via
  del Capitano 15, 53100 Siena Italy.  E-mail: SORBI@UNISI.IT