Date: Sun, 1 May 1994 16:37:56 +0500 (GMT+4:00)
Subject: translation traps
Date: Sat, 30 Apr 94 20:37:54 EDT
From: Michael Barr
The exchange over that Latin illustrates very clearly the danger of
relying on cognates when translating. Had someone been translating
from Latin to, say Swahili, and translated mathematicae to whatever
the Swahili word is for mathematics, he would have to be considered to
have made an error in translation. I am reminded of a rather odd
mistranslation in the English translation of GAuss' Disquisitiones
in which Gauss is said to have claimed that previous mathematicians
have proved it (quadratic reciprocity, no less) by induction but he
(Gauss) was giving the first demonstration by infinite descent.
Of course, it was a mistranslation to translate probare by prove and
inductio by induction (although that is partly because mathematical
induction is a rather specialized use of the word even in English).
Of course, Gauss was claiming that others had tried it on a lot of
numbers, while he was giving the first correct proof, by that
form of mathematical induction called infinite descent.
Michael
Date: Tue, 3 May 1994 15:53:58 +0500 (GMT+4:00)
Subject: Confused about Cartesian closed categories.
Date: Tue, 03 May 94 15:21:32 +0100
From: Justin K Pearson
This is all very simple stuff, which I should have worked out a long time ago.
What is the correct definition of a Cartesian closed category?
Some books seem to say that a CCC has a finite limits plus
the relevant conditions to give you exponitails.
While other books seem to define it as finite products plus exponitails.
Am I reading all these books wrong (I always thought it was all finite limits
so I might of systimacitally misread lots of books since).
Or can you get finite limits from finite products (but where do you get
the equalisers form?)
Regards
Justin Pearson
Date: Wed, 4 May 1994 10:18:01 +0500 (GMT+4:00)
Subject: Re: Confused about Cartesian closed categories
Date: Tue, 3 May 94 17:16:17 EDT
From: Michael Barr
I am afraid that different authors make different asssumptions. I guess
the minimum you want is finite products (except that a C-monoid is
sometimes defined as a CCC with one object, so it has only finite
non-empty products), while others will want finite limits. They are
definitely different, no doubt of that and the complexity of the
computations in the initial CCC of those types is different too, so the
difference is important. There is an open question of some interest:
can an FP CCC with NNO be embedded into an FL CCC with NNO in a way
that preserves the NNO. I conjecture that it cannot, but if it
could, that would have some interesting consequences.
--Michael
Date: Wed, 4 May 1994 10:20:58 +0500 (GMT+4:00)
Subject: Re: Confused about Cartesian closed categories
Date: Wed, 4 May 1994 09:40:27 +0100 (BST)
From: Roy Crole
Justin Pearson asks what is the "correct" definition of Cartesian closed
category.
I would say that the definition most commonly used is that a category C
is a cartesian closed category (ccc) if it has specified terminal
object, binary products, and exponentials for each pair of objects.
This means that there is a (natural and) precise correspondence between
cccs, and equational theories with unit type, binary products and
function types.
What is potentially confusing is that a Cartesian category is often
taken to mean a category with finite limits (binary products and
equalisers) because Descartes's work involved equationally defined
subsets. For this reason it might be best to call cccs (def. as having
finite products and exponentials) by a different name, say exponential
categories---but here "best" is clearly of dubious meaning !
Roy Crole.
Date: Wed, 4 May 1994 10:19:25 +0500 (GMT+4:00)
Subject: Re: Confused about Cartesian closed categories
Date: 3-MAY-1994 18:42:24.47
From: "Fred E.J. Linton"
Justin Pearson asks:
> Some books ... say that a CCC has a finite limits plus ... exponentials.
> ... other books seem to define it as finite products plus exponentials.
> ... can you get finite limits from finite products ... ?
Just as Eilenberg's "co-six" category (all sets / or all finite sets /
of cardinality other than 6 ) provides an example of a closed category
that's not (but is almost) cartesian closed, so what one might call
"co-five" (all sets / or all finite sets / of cardinality other than 5 )
provides an example of a cartesian closed category (in the second sense)
not having all equalizers (so not finitely complete).
For some purposes one cares not a fig about the presence/absence of
finite limits (other than products, of course) -- for other purposes
one cares a lot.
[Of course almost any prime could have been used in place of the prime 5 .]
Fred E.J. Linton Wesleyan U. Math. Dept. 649 Sci. Tower Middletown, CT 06459
E-mail: ( or )
Tel.: + 1 203 776 2210 (home) or + 1 203 347 9411 x2249 (work)
Date: Wed, 4 May 1994 10:22:28 +0500 (GMT+4:00)
Subject: Re: Confused about Cartesian closed categories.
Date: Wed, 4 May 1994 10:44:28 +0000
From: Steven Vickers
>What is the correct definition of a Cartesian closed category?
MacLane ("Categories for the Working Mathematician") and many other
standard texts do not assume equalizers in a CCC, nor in a Cartesian
category.
If your interest in CCCs is that they provide categorical models for the
typed lambda calculus, then you don't need equalizers (see Lambek and
Scott, "Intro. to Higher Order Categorical Logic"), and many of the
standard examples in computer science don't have them.
I can recall only one case of the other usage, where CCCs have all finite
limits, and even there it was explained as a nonstandard convention.
Freyd and Scedrov ("Categories - Allegories") define "Cartesian" to mean
having all finite limits. Obviously one associates Cartesian coordinates
with finite products, but they point out that Descartes was also concerned
with equationally defined subsets, and those are equalizers. They avoid the
phrase "Cartesian closed category".
If you want my personal opinion, it's that neither CCCs nor - despite the
force of Freyd and Scedrov's comment - Cartesian categories are exected to
have limits other than finite products.
Steve Vickers.
Date: Wed, 4 May 1994 18:23:39 +0500 (GMT+4:00)
Subject: Re: Confused about Cartesian closed categories.
Date: Wed, 4 May 1994 15:34:33 +0000
From: Steven Vickers
(Correction to an earlier posting - sorry)
I wrongly stated that MacLane in Categories for Working Mathematicians
defines Cartesian categories to be those that have finite products. He
doesn't define the term at all. However, his Cartesian closed categories
are indeed categories with finite products and exponentials.
Thanks to Roy Crole for pointing this out.
Steve Vickers.
Date: Fri, 6 May 1994 13:35:36 +0500 (GMT+4:00)
Subject: preprint available
Date: Fri, 6 May 1994 15:39:32 +0200
From: kock@mi.aau.dk
Lift monad
I have made my 1992 prepint on the lift monad on posets
available by ftp. It describes some properties of the monad
which to a poset freely adjoins suprema for subsets with at
most one element (if the logic is boolean, this means just:
adjoining a bottom element).
The file (LaTeX) is called lif.tex, and may be picked up by
anonymous ftp in the directory papers/Kock at the site
theory.doc.ic.ac.uk
It is identical to Aarhus Preprint Series 1992, No.22,
"Constructive Theory of the Lift Monad on Posets".
Anders Kock
Date: Thu, 12 May 1994 16:14:19 +0500 (GMT+4:00)
Subject: oriented singular homology
Date: Thu, 12 May 94 13:14:49 EDT
From: Michael Barr
A couple months ago, I inquired if anyone knew anything about oriented
singular homology. Not receiving any replies, I worked on the question
myself. The answer is in the abstract below.
Let C_n denote the nth singular chain functor on the category of
topological spaces. Viewing C_n as the free abelian group on the
functor represented by Delta_n = {(t_0,...,t_n) | t_i >= 0 and t_0 +
... + t_n = 1}, it is clear there is a right action of the
permutation group Sigma_{n+1} by composition. Let U_n be the set of
all sigma p - sgn(p) sigma for sigma a singular n-simplex and p a
permutation. Let V_n consist of U_n together with all simplexes
sigma such that sigma = sigma p for some transposition p and let W_n
consist of U_n together with all simplexes sigma such that sigma =
sigma p for some odd permutation p. Then U, V and W are
subcomplexes and all the maps in C --> C/U --> C/V --> C/W are
homtopy equivalences (with natural transformations for the homotopy
inverses as well as the homotopies themselves. The proof uses the
original cotriple cyclic models theorem that Jon Beck and I proved
in 1965.
Date: Sun, 15 May 1994 17:45:47 +0500 (GMT+4:00)
Subject: FMCS-94-REGISTRATION
Date: Sat, 14 May 94 14:16:22 -0700
From: John MacDonald
**** FMCS UPDATE **** REGISTRATION DEADLINE ****
In order to book the proper size of rooms for meetings and the right
number of spaces for the banquet I need to have your registration in
by Wednesday May 25. Please email the registration information
requested below to johnm@math.ubc.ca.
Third Annual Workshop on
Foundational Methods in Computer Science
A workshop on applications of categories in computer science
Dates: June 3-5, 1994
Location: University of British Columbia, Vancouver, B. C.
Overview:
This will be the third year of the workshop on foundational methods
in computer science. It is an informal, casual meeting to bring
together researchers in mathematics and computer science with a focus
on the application of category theory in computer science. It is a
three day meeting and will have the same format as the one held last
year at Reed College and sponsored by the Oregon Graduate Insititute.
On Friday, June 3, we will have tutorials on category theory. On
Saturday June 4 and Sunday June 5 there will be a sequence of short
research presentations. The workshop will end at noon on Sunday.
All sessions will be held on the University of British Columbia
campus. There will not be a formal proceedings.
The registration fee is $75.(or $55.US) for regular registration and
$55.(or $40.US) for students. Registration includes reception,
refreshments at breaks, room bookings and a banquet Saturday evening.
It does not include meals(except for the banquet). Meals however can
be obtained inexpensively in the student cafeteria across the street
from the student residences.
NOTE: Dormitory accommodation is still available. If you have not
registered and wish to do so then just send me a brief note and I
will send you the room accomodation form by email. If you want to
stay off campus please make those arrangements on your own.
Schedule outline:
THURSDAY June 2:
6PM - 9PM Registration and reception in the Ruth Blair Room
of Walter Gage Towers (which is near the Student Union Building) on
the campus of the University of British Columbia. The location of the
talks will be posted each day in Walter Gage Towers.
FRIDAY June 3: Tutorials Sessions begin at 9:30 AM
SATURDAY June 4: Research sessions
SUNDAY June 5: Research sessions ending around noon
Speakers will include Robert Seely, Robin Cockett, E. Manes and David
Benson as well as a number of others possibly including Phil Mulry,
Bob Walters and Jim Hook. We are still in the process of arranging
further speakers and finalizing our program. Thus although there may
still be space left at the beginning of the meeting it is recommended
that you let us know on the registration form if you wish to speak.
** Registration ** DUE May 25!
Advance payment is preferred. Checks should be payable to John L.
MacDonald (or to L. Richardson). They should be mailed
to:
John MacDonald(FMCS94)
Department of Mathematics
University of British Columbia
Vancouver, B.C., Canada V6T 1Y4
Please send the registration form in even if you do not pay in
advance since we need this information for bookings. Fees may be
paid at the reception for those who have not prepaid.
*******************REGISTRATION INFORMATION NEEDED*******************
Name:
Affiliation:
Address:
email:
phone:
registration fee(regular= $75(or$55US), student= $55(or$40US):_______
presentation? (yes/no)
title:
preferred day:
Extra Banquet tickets ($26/person or $20.US):
******** SEND REGISTRATION INFORMATION to johnm@math.ubc.ca ********
REMARK: If you are coming in by air then you can come out to Gage
Towers on the UBC campus (a) by taxi (b) by airport limousine to
Hotel Vancouver and then a city bus on Burrard Street direct to UBC
or (c) to UBC by a combination of city buses.
Date: Mon, 16 May 1994 12:11:09 +0500 (GMT+4:00)
Subject: PSSL
Date: Mon, 16 May 94 15:27:36 BST
From: Lorraine Edgar
PERIPATETIC SEMINAR ON SHEAVES AND LOGIC
55th Meeting---Second Announcement
The 55th meeting of the seminar will be held at the University of
Edinburgh's Computer Science Department over the weekend of 28--29 May
1994. As usual, we welcome talks on or related to category theory,
geometry or logic. Attendees include one of the founders of the
seminar, Dana Scott, plus Robin Milner and Gordon Plotkin.
Here is a current list of speakers and titles:
Robin Milner TBA
Alex Mifsud TBA
Claudio Hermida TBA
David Murphy TBA
Edmund Robinson TBA
Bart Jacobs TBA
Alex Simpson `Categorical completeness results for the simply-typed
lambda-calculus'
Peter Johnstone `The category of Heyting algebras is protomodular'
Harold Simmons `The Smyth-Plotkin construction seen as an instance of
glueing'
There is no registration fee.
Attendees may be like to get together on the Friday evening in Maxie's
Bistro, 32b West Nicholson Street, Edinburgh from 7:30 pm. There will
be limited bar food available at Maxie's for those who want it.
Proceedings will begin on Saturday at 9:15 am in Room 3317, the James
Clerk Maxwell Building, the King's Buildings (the science campus of
Edinburgh University), when we will finalize the timetable and start
talks. The first session will be about concurrency, using categories
with structure to model it. A light lunch will be provided each day in
the adjoining room, as well as coffee and biscuits.
We enclose a list of reasonably priced, good quality Edinburgh
restaurants and bars. Fridays and Saturdays tend to be busy, so if you
want a specific restaurant, it is advisable to book in advance. If
you are not so fussy, you should have no difficulty finding something
reasonable around Lothian Road, near High Street, or down Leith Walk.
Those of you who have requested accommodation should already have
received details by electronic mail or fax. If you would like help in
booking accommodation, please contact Lorraine.
John Power
Marcelo Fiore
Lorraine Edgar
-------------------------------------------------------------------------------
Please return to Lorraine Edgar, Dept of Computer Science, University of
Edinburgh, The King's Buildings, Edinburgh EH9 3JZ.
I intend to come to the 55th meeting of the PSSL.
* I intend to give a talk entitled
* Please reserve accommodation for Friday/Saturday/Sunday night(s).
Name Address
Email Tel No
Fax No
(* Delete if inapplicable)
----------------------------------------------------------------------------
Restaurants
North Sea Village (556-9476) Sheraton Hotel (229-9131)
18 Elm Row (Leith) 1 Festival Square
Chinese Terraced restaurant, traditional
The Maple Inn (225-1721) Kalpna (667-9890)
44 Grindlay Street 2/3 St Patrick's Square
Chinese Indian vegetarian
Pierre Victoire Henderson's Salad Table (225-2131)
10 Victoria Street (225-1721) 94 Hanover Street
8 Union Street (557-8451) Vegetarian rest. and wine bar
38-40 Grassmarket (226 2442)
3-4 Dock Place (555-6178) Szechuan House (229-4655/6481)
French 12-14 Leamington Terrace
Chinese
Pierre Lapin (668-4332)
32 West Nicolson Street Suruchi (556-6583)
French (Mainly vegetarian) 14a Nicholson Street
Indian
L'Auberge (556-5888)
58 St Mary's Street Pubs and Wine Bars
French, expensive
Bannerman's Bar (556-3154)
Lancers Brasserie (332-3444) 212 Cowgate
5 Hamilton Place, 1 Dean Park Lane
Indian Cafe Royal Bistro Bar (557-4792)
17 West Rigester Street
Cavalry Club (228-3282) Bennets Bar (229-5143)
3 Atholl Place, near Haymarket 8 Leven Street
Indian
Cellar No 1 (220-4298)
Mammas (225-6464) 1 Chambers Street
30 Grassmarket Wine Bar
Italian
Tinelli Ristorante (652 1932) Maxie's Bistro \& Wine Bar (667-0845)
139 Easter Road 32b West Nicholson Street
Italian
Viva Mexico (226-5145)
Anchor Close (off Cockburn Street)
Mexican
Carlton Highland Hotel (556-7277)
North Bridge
Traditional
Date: Tue, 24 May 1994 17:22:57 +0500 (GMT+4:00)
Subject: Stone duality
Date: Mon, 23 May 1994 19:15:39 +0200 (MET DST)
From: Paul Johnson
One aspect of Stone duality is the representation of each
Boolean algebra as a subset B -> P(X)
(for some set X)
which is closed under the set-theoretic Boolean operations on P(X).
My guess is that this result persists over an arbitrary Boolean
topos E, provided one assumes there are enough prime ideals, ie.
that for each Boolean algebra B over V,
the subobject X -> E(B,Omega) consisting of lattice homomorphisms
is (in some sense) large enough???
Cheers, PBJ.
Date: Tue, 24 May 1994 18:42:31 +0500 (GMT+4:00)
Subject: Tempus Summer School in Budapest
Date: Tue, 24 May 1994 23:53:40 +0200
From: cora@ludens.elte.hu
Second Announcement & program of
ALGEBRAIC LOGIC and the METHODOLOGY OF APPLYING IT,
July 11-17, 1994, Budapest,
which is part of the TEMPUS Summer School series for
Algebraic and Categorial Methods in Computer Science.
This will be the third one in the above mentioned series of summer schools,
attached to the TEMPUS project entitled "Algebraic and Categorial Methods
in Computer Science". The summer school is sponsored by the European
Community TEMPUS office.
S C I E N T I F I C P R O G R A M
Courses:
________________________________________________________________
| |
| WILLEM BLOK and DON PIGOZZI: General Algebraic Logic |
| |
| VAUGHAN PRATT: Chu Spaces: Complementarity and Uncertainty in |
| Rational Mechanics |
| |
| YDE VENEMA: Boolean Algebras with Operators & Modal Logic |
| |
| ISTVAN NEMETI and HAJNAL ANDREKA: Algebras of Relations of |
| Various Ranks & their Applications |
| |
| WORKSHOP GIVEN BY YOUNG RESEARCHERS: Decidability issues and |
| logics related to the dynamic trend |
| |
| UNIVERSAL ALGEBRA TUTORIAL |
|________________________________________________________________|
ABSTRACTS OF COURSES:
Pratt: "Chu Spaces: Complementarity and Uncertainty in Rational
Mechanics"
"Rational mechanics" captures mind-body duality for autonomous agents in
essentially the same way that quantum mechanics captures momentum-position
duality for physical systems, with Chu spaces in place of Hilbert spaces.
Chu spaces expose a Heisenberg-like uncertainty principle as a previously
unnoticed yet prominent feature of Stone duality.
---------------
Venema: "Boolean Algebras with Operators & Modal Logic"
Formalisms related to Modal Logic play an important role in theoretical
computer science: think of examples like epistemic logic, dynamic logic
or relational algebra. Such formalisms can be treated in a nice algebraic
way via the theory of Boolean Algebras with Operators (BAOs). The course
will be centered around two themes: (1) the duality between BAOs and
Relational (Kripke) Structures, and (2) modal/algebraic languages to
describe these structures. We will review some important and elegant
theorems, like automatic completeness results for a large class of logics.
---------------
Nemeti and Andreka: "Algebras of Relations of Various Ranks &
their Applications"
Theories of relations (binary ones, ternary relations, n-ary ones etc.)
play an essential role both in Computer Science and in Logic. Besides
quantifier logics, they are important for e.g. logics of the dynamic trend,
resource-sensitive logics, substractural logics, logics of actions etc.
We will study algebras whose elements are relations. Research in this
area has been going on for 140 years, hence its theory is powerful and
profoundly applicable. The goal of the course is to make rich theory
accessible, to provide insight into why and how it works, and to highlight
the main directions in which it is "moving".
---------------
Workshop given by young researchers: "Decidability issues and logics
related to the dynamic trend"
The workshop will consist of talks given by young researchers from the
Logic School centered around Amsterdam and Budapest. The topics will be
related to those of the main courses. A tentative list is: decidability
issues (decision problems for Boolean algebras with operators, relation
algebras and algebras of relations of higher ranks), decidability of
logics of the dynamic trend, positive results on the finitization problem
(e.g. on the search for powerful algebras of relations forming a finitely
axiomatizable equational class), the connection between algebraic logic
and logic. This list is more likely to expand than shrink.
The purpose of these talks is to focus on new results and provide the
audience with open problems which might be rewarding to work on.
The speakers of the workshop will be Viktor Gyuris, Agnes Kurucz,
Maarten Marx, Szabolcs Mikulas and Andras Simon.
---------------
Universal Algebra tutorial
This elementary course presents those basics of universal algebra which
will be needed for the rest of the summer school. It is optional depending
on the background of the participant.
---------------
A TENTATIVE schedule of the programme is in the chart below. Abbreviations:
UA tuto = Universal Algebra tutorial
A-N = Andreka-Nemeti
B-P = Blok-Pigozzi
workshop = workshop given by young researchers
+---------+---------+---------+---------+---------+---------+
| Monday | Tuesday |Wednesday|Thursday | Friday |Saturday |
|=======|=========|=========|=========|=========|=========|=========|
| 8- 9 | | UA tuto | | | | |
|-------|---------|---------|---------|---------|---------|---------|
| 9-10 | Pratt | UA tuto |workshop |workshop |workshop |workshop |
|-------|---------|---------|---------|---------|---------|---------|
| 10-11 | Pratt | B-P | Pratt | B-P | Pratt | B-P |
|-------|---------|---------|---------|---------|---------|---------|
| 11-12 | UA tuto | B-P | A-N | B-P | Pratt | Venema |
|-------|---------|---------|---------|---------|---------|---------|
| 12-13 | | | | | | |
|-------|---------|---------|---------|---------|---------|---------|
| 13-14 | | | | | | |
|-------|---------|---------|---------|---------|---------|---------|
| 14-15 | A-N | Venema | E | Venema | A-N | to be |
|-------|---------|---------|---------|---------|---------|announced|
| 15-16 | A-N | Venema | X | Venema | A-N | later |
|-------|---------|---------|---------|---------|---------|---------|
| 16-17 | | Salibra | C | to be | to be | |
|-------|---------|---------|---------|announced|announced|---------|
| 17-18 | | | U | later | later | |
|-------|---------|---------|---------|---------|---------|---------|
| 18-19 | | | R | | | |
|-------|---------|---------|---------|---------|---------|---------|
| 19-20 | party | | S | | | |
|-------|---------|---------|---------|---------|---------|---------|
| 20-21 | party | | ION | | | |
+-------+---------+---------+---------+---------+---------+---------+
LECTURE NOTES: Every registered participant will receive basic lecture
notes for each course indicated in the program. Besides these notes,
scientific papers for further reading and extra copies of the lecture
notes will be sold throughout the summer school.
G E N E R A L I N F O R M A T I O N
ACCOMMODATION: In double bedrooms for 14 DM/day, or in single bedrooms
for 18 DM/day, in Summer Hotel Hill. The lectures will be in the same
building. 25m swimming pool and several other sport facilities will be
available.
MEALS: Continental breakfast for 4 DM/day, lunch for 5,3 DM/day.
SOCIAL PROGRAMS: We plan a reception on Monday evening and a sight seeing
afternoon on Wednesday.
REGISTRATION FEE: 120 DM for participants
50 DM for accompanying persons.
REGISTRATION: Please send name, address (including e-mail, if available)
and gender to the addresses given below as soon as you can. Please indicate
if you plan to bring a guest or indicate the name of participant with whom
you wish to share accommodation. Also indicate if you have any special
request (e.g. vegetarian meals). The number of participants is limited,
therefore registrations is accepted in the order of receipt.
TRAVEL: Budapest has two airport terminals, Ferihegy I and Ferihegy II.
>From both terminals you have the same possibilities to come to the center.
The most convenient way is offered by the Minibus-Service at very
reasonable price. They take you to any address in Budapest with their
comfortable 8-seaters, for 600 Hungarian forints (equivalent to 10 DM) per
person. The tickets are available at the LRI Airport passenger service
counters.
You can choose to use buses called "Centrum Airport Service" as well.
These buses leave every 30 minutes to Erzsebet square in central Budapest
for 200 forints (equivalent to 3,3 DM), from where you can take tram no. 49
or no. 47 to "Moricz Zsigmond korter", the nearest square to your
accommodation (Summer Hotel Hill, Menesi street 5), which is 5 minutes
walking from the tram station at Moricz Zsigmond korter. For use of trams
and buses, tickets must be purchased in advance, for 25 forints (0.5 DM)
each trip. One can buy tickets from automatons (there are some automatons
at the airport terminal bus stations) or from small shops selling newspaper
or tobacco.
Taxi from Ferihegy to central Budapest costs about 2000 forints (equivalent
to 33 DM). From Nyugati palyaudvar (Western Railway Station) you can reach
Moricz Zsigmond korter by tram no. 4 or no. 6. From Keleti palyaudvar
(Eastern Railway Station) to Moricz Zsigmond korter take bus no. 7 or no.
red 7, from Deli palyaudvar (Southern Railway Station) tram no. 61.
PAYMENT: Payment is expected in cash on the day of arrival in German
marks(DM).
ORGANIZING COMMITTEE:
Hajnal Andreka, Miklos Ferenczi, Istvan Nemeti and Ildiko Sain
ORGANIZING SECRETARY: Corinna Farkas
ADDRESSES: Please send your correspondence to BOTH of the following two
e-mail addresses: cora@ludens.elte.hu and h1468sai@ella.hu,
or to the following mailing address:
Ildiko Sain, Mathematical Institute, Budapest, Pf. 127, H-1364, Hungary.
Fax: (36-1) 117-7166 (indicate: To Ildiko Sain).
PLEASE, DISTRIBUTE THIS ANNOUNCEMENT FREELY.
Hoping to hear from you, best regards from the
organizers.
Date: Wed, 25 May 1994 13:49:19 +0500 (GMT+4:00)
Subject: new at file://triples.math.mcgill.ca/pub/otto/
Date: Tue, 24 May 1994 20:11:36 -0400
From: Jim Otto
New at
www
file://triples.math.mcgill.ca/pub/otto/home.html
ftp
triples.math.mcgill.ca /pub/otto
are
an introductory talk on complexity doctrines
some notes on dependent product diagrams
Regards, Jim Otto
otto@math.mcgill.ca
Date: Thu, 26 May 1994 16:39:57 +0500 (GMT+4:00)
Subject: Adresse
Date: Thu, 26 May 1994 15:57:41 +0200
From: "Dr. Reinhard Boerger (Prof. Dr. Pumpluen)"
Meine neue E-Mail-Adresse ist:/ Moje nova e-mailova adresa je:/
My new e-mail address is:
Boergermathe.fernuni-hagen.de
Bitte schicken Sie alle weiteren Nachrichten an diese Adresse./
Prosim, poslete vsechny dalsi zpravy do te adresy./ Please
send all further messages to this address.
Danke/Dekuji/Thanks
Reinhard Boerger
Reinhard
Reinhard Boerger
Da
Date: Tue, 31 May 1994 09:06:30 +0500 (GMT+4:00)
Subject: Reminder: LICS'94 Registration
Date: Mon, 30 May 94 19:31 EDT
From: Amy Felty
REMINDER: THE DEADLINE FOR LICS EARLY REGISTRATION IS JUNE 6.
LOGIC IN COMPUTER SCIENCE
********************************
Ninth Annual IEEE Symposium
July 3-7, 1994, Paris, France
NOTE: Advance payment for registration by credit card is not possible.
However, it is possible to pay by credit card or cash in French Francs
on location at CNAM. In order to get the early registration rate,
send the registration form so that it is received before June 6,
circle the reduced rate (and the banquet fee if you wish to attend the
banquet), and indicate that you will pay on site with cash or one of
the following authorized cards: Visa international, Eurocard,
MasterCard. If you choose to pay by this method and are subsequently
unable to attend, you are requested to send mail to symposia@inria.fr.
Other forms of payment (as stated in the brochure, but with some
clarification) are as follows. Payment must be in French currency.
1. Bank check (also called foreign draft in the US) or postal check
made payable to Agent Comptable de l'INRIA.
2. Bank transfer.
Beneficiary: Agent Comptable de l'INRIA
Bank Name: Tresorierie Generale des Yvelines
Bank Address: Versailles
Bank Code: 10071
Branch Code: 78000
Account Number: 00044009 15389
Specify your name and "Conference reference LICS94"
[Note that the account number as stated in the brochure is divided
into bank code, branch code, and account number here.]
3. Postal transfer to CCP Paris---30041-00001-09099 45 B 020-31.
4. Institutional Purchase Order.
[Complete program and registration information is available on the
world-wide web at
http://www.research.att.com/lics/
Postscript, dvi, latex and plain text versions of the conference
brochure are available via anonymous ftp from research.att.com in
directory /dist/lics.]
Date: Tue, 31 May 1994 16:56:09 +0500 (GMT+4:00)
Subject: Name change
Date: Tue, 31 May 94 10:31:02 BST
From: John Power
Dear Colleagues,
In the early 70's, Dana Scott founded the "Peripatetic
Seminar on Sheaves and Logic", and it has thrived. However, recently,
several new people in related areas, in particular Computer Science,
have been put off by the title: they say they know nothing about
sheaves, so assumed the seminar would not interest them.
So at the latest meeting, this weekend, we discussed a possible
name change (and implicitly a precise formulation of the subject of
the seminar). It was agreed to hold a competition for a new name. Dana
agreed to adjudicate, and is offering a bottle of Scotch to the winner:
he reserves the right to withdraw the offer if no entry impresses
him.
Evidently, a new name should reflect the interests of all
people we would like to attract, including sheaf theorists, but also
people in related parts of Computer Science and Physics.
Please send all entries to me; I will collate them, and forward
them to Dana. It would be best to have a decision before the next
seminar is announced, probably late in summer.
Best wishes,
John Power.