[Past issues of the newsletter are available at http://logik.mathematik.uni-freiburg.de/lics and http://www.bell-labs.com/topic/conferences/lics] ANNOUNCEMENT FOR STUDENTS WHO REGISTERED FOR FLoC'99 * If you registered for any of FLoC'99 workshops, you are entitled to a free registration for any other FLoC'99 workshop, not necessarily held on the same day. Please inquire at the registration desk upon your arrival to Trento. Students who plan to take advantage of this offer should register for a workshop of their choice as soon as possible, as registration to some workshops may be closed soon due to space limitations. Please include a proof of full-time student status with your registration (a copy of your student ID and advisor's name). BOOK ANNOUNCEMENT In the Light of Logic Solomon Feferman Oxford University Press, New York, 1998 ISBN 0-19-508030-0 340 pp. * In this collection of essays written over a period of twenty years, Solomon Feferman explains advanced results in modern logic and employs them to cast light on significant problems in the foundations of mathematics. Most troubling among these is the revolutionary way in which Georg Cantor elaborated the nature of the infinite, and in doing so helped transform the face of twentieth-century mathematics. Feferman details the development of Cantorian concepts and the foundational difficulties they engendered. He argues that the freedom provided by Cantorian set theory was purchased at a heavy philosophical price, namely adherence to a form of mathematical platonism that is difficult to support. Beginning with a previously unpublished lecture for a general audience, "Deciding the Undecidable," Feferman examines the famous list of twenty-three mathematical problems posed by David Hilbert, concentrating on three problems that have most do with logic. Other chapters are devoted to the work and thought of Kurt Goedel, whose stunning results in the 1930s on the incompleteness of formal systems and the consistency of the continuum hypothesis have been of utmost importance to all subsequent work in logic. Though Goedel has been identified as the leading defender of set-theoretical platonism, surprisingly even he at one point regarded it as unacceptable. In his concluding chapters, Feferman uses tools from the special part of logic called proof theory to explain how the vast part--if not all--of scientifically applicable mathematics can be justified on the basis of purely arithmetical principles. At least to that extent, the question raised in two of the essays of the volume, "Is Cantor Necessary?," is answered with a resounding "no." This volume of important and influential work by one of the leading figures in logic and the foundations of mathematics is essential reading for anyone interested in these subjects. BOOK ANNOUNCEMENT Neutrosophy: Neutrosophic Probability, Set, and Logic Florentin Smarandache American Research Press, Rehoboth, USA, 1998 ISBN 1-879585-63-4, 105 pages http://www.gallup.unm.edu/~smarandache/. * The Neutrosophy is a new branch of philosophy which studies the origin, nature, and scope of neutralities, as well as their interactions with different ideational spectra. Neutrosophic Probability (as a generalization of the classical probability) studies the chance that a particular event will occur, where that chance is represented by three coordinates (variables): t% true, i% indeterminate, and f% false, with t+i+f = 100 and f,i,t belong to [0, 100]. Neutrosophic Statistics is the analysis of such events. Neutrosophic Set (as a generalization of the fuzzy set) is a set such that an element belongs to the set with a neutrosophic probability, i.e. t% is true that the element is in the set, f% false, and i% indeterminate. Neutrosophic Logic (as a generalization of the fuzzy logic) means the study of neutrosophic logical values of the propositions. Neutrosophic logic is useful in artificial intelligence, neural networks, evolutionary programming, neutrosophic dynamic systems, and quantum mechanics. WORKSHOP ON LOGICAL FRAMEWORKS AND META-LANGUAGES (LFM'99) Paris, France, September 28, 1999 (part of PPDP'99) Call for papers http://www.cs.bell-labs.com/~felty/LFM99/ * Topics. The design of logical frameworks, meta-theoretical studies, comparative studies, implementation, techniques of representation of formal systems, proofs of properties of formal systems, program development and proofs of program correctness, etc. * Submission. An extended abstract (about 5-8 pages) explaining work in progress or more mature work should be mailed electronically to felty@research.bell-labs.com, to be received by 15 July, 1999. Submissions should be sent as uuencoded compressed (or gziped) postscript files. * Program committee. David Basin, Iliano Cervesato, Joelle Despeyroux Amy Felty (chair), Sara Kalvala, Raymond McDowell. INTERNATIONAL SYMPOSIUM ON DOMAIN THEORY (ISDT '99) Shanghai, China, October 17-24, 1999 Call for contributions http://www.cs.uga.edu/~gqz/ISDT.html * Topics. Topological and logical aspects of domains, categories of domains and powerdomains, partial orders and metric spaces, applications in databases, mathematics, and AI, applications in types and concurrency, non-classical and partial logics, programming language semantics * Confirmed invited speakers. Klaus Keimel, Jimmie Lawson, Ji-Hua Liang, Guo-Qiang Zhang. * Submission deadline. May 15, 1999. A one page abstract including title, address, and e-mail address should be e-mailed to Prof. Guo-Qiang Zhang at gqz@cs.uga.edu, in plain text and with header ISDT. The abstract should contain a brief description of original work not appeared before elsewhere. An URL containing the electronic version of the paper in postscript should be provided in the abstract when available. Authors are expected to submit, after the conference, a full paper to be refereed for possible inclusion in the conference proceedings. * Program committee. Ying-Ming Liu (chair), Yixiang Chen (co-chair), Klaus Keimel,(co-chair), Guo-Qiang Zhang, (co-chair). * Further information. See the URL above. FRONTIERS OF COMBINING SYSTEMS (FroCoS'2000) March 22-24, 2000, Nancy, France Call for Papers http://www.loria.fr/conferences/frocos2000/ * Topics. Combination of logics; combination of constraint solving techniques, of decision procedures, of term rewriting systems; combination of deduction systems and computer algebra; integration of decision procedures and other solving processes into constraint programming and deduction systems; modelization of hybrid systems; logic modeling of multi-agent systems. * Submission. Authors are encouraged to use LaTeX and the standard article class/style file (10pt). The primary means of submission will be electronic, in PostScript format. Papers should be compressed, then uuencoded, and e-mailed to frocos@loria.fr. Papers should not exceed 15 pages, and should be received via e-mail by October 1, 1999. Results must be unpublished, and not submitted for publication elsewhere. Submissions should start with title, author(s) (names, correspondence addresses, e-mail addresses), and abstract. * Program Committee. F. Baader, D. Basin, F. Benhamou, T. Fruehwirth, F. Giunchiglia, B. Gramlich, H. Kirchner (co-chair), C. Kreitz, T. Mossakowski, J. Pfalzgraf, M. de Rijke, C. Ringeissen (co-chair), T. Scott, M. Wallace. * FroCoS'2000 is just before ETAPS'2000 (Berlin, March 25-April 2,2000). PRINCIPLES, LOGICS, AND IMPLEMENTATIONS OF HIGH-LEVEL PROGRAMMING LANGUAGES (PLI 99) Paris, France, September 27 - October 1, 1999. Call for participation http://pauillac.inria.fr/pli/ * The colloquium on Principles, Logics, and Implementations of high-level programming languages is a collection of conferences and workshops aimed at the advancement of high-level programming languages. The first edition of PLI will be held in September 1999 in Paris and will bring together two popular conferences ICFP and PPDP (previously known as PLILP/ALP) focused on functional and declarative programming languages, and a collection of related satellite events. * PLI 99 comprises the following conferences and workshops: ICFP International Conference on Functional Programming PPDP Principles and Practice of Declarative Programming HOOTS Higher-Order Operational Techniques in Semantics IDL Implementation of Declarative Languages COCL Component-based Software Development in Computational Logic DPS Declarative Programming with Sets FDPE Functional and Declarative Programming in Education HASKELL workshop LFM Logical Frameworks and Meta-languages OOSDS Object-oriented Specification Techniques for Distributed Systems and Behaviours WAAAPL Workshop on Algorithmic Aspects of Advanced Programming Languages * A detailed presentation of the conference including a preliminary program, registration and accommodation information and forms are all available at the PLI home page given above. Other information mey be requested at symposia@inria.fr. 8TH INTERNATIONAL CONFERENCE ON ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST '2000) 23 May to 27 May 2000, Iowa City, Iowa, USA Call for papers http://www.cs.uiowa.edu/amast2000. * Topics. Software technology: systems software technology, application software technology, concurrent and reactive systems, formal methods in industrial software development, formal techniques for software requirements, design. Programming methodology: logic programming, functional programming, object paradigms, constraint programming and concurrency, program verification and transformation, programming calculi, specification languages and tools, formal specification and development case studies. Algebraic and logical foundations: logic, category theory, relation algebra, computational algebra, algebraic foundations for languages and systems, theorem proving and logical frameworks for reasoning, logics of programs. Systems and tools (for system demonstrations or ordinary papers). * Invited Speakers. Egidio Astesiano, Yuri Gurevich, Michael Healy, David Lorge Parnas, Jeannette Wing, Martin Wirsing. * Submission. Papers should be between five and fifteen pages and should be prepared using LaTeX and the LNCS style file. Send a fully self-contained postscript file to amast2000@cs.uiowa.edu before December 1, 1999. * Program Committee. Andre Arnold, Egidio Astesiano, Gabriel Baum, Didier Begay, Robert Berwick, Michel Bidoit, Val Breazu-Tannen, Gregor Bochmann, Chris Brink, Africa Manfred Broy, Christian Calude, Christine Choppy, Philippe Darondeau, Jim Davies, Rocco De Nicola, Ruy de Queiroz, Arthur Fleck, Marcelo Frias, Kokichi Futatsugi, Dov Gabbay, Harald Ganzinger, Radu Grosu, Yuri Gurevich, Armando Haeberer, Nicolas Halbwachs, Michael Healy, Peter Henderson, Yoshi Inagaki, Paola Inverardi, Dan Ionescu, Ryszard Janicki, Kari Jarkko, Michael Johnson, Douglas Jones, Helene Kirchner, Gary Leavens, Luigi Logrippo, Thomas Maibaum, Zohar Manna, Chris Marlin, Michael Mislove, Peter Mosses, George Nelson, Anton Nijholt, Maurice Nivat, Michael O'Donnell, Fernando Orejas, Robert Paige, David Lorge Parnas, Sriram Pemmaraju, Don Pigozzi, Jacques Printzs, Charles Rattray, Teodor Rus (chair), Giuseppe Scollo, Netherlands Stephen Seidman, Roger Shultz, Ken Slonneger, Douglas Smith, John Staples, Carolyn Talcott, Andrzej Tarlecki, Alagar Vangalur, Rob van Glabbeek, Paulo Veloso, Brian Warboys, Jeannette Wing, Martin Wirsing, Hantao Zhang. INTERNATIONAL SYMPOSIUM ON FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS (FOIKS 2000) Burg (Spreewald), Germany, February 14-17, 2000 Call for papers http://www.informatik.tu-cottbus.de/~fois/cfp.html * Topics. Logical foundations and semantics of datamodels, dependency theory, integrity and security, temporal aspects, foundations of information systems design including web-based information services, query languages and optimization, database dynamics, intelligent agents, non-monotonic reasoning, application of non-classical logics, finite model theory, deduction, abduction and induction in data and knowledge bases * Submission. Authors are invited to submit their paper by August 12, 1999, to the programme committee co-chairs at the following address: Bernhard Thalheim Institut fur Informatik, Technische Universitat Cottbus, Karl-Marx-Str. 17, 03044 Cottbus, Germany, thalheim@informatik.tu-cottbus.de. Electronic submission (device-independent ps-file) is preferred. Alternatively, send six hardcopies to the given address. Papers should not exceed 15 pages (single-spaced, 11pt, US letter or A4 paper) for long presentations, and 10 pages for short presentations, respectively. * Program Committee Co-chairs. Klaus-Dieter Schewe, Bernhard Thalheim. * Program Committee: Joachim Biskup, Leopoldo Bertossi, Francois Bry, Thomas Eiter, Marc Gyssens, Hele-Mai Haav, Steve Hegner, Hans-Joachim Klein, Marc Levene, Leonid Libkin, Udo Lipeck, Takao Miura, Janaki Ram, Domenico Sacca, Vladimir Sazonov, Dietmar Seipel, Nicolas Spyratos, Millist Vincent, Roel Wieringa. MATHEMATICS OF PROGRAM CONSTRUCTION (MPC 2000) Ponte de Lima, Portugal, 3-7 July, 2000 Call for papers http://www.di.uminho.pt/mpc2000 * This conference aims to promote the development of mathematical principles and techniques that are demonstrably useful and usable in the process of constructing computer programs (whether implemented in hardware or software). The focus of the conference is on techniques that combine precision with concision, enabling programs to be constructed by formal calculation. Within this theme, the scope of the conference is very diverse. We welcome contributions to programming methodology (for example, formal methods for program specification and transformation), to programming paradigms (for example, generic programming techniques and type systems) and to language design (for example, programming calculi and programming language semantics). Theoretical contributions are welcome provided their relevance to program construction is evident; discussion of applications is welcome provided the mathematical basis is evident. * Invited speakers. Cliff Jones, Jan Rutten, Mark Jones. * Submission. Full papers should be submitted in Postscript format by e-mail to reach Roland Backhouse or Jose Oliveira by 3rd January, 2000. * Program committee. Roland Backhouse (co-chair), Richard Bird, Eerke Boiten, Dave Carrington, Jules Desharnais, Jose Fiadeiro, Jeremy Gibbons, Lindsay Groves, Zhenjiang Hu, John Hughes, Johan Jeuring, Burghard von Karger, Dick Kieburtz, Carlos Kloos, K. Rustan M. Leino, Christian Lengauer, Lambert Meertens, Sigurd Meldal, Eugenio Moggi, Bernhard Moeller, Oege de Moor, Dave Naumann, Jose Oliveira, (co-chair) Kaisa Sere, Mark Utting, Phil Wadler. COMPUTING: THE AUSTRALASIAN THEORY SYMPOSIUM (CATS 2000) Canberra, 31 January - 2 February, 2000 Call for papers http://cs.anu.edu.au/cats2000/ * Topics. Algorithms and data structures, Category theory, Complexity and computability, Computational algebra, biology, geometry, logic, and number theory, Concurrency, Distributed and parallel computing, Formal semantics, specification, synthesis, and verification. * Invited Speakers. Mariangiola Dezani, Lance Fortnow, Emo Welzl. * Program Committee. R.J. Downey, P. Eades, A. Fekete, J.A. Goguen, J.W. Lloyd, I.A. Mason, J. Pach, I. Shparlinski, P.G. Walsh, R.F.C. Walters, D.A. Wolfram (Chair). * Submission. Submissions should be sent as LaTeX files by e-mail to cats2000@cs.anu.edu.au before 27 August 1999. LaTeX macros for the CATS Proceedings and formatting specifications for submissions will be available from http://cs.anu.edu.au/cats2000/catscfp.html.