*mbx* 42cf5a7d00000000 1-Sep-2002 14:27:49 -0300,1121;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 01 Sep 2002 14:27:49 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17lYKW-0007ef-00 for categories-list@mta.ca; Sun, 01 Sep 2002 14:16:08 -0300 Date: Sun, 1 Sep 2002 14:14:47 -0300 (ADT) From: TAC To: categories@mta.ca Subject: categories: TACReprints #1: Metric spaces, generalized logic and closed categories Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk This is to announce the first in the TAC Reprints series: Metric spaces, generalized logic and closed categories F. W. Lawvere Originally published as: Rendiconti del Seminario Matematico e Fisico di Milano, , XLIII (1973), 135-166. Keywords: Metric spaces, enriched categories, logic 2000 MSC: 18D20 Republished in: Reprints in Theory and Applications of Categories, No. 1 (2002) pp 1-37 http://www.tac.mta.ca/tac/reprints/articles/1/tr1.pdf 5-Sep-2002 18:59:40 -0300,5020;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 05 Sep 2002 18:59:40 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17n4XA-0000hq-00 for categories-list@mta.ca; Thu, 05 Sep 2002 18:51:28 -0300 From: F.S.de.Boer@cwi.nl Date: Thu, 5 Sep 2002 17:32:11 +0200 Message-Id: <200209051532.g85FWB704797@basfluit.sen.cwi.nl> To: categories@mta.ca Subject: categories: NEW! FMCO: Symposium on Objects and Components Sender: cat-dist@mta.ca Precedence: bulk We apologize for the reception of multiple copies. **************************CALL FOR PARTICIPATION***************************= **** First International Symposium on FORMAL METHODS FOR OBJECTS AND COMPONENTS (FMCO 2002) http://fmco.liacs.nl/fmco02.html IMPORTANT DATES - The symposium will be held November 5-8, 2002. - Deadline for REGISTRATION is September 15, 2002 NOTE The deadline is APPROACHING!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! PLACE Leiden, The Netherlands INVITED SPEAKERS Tutorials Manfred Broy (Technical University of Munchen) Werner Damm (University of Oldenburg) David Harel (The Weizmann Institute of Science) Bertrand Meyer (ETH Zurich and ISE) Perdita Stevens (Edinburgh University) Clemens Szyperski (Microsoft Research) Jos Warmer (Klasse Objecten) Technical presentations Erika Abraham-Mumm (CAU) Farhad Arbab (CWI) David Garlan (Carnegie Mellon University) John Hatcliff (Kansas State University) Jozef Hooman (University of Nijmegen) Bart Jacobs (University of Nijmegen) Paul Klint (CWI) Leslie Lamport (Microsoft Research) Gary Leavens (Iowa State University) Rustan Leino (Microsoft Research) Ugo Montanari (Pisa University) Oscar Nierstrasz (University of Berne) Ernst-Ruediger Olderog (University of Oldenburg) Amir Pnueli (The Weizmann Institute of Science) Bernhard Rumpe (Technical University of Munchen) Emil Sekerinski (McMaster University) Kaisa Sere (=C5bo University) Joseph Sifakis (Verimag) Martin Wirsing (Ludwig-Maximilians-Universit=E4t M=FCnchen) THEME Large and complex software systems provide the necessary infrastucture in all industries today. In order to construct such large systems in a systematic manner, the focus in the development methodologies has switched in the last two decades from functional issues to structural issues: both data and functions are encapsulated into software units which are integrated into large systems by means of various techniques supporting reusability and modifiability. This encapsulation principle is essential to both the object-oriented and the more recent component-based sofware engineering paradigms. Formal methods have been applied successfully to the verification of medium-sized programs in protocol and hardware design. However, their application to the development of large systems requires more emphasis on specification, modeling and validation techniques supporting the concepts of reusability and modifiability, and their implementation in new extensions of existing programming languages like Java. The objective of this symposium is to bring together researchers and practioners in the areas of software engineering and formal methods to discuss the concepts of reusability and modifiability in component-based and object-oriented software systems. The following issues related to modifiability and reusability in components and objects will be discussed by leading experts in the fields of Formal Methods and Software Engineering: - Specification - Verification - Validation - Modeling techniques - Architectures - Programming languages - Semantics - Type theory - Design methodology - Compositionality - Refinement - Theorem-proving - Model checking - Tools FORMAT The Symposium is a four days event in the style of the former REX workshops, organized to provide an atmosphere that fosters collaborative work, discussions and interaction. Lectures are given by the invited speakers listed above. Participation is limited to about 80 people. The program consists of invited tutorials and more technical presentations, and contains an exquisite social event. Both tutorial and technical contributions will be published after the workshop in a proceedings of Lecture Notes in Computer Science by Springer-Verlag. ORGANISING COMMITTEE F.S. de Boer (CWI) M.M. Bonsangue (LIACS-Leiden University) S. Graf (Verimag) W.-P. de Roever (CAU) *****************************PARTICIPATION*********************************= ** For more information about participation and registration see the FMCO site http://fmco.liacs.nl/fmco02.html For further information consult F.S. de Boer (frb@cwi.nl) or M.M. Bonsangue (marcello@liacs.nl). 5-Sep-2002 19:01:06 -0300,1494;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 05 Sep 2002 19:01:06 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17n4ch-0000tI-00 for categories-list@mta.ca; Thu, 05 Sep 2002 18:57:11 -0300 Date: Wed, 04 Sep 2002 17:04:16 +1000 Subject: categories: preprint: Computads and slices of operads From: Michael Batanin To: Message-ID: Mime-version: 1.0 Content-type: text/plain; charset="US-ASCII" Content-transfer-encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Dear colleagues, my new preprint is now available in Category Theory section http://au.arxiv.org/abs/math.CT/0209035 You also can download it from my home page http://www.math.mq.edu.au/~mbatanin/papers.html Below is the abstract ------------------------------------- \\ Paper: math.CT/0209035 From: Michael A.Batanin Date: Wed, 4 Sep 2002 06:42:32 GMT (14kb) Title: Computads and slices of operads Authors: M.A.Batanin Comments: 18 pages Subj-class: Category Theory MSC-class: 18C20, 18D05 \\ For a given $\omega$-operad $A$ on globular sets we introduce a sequence of symmetric operads on $Set$ called slices of $A$ and show how the connected limit preserving properties of slices are related to the property of the category of $n$-computads of $A$ being a presheaf topos. \\ 5-Sep-2002 19:01:21 -0300,1070;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 05 Sep 2002 19:01:21 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17n4fL-00013b-00 for categories-list@mta.ca; Thu, 05 Sep 2002 18:59:55 -0300 Message-ID: <20020905192956.70142.qmail@web12206.mail.yahoo.com> Date: Thu, 5 Sep 2002 12:29:56 -0700 (PDT) From: Galchin Vasili Subject: categories: Topos question To: categories@mta.ca MIME-Version: 1.0 Sender: cat-dist@mta.ca Precedence: bulk Hello CT Community, I am continuing my study of topoi by reading Goldblatt. In an arbitrary topos E, can we demonstrate that Hom (1, omega) contains any arrows/morphisms other than "true"? I suspect the answer is yes because Hom (1, omega) is a Heyting algebra. Hence, it must have a least element ("true" is the greatest element). I just don't know how to to prove that Hom (1, omega) contains more elements than "true". Can somebody point me in the right direction? Thank you, Bill Halchin 6-Sep-2002 16:37:05 -0300,1780;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 06 Sep 2002 16:37:05 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nOpD-0003FA-00 for categories-list@mta.ca; Fri, 06 Sep 2002 16:31:27 -0300 Date: Fri, 6 Sep 2002 09:13:35 +0100 (BST) From: "Dr. P.T. Johnstone" To: categories@mta.ca Subject: categories: Re: Topos question In-Reply-To: <20020905192956.70142.qmail@web12206.mail.yahoo.com> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Scanner: exiscan for exim4 (http://duncanthrax.net/exiscan/) *17nEFE-0002Pl-00*ygCYPZqySBI* Sender: cat-dist@mta.ca Precedence: bulk On Thu, 5 Sep 2002, Galchin Vasili wrote: > Hello CT Community, > > I am continuing my study of topoi by reading Goldblatt. In an > arbitrary topos E, can we demonstrate that Hom (1, omega) contains any > arrows/morphisms other than "true"? I suspect the answer is yes because > Hom (1, omega) is a Heyting algebra. Hence, it must have a least element > ("true" is the greatest element). I just don't know how to to prove that > Hom (1, omega) contains more elements than "true". > That's because it can't be proved: the topos axioms allow the possibility of degeneracy. The category with one object and one morphism is a topos; in it, \Omega = 1 and \top is the only morphism 1 --> \Omega. If you add the requirement that the topos should be non-degenerate (i.e., not equivalent to this example), then \top is not equal to \bot; indeed, this inequality is the easiest way of expressing the condition that a topos is non-degenerate. Peter Johnstone 6-Sep-2002 16:37:05 -0300,1858;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 06 Sep 2002 16:37:05 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nOmJ-00031Y-00 for categories-list@mta.ca; Fri, 06 Sep 2002 16:28:27 -0300 Date: Fri, 6 Sep 2002 07:43:01 -0700 From: Toby Bartels To: categories@mta.ca Subject: categories: Re: Topos question Message-ID: <20020906144301.GA13417@math-cl-n01.ucr.edu> References: <20020905192956.70142.qmail@web12206.mail.yahoo.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii In-Reply-To: <20020905192956.70142.qmail@web12206.mail.yahoo.com> Sender: cat-dist@mta.ca Precedence: bulk Galchin Vasili wrote: > I am continuing my study of topoi by reading Goldblatt. In an >arbitrary topos E, can we demonstrate that Hom (1, omega) contains any >arrows/morphisms other than "true"? I suspect the answer is yes because >Hom (1, omega) is a Heyting algebra. Hence, it must have a least element >("true" is the greatest element). I just don't know how to to prove that >Hom (1, omega) contains more elements than "true". The element true of Hom(1,Omega) corresponds to the subobject id: 1 -> 1 of 1. To get another subobject of 1, use the unique arrow 0 -> 1; the corresponding element of Hom(1,Omega) is false. However, it's still possible that true = false, in which case true is the only element of Hom(1,Omega). This is a particularly degenerate case, but the definition of a topos doesn't rule it out. The trivial category (one object and one morphism) is an example of such a degenerate topos. You can even prove the converse. If true = false, then 0 = 1, so x = x^1 = x^0 = 1. Here "=" means a unique isomorphism, so the topos is equivalent to the trivial category. -- Toby 6-Sep-2002 16:37:13 -0300,1849;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 06 Sep 2002 16:37:13 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nOpg-0003Hj-00 for categories-list@mta.ca; Fri, 06 Sep 2002 16:31:56 -0300 Message-ID: From: S.J.Vickers@open.ac.uk To: categories@mta.ca Subject: categories: RE: Topos question Date: Fri, 6 Sep 2002 09:38:03 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: cat-dist@mta.ca Precedence: bulk > I am continuing my study of topoi by reading Goldblatt. In an > arbitrary topos E, can we demonstrate that Hom (1, omega) contains any > arrows/morphisms other than "true"? I suspect the answer is yes because .... Dear Bill, The answer is probably in Goldblatt anyway, but the key to it is to realise that morphisms from 1 to Omega are equivalent to subobjects of 1 (i.e., set theoretically, to subsets of a singleton set). Just from your understanding of sets, you should quickly be able to think of two subobjects. It is not difficult to express them in the topos abstraction. There remains the question of whether those subobjects are distinct. There is in fact a topos in which they are the same, but that is pathological behaviour - it is the categorical embodiment of an inconsistent set theory in which true <=> false and 1 = 0. There is (up to equivalence) only one such topos. "The right direction" that you ask for is really to be guided by your set theoretic instincts. You will discover on the way that you need to beware of certain non-constructive aspects of classical mathematics, principally excluded middle and the axiom of choice. Steve Vickers. 6-Sep-2002 17:23:13 -0300,2667;000000000000-00000000 Return-path: <-Y@eastham.sci.brooklyn.cuny.edu> Envelope-to: cat-dist@mta.ca Delivery-date: Fri, 06 Sep 2002 17:23:13 -0300 Received: from jackal.mta.ca ([138.73.1.6]) by mailserv.mta.ca with esmtp (Exim 3.36 #6) id 17nPdJ-0006Jp-00 for cat-dist@mta.ca; Fri, 06 Sep 2002 17:23:13 -0300 Received: from zent.mta.ca ([138.73.1.15]) by jackal.mta.ca with smtp (Exim 4.10) id 17nPdJ-0004PI-00 for cat-dist@mta.ca; Fri, 06 Sep 2002 17:23:13 -0300 Received: FROM eastham.sci.brooklyn.cuny.edu BY zent.mta.ca ; Fri Sep 06 17:20:16 2002 -0300 Received: (from root@localhost) by eastham.sci.brooklyn.cuny.edu (8.12.1/8.11.4) id g86KLAen002036 for ; Fri, 6 Sep 2002 16:21:10 -0400 (EDT) Received: from mailserv.mta.ca (mailserv.mta.ca [138.73.1.1]) by eastham.sci.brooklyn.cuny.edu (8.12.1/8.12.1) with ESMTP id g86KL3ao001988 for ; Fri, 6 Sep 2002 16:21:03 -0400 (EDT) Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nOpD-0003FA-00 for categories-list@mta.ca; Fri, 06 Sep 2002 16:31:27 -0300 Date: Fri, 6 Sep 2002 09:13:35 +0100 (BST) From: "Dr. P.T. Johnstone" To: categories@mta.ca Subject: categories: Re: Topos question In-Reply-To: <20020905192956.70142.qmail@web12206.mail.yahoo.com> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Scanner: exiscan for exim4 (http://duncanthrax.net/exiscan/) *17nEFE-0002Pl-00*ygCYPZqySBI* Sender: cat-dist@mta.ca Precedence: bulk X-AntiVirus: scanned for viruses by AMaViS 0.2.1 (http://amavis.org/) On Thu, 5 Sep 2002, Galchin Vasili wrote: > Hello CT Community, > > I am continuing my study of topoi by reading Goldblatt. In an > arbitrary topos E, can we demonstrate that Hom (1, omega) contains any > arrows/morphisms other than "true"? I suspect the answer is yes because > Hom (1, omega) is a Heyting algebra. Hence, it must have a least element > ("true" is the greatest element). I just don't know how to to prove that > Hom (1, omega) contains more elements than "true". > That's because it can't be proved: the topos axioms allow the possibility of degeneracy. The category with one object and one morphism is a topos; in it, \Omega = 1 and \top is the only morphism 1 --> \Omega. If you add the requirement that the topos should be non-degenerate (i.e., not equivalent to this example), then \top is not equal to \bot; indeed, this inequality is the easiest way of expressing the condition that a topos is non-degenerate. Peter Johnstone 6-Sep-2002 17:27:20 -0300,2736;000000000000-00000000 Return-path: <-Y@eastham.sci.brooklyn.cuny.edu> Envelope-to: cat-dist@mta.ca Delivery-date: Fri, 06 Sep 2002 17:27:20 -0300 Received: from jackal.mta.ca ([138.73.1.6]) by mailserv.mta.ca with esmtp (Exim 3.36 #6) id 17nPhI-0006Sb-00 for cat-dist@mta.ca; Fri, 06 Sep 2002 17:27:20 -0300 Received: from zent.mta.ca ([138.73.1.15]) by jackal.mta.ca with smtp (Exim 4.10) id 17nPhI-0004Sz-00 for cat-dist@mta.ca; Fri, 06 Sep 2002 17:27:20 -0300 Received: FROM eastham.sci.brooklyn.cuny.edu BY zent.mta.ca ; Fri Sep 06 17:24:23 2002 -0300 Received: (from root@localhost) by eastham.sci.brooklyn.cuny.edu (8.12.1/8.11.4) id g86KPJcX002432 for ; Fri, 6 Sep 2002 16:25:19 -0400 (EDT) Received: from mailserv.mta.ca (mailserv.mta.ca [138.73.1.1]) by eastham.sci.brooklyn.cuny.edu (8.12.1/8.12.1) with ESMTP id g86KP6ao002380 for ; Fri, 6 Sep 2002 16:25:07 -0400 (EDT) Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nOpg-0003Hj-00 for categories-list@mta.ca; Fri, 06 Sep 2002 16:31:56 -0300 Message-ID: From: S.J.Vickers@open.ac.uk To: categories@mta.ca Subject: categories: RE: Topos question Date: Fri, 6 Sep 2002 09:38:03 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: cat-dist@mta.ca Precedence: bulk X-AntiVirus: scanned for viruses by AMaViS 0.2.1 (http://amavis.org/) > I am continuing my study of topoi by reading Goldblatt. In an > arbitrary topos E, can we demonstrate that Hom (1, omega) contains any > arrows/morphisms other than "true"? I suspect the answer is yes because .... Dear Bill, The answer is probably in Goldblatt anyway, but the key to it is to realise that morphisms from 1 to Omega are equivalent to subobjects of 1 (i.e., set theoretically, to subsets of a singleton set). Just from your understanding of sets, you should quickly be able to think of two subobjects. It is not difficult to express them in the topos abstraction. There remains the question of whether those subobjects are distinct. There is in fact a topos in which they are the same, but that is pathological behaviour - it is the categorical embodiment of an inconsistent set theory in which true <=> false and 1 = 0. There is (up to equivalence) only one such topos. "The right direction" that you ask for is really to be guided by your set theoretic instincts. You will discover on the way that you need to beware of certain non-constructive aspects of classical mathematics, principally excluded middle and the axiom of choice. Steve Vickers. 7-Sep-2002 16:17:24 -0300,3063;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 07 Sep 2002 16:17:24 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17nkqt-0006Fp-00 for categories-list@mta.ca; Sat, 07 Sep 2002 16:02:39 -0300 From: J=FCrgen Koslowski Message-Id: <200209071752.g87Hqrr13022@lxt5.iti.cs.tu-bs.de> Subject: categories: PSSL 77, 2nd and final announcement To: categories@mta.ca (categories list) Date: Sat, 7 Sep 2002 19:52:52 +0200 (CEST) X-Mailer: ELM [version 2.5 PL6] MIME-Version: 1.0 Content-Type: text/plain; charset=3Dus-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk PERIPATETIC SEMINAR ON SHEAVES AND LOGIC 77th meeting - second and final announcement http://www.iti.cs.tu-bs.de/TI-INFO/koslowj/PSSL77.html News since the first announcement: Visitors from foreign countries who intend to arrive early should note that Thursday, October 3, is a holiday in Germany. The situation concerning accommodation seems to be less problematic than I made it sound in some postings about a month ago. This was due to my (then) imminent departure for CTCS. Please don't hesitate to visit us in Braunschweig on account of that premature alarm! Reminder of the first announcement: The 77th meeting of the seminar will be held at the Department of Theoretical Computer Science of the Technical University in Braunschweig, Germany, over the weekend of October 5/6, 2002. As usual, the seminar welcomes talks using or addressing category theory or logic, either explicitly or implicitly, in the study of any aspect of mathematics, computer science or science in general. Braunschweig is located about 60 km East of Hannover and can easily be reached by car or train. The closest airport is in Hannover. Since Expo 2000, there is a fast train connection from that airport to the Hannover main train station. Trains to Braunschweig leave at least once every hour and take about 40 minutes or less. For train travel within Germany and from neighboring countries you also may consult =09http://reiseauskunft.bahn.de/bin/query.exe/e Your destination should be entered as "Braunschweig Hbf". We will send further information on the location of the seminar, along with details on local travel and accommodation to those who register, at least a week before the meeting. Electronic registration is available on the Conference Page =09http://www.iti.cs.tu-bs.de/TI-INFO/koslowj/PSSL77.html. We are looking forward to welcoming you to our new quarters in the Informatikzentrum of the Technical University of Braunschweig! Jiri Adamek Juergen Koslowski Stefan Milius Jiri Velebil --=20 Juergen Koslowski If I don't see you no more on this world ITI, TU Braunschweig I'll meet you on the next one koslowj@iti.cs.tu-bs.de and don't be late! http://www.iti.cs.tu-bs.de/~koslowj Jimi Hendrix (Voodoo Child, SR) 8-Sep-2002 09:54:47 -0300,3792;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 08 Sep 2002 09:54:47 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17o1Mv-0005tJ-00 for categories-list@mta.ca; Sun, 08 Sep 2002 09:40:49 -0300 Date: Sat, 7 Sep 2002 22:10:29 -0700 From: Vaughan Pratt Message-Id: <200209080510.WAA03251@coraki.Stanford.EDU> To: categories@mta.ca Subject: categories: Presheaves etc. in a uniform way Sender: cat-dist@mta.ca Precedence: bulk Presheaves etc. in a uniform way Set^C is normally produced directly from the small category C and the category Set as a functor category. Likewise Chu(Set,\Sigma) is produced from the set \Sigma and the category Set via the Chu construction. We give here a uniform way of producing all presheaf categories at once, or all Chu(Set,-) categories at once, without taking any of Set, C, or \Sigma as explicit parameters. This generalizes my note "Chu(Set,K) without sets" of a week ago, in the process answering and extending question (iii) of http://boole.stanford.edu/pub/couple.pdf Let G,K be two sets (of object symbols). Define a GK-category (C,g,k) to consist of a locally small category C and a pair of maps g:G->ob(C), k:K->ob(C) (interpreting object symbols as objects of C). Define a GK-functor F:(C,g,k)->(C',g',k') to be a functor F:C->C' between GK-categories satisfying Fg=g', Fk=k' and fully faithful on homsets from im(g) and homsets to im(k). Write GK-CAT for the 2-category of GK-categories and GK-functors. (GK-Cat is the same with every C small rather than merely locally small.) Associate to each (C,g,k) the full subcategories \G, \K of C having as objects those of im(g), im(k) respectively, together with a GxK matrix Q of cardinals giving the cardinality |C(g(i),k(j))| for i,j in G,K. These associated entities are all preserved up to isomorphism by GK-functors. GK-CAT thus partitions as a sum of connected components over all isomorphism classes of categories \G and \K with respectively |G| and |K| objects, and all GxK matrices of cardinals. It is a straightforward exercise to show that each such connected component of GK-CAT has a 2-final object, which we may call the locally 2-final objects of GK-CAT. These objects are equivalent to the following under the stated conditions. Set |G| = 1, |K| = 0, \G = 1 (the one-morphism category) Set\op |G| = 0, |K| = 1, \K = 1 Set x Set\op |G| = 1, |K| = 1, \G = 1, \K = 1, Q[0,0] = 1 Set^{M\op} (M-sets) |G| = 1, |K| = 0, M = \G (as a one-object category) (Set^M)\op |G| = 0, |K| = 1, M = \K Set^{C\op} (presheaves) |K| = 0, C = \G All presheaf categories |K| = 0 (Set^D)\op (dual preshvs) |G| = 0, D = \K Set^{C\op}x(Set^D)\op C = \G, D = \K, Q[i,j] = 1, i,j in G,K Chu(Set,\Sigma) |G| = |K| = 1, \G = \K = 1, Q[0,0] = \Sigma All Chu(Set,-) categories |G| = |K| = 1, \G = \K = 1 "Presheaf Chu" No restrictions The difference between Set^{C\op} x (Set^D)\op and Presheaf Chu is that the restriction Q[i,j] = 1 (meaning that homsets from im(g) to im(k) have exactly one morphism) of the former nullifies the effect of the Chu matrices (one matrix for the ordinary Chu construction). When this restriction is dropped the notion of continuity enters, with ordinary topological continuity at Q[0,0] = 2 and more general Chu continuity obtaining for larger cardinals in Q. It is plausible that a necessary and sufficient condition for a presheaf-Chu category to be *-autonomous is for \G and \K to be isomorphic, as a generalization of \G = \K = 1. Vaughan Pratt 9-Sep-2002 08:33:31 -0300,1112;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 09 Sep 2002 08:33:31 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17oMaW-0001Ad-00 for categories-list@mta.ca; Mon, 09 Sep 2002 08:20:16 -0300 Message-Id: <200209081433.HAA10272@coraki.Stanford.EDU> X-Mailer: exmh version 2.1.1 10/15/1999 To: categories@mta.ca Subject: Re: categories: Presheaves etc. in a uniform way Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Sun, 08 Sep 2002 07:33:03 -0700 From: Vaughan Pratt Sender: cat-dist@mta.ca Precedence: bulk That should have been "up to equivalence." I was forgetting that g and k need not be monic. Vaughan Pratt >Associate to each (C,g,k) the full subcategories \G, \K of C having as objects >those of im(g), im(k) respectively, together with a GxK matrix Q of cardinals >giving the cardinality |C(g(i),k(j))| for i,j in G,K. These associated >entities are all preserved up to isomorphism by GK-functors. ^^^^^^^^^^^^^^^^^ 9-Sep-2002 19:35:41 -0300,1814;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 09 Sep 2002 19:35:41 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17oX4W-0004OG-00 for categories-list@mta.ca; Mon, 09 Sep 2002 19:31:56 -0300 Message-ID: <3D775ADD0019630C@mel-rta7.wanadoo.fr> (added by postmaster@wanadoo.fr) X-Mailer: Microsoft Outlook Express for Macintosh - 4.0c (197) Date: Mon, 09 Sep 2002 08:22:23 +0100 Subject: categories: Journee math. A. Burroni From: "Rene Guitart" To: Mime-version: 1.0 X-Priority: 3 Sender: cat-dist@mta.ca Precedence: bulk Journee Mathematique en l'honneur d'Albert Burroni : Categories, theories algebriques et informatique Vendredi 20 septembre 2002 Universite Paris VII, Salle 0C02, 175, rue du Chevaleret, 75013 09h10. Accueil. 09h30-10h15. Pierre Ageron, Albert Burroni dans l'ecole d'Ehresmann : constructivisme et structuralisme. 10h15-11h. Yves Lafont, Theorie algebrique des circuits. 11h20-12h05. Jacques Penon, T-categories representables. 12h05-12h50. Elisabeth Burroni, Lois distributives. Application aux automates stochastiques. 14h15-15h. Martin Hyland, Generalized algebra : variations on ideas of Burroni. 15h-15h45. Vincent Danos, Rigueur et brutalite en mathematique : la part du calcul. 16h05-16h50. Georges Maltsiniotis, Homotopie et categories. 16h50-17h35. Rene Guitart, Toute theorie est algebrique. 18h. Pot, avec en entree : Rene Cori, " Stupeur sacree ! la preuve se fait par les abimes." Equipes de Topologie et geometrie Algebrique (UMR 7586), et de Preuves Programmes Systemes (UMR 7126) Renseignements aupres de Rene Guitart (guitart@math.jussieu.fr) 9-Sep-2002 19:57:29 -0300,1519;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 09 Sep 2002 19:57:29 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17oXRD-0005Xd-00 for categories-list@mta.ca; Mon, 09 Sep 2002 19:55:23 -0300 Date: Mon, 9 Sep 2002 13:09:46 +0200 (CEST) From: "I. Moerdijk" Reply-To: "I. Moerdijk" Subject: categories: postdoc at Utrecht To: rrosebru@mta.ca MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Sender: cat-dist@mta.ca Precedence: bulk Message-Id: subject: postdoc at Utrecht body: Postdoc position available Dear category theorists, At Utrecht we have a postdoctoral research position availabe in the domain of categorical logic. The position is for three years and should start January 1, 2003, or soon thereafter. The position is funded by NWO, and is tied to a specific research project, which concerns (a combination of some of) the key words topos theory, realisability, categorical semantics of predicative theories, Martin-Loef type theories, Constructive Set Theory. Candidates should have a PhD degree and some research experience in at least one of these topics. If you are interested, please send an e-mail to one of us before October 31, together with a CV (or better, an address where we download one). Ieke Moerdijk (moerdijk@math.uu.nl) Jaap van Oosten (jvoosten@maath.uu.nl) 10-Sep-2002 21:31:07 -0300,3114;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 10 Sep 2002 21:31:07 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17ovCI-0003pY-00 for categories-list@mta.ca; Tue, 10 Sep 2002 21:17:34 -0300 Message-Id: <200209101321.g8ADLX208682@sapin.irit.fr> Date: Tue, 10 Sep 2002 15:21:33 +0200 (MET DST) From: Sergei SOLOVIEV Reply-To: Sergei SOLOVIEV Subject: categories: workshop on isomorphism of types (last call) To: categories@mta.ca MIME-Version: 1.0 Content-Type: TEXT/plain; charset=ISO-8859-1 Content-Transfer-Encoding: QUOTED-PRINTABLE Content-MD5: ZPjVLA54PG3mewytfCPreg== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.5 SunOS 5.7 sun4m sparc Sender: cat-dist@mta.ca Precedence: bulk =09 *** WIT 2002 *** First International Workshop on Isomorphisms of Types IRIT, Toulouse (France) 8-9 November 2002 =20 Web page: http://www.irit.fr/zeno/WIT2002 *** LAST CALL FOR PARTICIPATION *** The study of isomorphic types is connected to type theory, number theory, category theory and lambda calculus, and it has various applications to information retrieval systems, automatic adaptor code generation, subtyping, and the like. This workshop aims to bring together researchers working on these subjects, to assess the current state of the art and identify open problems and future research directions. There will be space for talks presenting original work, work in progress, survey of previous works, but we will also provide sufficient time for discussions. Details on paper submission will be given in a further announcement. Papers presented at the workshop will be published on the web site of the workshop and may be selected for submission, in complete and revised form, to a special issue of an=20 international journal, in case their number and quality=20 justify it. The workshop is supported by STIC/CNRS (project ISOT) and IRIT/Universit=E9 Paul Sabatier. Limited funds for travel and/or accomodation are available. Submission (extended deadline): send either a full paper or an extended abstract by e-mail to soloviev@irit.fr by September 30th 2002 Important dates: September 30th: deadline for abstract submission October 15th: notification of acceptance October 28th: final/full version due Organising/program committee: R. Di Cosmo (Paris-VII and INRIA Rocquencourt, France) G. Longo (ENS, Paris, France) S. Soloviev (IRIT, Toulouse, France) Local organisation: D. Chemouil L. M=E9hats Contact: Sergei Soloviev IRIT Universit=E9 Paul Sabatier 118, route de Narbonne, 31062 Toulouse France E-mail: soloviev@irit.fr Tel: (+33) 5 61 55 62 55 Fax: (+33) 5 61 55 62 58 --=20 David Chemouil mailto:chemouil@irit.fr Zeno group http://www.irit.fr/~David.Chemouil Institut de recherche en informatique de Toulouse 13-Sep-2002 12:52:07 -0300,978;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 13 Sep 2002 12:52:07 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17psYc-0007lM-00 for categories-list@mta.ca; Fri, 13 Sep 2002 12:40:34 -0300 Message-ID: From: S.J.Vickers@open.ac.uk To: categories@mta.ca Subject: categories: RE: Coproduct of distributive lattices Date: Fri, 13 Sep 2002 11:58:31 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: cat-dist@mta.ca Precedence: bulk > I have a concrete construction of the coproduct of > distributive lattices and wondered if it was already known. I've now found it's in - "The semilattice tensor product of distributive lattices" Grant A. Fraser Transactions of the American Mathematical Society vol. 217 (1976) pp. 183-194 Steve. 13-Sep-2002 12:52:07 -0300,2275;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 13 Sep 2002 12:52:07 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17psXk-0007iF-00 for categories-list@mta.ca; Fri, 13 Sep 2002 12:39:41 -0300 From: S.J.Vickers@open.ac.uk To: categories@mta.ca Subject: categories: Coproduct of distributive lattices Date: Fri, 13 Sep 2002 11:19:46 +0100 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Sender: cat-dist@mta.ca Precedence: bulk Message-Id: I have a concrete construction of the coproduct of distributive lattices and wondered if it was already known. Let A and B be distributive lattices. It is reasonably clear that their coproduct can be constructed as a tensor product with respect to their join-semilattice structure, using the notion of join-bilinear map. Even if this is not already known, it is an obvious application of the methods commonly used in the infinitary case for frames and suplattices. My concrete construction amounts to a description of when \/_i (a_i tensor b_i) <= \/_j (a'_j tensor b'_j) (*) I have shown that a necessary and sufficient condition for (*) is as follows. Let the j's range from 1 to n (we can assume wlog that the finite indexing set is a finite cardinal) and let D_n be the free distributive lattice on n generators. Let ~: D_n -> D_n be the operation that interchanges meets and joins (i.e. the lattice homomorphism from D_n to (D_n)^op that is the identity on generators). Then (*) holds iff for each i there is some phi_i in D_n such that a_i <= phi_i(a') b_i <= ~phi_i(b') (The appearance of ~ reflects the kind of topological argument about product spaces where unions in one component are balanced by intersections in the other.) Hence the coproduct of A and B is the set of formal expressions \/_i (a_i tensor b_i) (essentially, lists of elements of AxB) modulo the preorder <= as just defined. Steve Vickers Department of Pure Maths Faculty of Maths and Computing The Open University ----------- Tel: 01908-653144 Fax: 01908-652140 Web: http://mcs.open.ac.uk/sjv22 15-Sep-2002 15:19:44 -0300,2063;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 15 Sep 2002 15:19:44 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qdtY-0003YG-00 for categories-list@mta.ca; Sun, 15 Sep 2002 15:13:20 -0300 Date: Fri, 13 Sep 2002 15:46:48 +0200 From: Claire Gardent To: Claire Gardent Subject: categories: CFP -- EACL'03, Budapest Message-ID: <20020913134648.GA24883@doms.loria.fr> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.4i Sender: cat-dist@mta.ca Precedence: bulk * CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** EACL 2003 11th Conference of the European Chapter of the Association for Computational Linguistics April 12-17, 2003 Budapest, Hungary EACL03 invites submissions as follows: Main conference papers Registration deadline: 10 November Submission deadline: 15 November Research notes and Demos Registration deadline: 01 December Submission deadline: 06 December Student workshop Deadline: 15 November Tutorials Deadline: 15 November Workshops Deadline: 01 October *** FURTHER INFORMATION **** EACL03: http://www.conferences.hu/EACL03/ EACL: http://www.eacl.org EACL03 Student Workshop http://www.coli.uni-sb.de/conf/eacl03-student/ *** ORGANISATION **** Programme Co-Chairs Ann Copestake (United Kingdom) Jan Hajic (Czech Republic) Research notes and Demos Chair Alberto Lavelli (Italy) Tutorial Chair Dan Cristea (Romania) Publication Chair Patrick Paroubek (France) Workshop Chair Steven Krauwer (The Netherlands) Student workshop Chair EACL Student Board (M. Gabsdil, J. Hockenmaier, J. Herring) Local Organisation Chair: Ferenc Kiefer (Hungary) * CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** CFP ** 16-Sep-2002 17:03:11 -0300,785;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 17:03:11 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17r1xQ-0006Po-00 for categories-list@mta.ca; Mon, 16 Sep 2002 16:54:56 -0300 To: categories@mta.ca Subject: categories: Braided Monoidal Categories X-Mailer: mh-e 6.1; nmh 1.0.4+dev; Emacs 21.4 Date: Mon, 16 Sep 2002 15:59:51 +0100 From: N Ghani Message-Id: Sender: cat-dist@mta.ca Precedence: bulk For some rather obscure reason, I'd like to read about braided monoidal categories and, in particular, their associated coherence problems. Can someone provide me with a reference or two please? Yours, Neil 16-Sep-2002 17:03:11 -0300,10228;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 17:03:11 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17r1yf-0006V5-00 for categories-list@mta.ca; Mon, 16 Sep 2002 16:56:13 -0300 Date: Mon, 16 Sep 2002 12:03:16 -0400 (EDT) From: Peter Freyd Message-Id: <200209161603.g8GG3G5e005437@saul.cis.upenn.edu> To: categories@mta.ca Subject: categories: mysterious passage Sender: cat-dist@mta.ca Precedence: bulk Bill Halchin asks about some lines that refer to category theory in the document below, to wit: "What is this trying to say?" Beats me. I thought the original document might help. Well, here it is. Anyone know who the author is? http://www.asrios.ge/maincentreprojectsoverview_800.htm [last modified on August 11, 2002] FORMATION AND MANAGEMENT OF THE INFORMATIONAL LEGISLATIVE SPACE OF GEORGIA The program goal is the formation of integrated self-organizing, stable system of State Administration based on the informative- telecommunicative space, that ensure transparency, completeness and actualization of information and creation of favorable conditions for modeling certain cases, decision making, implementation and control. The principle objects of State Administration Structures are: . to promote more transparent standardized forms; to promote the efficient implementation of the basic and additional Government functions; to ensure the transparency of the activities of governmental and self-governmental institutions; to promote transformation of different forms from quantitative state into the qualitative one; to promote anti-corruption activities and protection of human rights and freedom; to reflect principles of evolution trends and state development The program goals are: to work out the modern model of State Administration Structures formation; to introduce the necessities and prospects of forming modern State Administration System; to work out basic criteria defining State Administration Structures; to introduce tasks and principles concerning formalization of State Administration Structures; to work out basic demands addressing perspective State Administration System; to show the influence of new informational technologies on formation of modern State Administration Structures. to work out basic principles of evolutionary transition to modern State Administration Structure. THEORETICAL APPROACH TO THE FORMATION OF PROGRESSIVE STATE ADMINISTRATION STRUCTURES State Administration System is a sole mechanism of raising problems, making decisions, implementing and controlling activities, that is decomposed in a hierarchical order and is reflected on the executive structures. Global economic, communicative and other correlation determine the integration process. State Administration Structure is one of the main components of this process. State Administration Structures, with their broad variety and conservatism have a negative impact on the integration process. Conceptual integration processes can not progress without united administration norms. Creation of perspective State Administration Structures is especially substantial for the countries building up a democratic society, where an intensive transformation process is in the initial stage and transition from one structure to another is possible. Modern world should be involved in unification and standardization processes of State Administration Structures, based on new scientific and technological approach. RESEARCH ON THE FORMATION OF UNIFIED DYNAMIC DATABASE STRUCTURE BASED ON MATHEMATICAL MODELS The program goal is development of methodology of construction of information complexes on the basis of their unification. Creation of dynamic information systems mechanisms of the account of functions, planning, management and performance of actions are the aspects of the methodology. Research works are carried out in the fields of unification of the elaboration of the structures of databases. Research topics include application of 'categorial' structure of database based on various mathematical models and theories, that gives possibility to conduct development of dynamic database structure based on Categorial Analysis, Petri Nets, Mathematical Lattice etc. One of the key tasks is to formulate and present the different applied fields, and more precisely the inter-correlation between them. General overview on research activities in carrying out mathematical structures in computer science: The category theory may become the core part of the mathematical instrument for the conceptual systems development. The system can be presented as a category in which the relative correlation exists among the objects (morphisms). Each system must be presented both on generalized and concrete reflection levels. The generalized level (upper level) and each of the concrete reflection levels are categories. Hence, it should be considered the process of reflection between general and concrete levels (functors). Each objects of the category system can be a system by itself (category). Consequently we have to consider lattice dependence of categories both on the generalized level and as well as on the decomposition of the objects. Each system changes in time. So it should be considered problems related to the dynamics of categories. Complex consideration and decisions of the above-stated and other related problems should ensure the formation of the mathematical base. This will enable to consider the creation of dynamic, unified distributed databases that can be used in various applied fields. TRAINING SYSTEM "INCREASING EFFICIENCY OF ORGANIZATIONS" The civil world went through the hard way of the formation of governmental, social and commercial organizations, and examined and worked out effective methodologies for functions of various organizational structures. Organization is a system consisting of interrelated components, which have definite properties, conditions of existence and functioning, integrity of management and the rules of activities. Simplicity, convenience, clearness, efficiency, controllability, guarantee and other quantitative indices should characterize the functioning of modern organizations. The system analysis of an organization with all its elements and interrelations, and all its spheres of competence, will allow to describe the organization, reveal its weak functional elements, formulate rational directions for its transformation, and demonstrate efficiency of the future organization. To achieve higher indices of organization activity it is necessary to carry out appropriate training of the stuff, first of all the management elite of organizations. The "Increasing Efficiency of Organizations" is a system of interdependent training courses which are technologically independent and short-termed, and which are oriented on a free choice of components, forms and cleanness of the teaching terms of the implementation of the training: 1 System analysis and transformation of organizations; 2 Strategic decisions in the development of organization; 3 Result-oriented strategy of the organization development; 4 Activities and orientations on the interests of consumers; 5 Organizational distribution of powers; 6 Diagnosing and changing organizational culture; 7 Rational and structural components of organization; 8 Institutional documents; 9 Decision-making methods; 10 Conceptual informatization of organizations; 11 The environment of new informational technologies; 12 Human resources management. The program conceptual goals are: giving the inter-depended system of knowledge and practical skills to the listeners in the field of modern methodologies and technologies of management in the organization activities; permanent expansion of the listeners' groups, who are receiving necessary and enough knowledge in the field of managing organization activities; the development of the system of knowledge and practical skills, which mainly corresponds to the listeners9 problems; form self-government and local administration ethics and develop the background for the institute9s effective functioning; to fill the information vacuum concerning this sphere; to increase the effectiveness of self-government and interaction of local administrations. The following thesis demonstrates that it is rather easier to fight against corruption during the reform than afterwards, when corruption becomes part of the system; creation of an intellectual basis for evolutional transition of the new forms and technologies of the organization activities. The entire program is oriented on: the leadership and stuff of the state bodies and the local administration, which should know new methods and technologies of governing for carrying out their office responsibilities, forming the aims and principles of the development of activities in proper organizations; the governing elite and the managers of commercial organizations, who within their responsibility should strive to increase the profits of enterprises, the effectiveness of functioning and correspondingly should carry out the necessary changes in proper organizations; the specialists in the field of organization and management of enterprise, creation of the information-computer system, who in their professional activity should use the most progressive methods and technologies of carrying out the analysis, introductions of effectively functioning organizational systems. the students and young specialists, who want to understand the idea of the system, organization, their components and peculiarities, to learn the principles and technologies of increasing the effectiveness and functioning of organization, and methods of transformation. * Projects both theoretical and practical are at various stages of study. 16-Sep-2002 17:26:55 -0300,2020;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 17:26:55 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17r2PK-0000fi-00 for categories-list@mta.ca; Mon, 16 Sep 2002 17:23:46 -0300 Message-Id: <200209161839.LAA20825@coraki.Stanford.EDU> X-Mailer: exmh version 2.1.1 10/15/1999 To: categories@mta.ca Subject: categories: Re: category theory application to database implementation Date: Mon, 16 Sep 2002 11:39:58 -0700 From: Vaughan Pratt Sender: cat-dist@mta.ca Precedence: bulk Bill Galchin's question concerns the appearance of category theory in a web page proposing to revamp the Georgian legislature (country of Georgia, not the US state), at http://www.asrios.ge/maincentreprojectsoverview_800.htm#reserch The proposal is in four sections. 1. Formation and Management of the Informational Legislative Space of Georgia. Six goals, ten tasks. General idea: formalize the legislature to the point where software methodology can support it. 2. A Theoretical Approach to the Formation of Progressive State Administration Structures Six objects, seven goals. General drift: update the administration. 3. Research on the Formation of Unified Dynamic Database Structure Based on Mathematical Models Idea: base the approach on categorial analysis, Petri nets, lattice theory, etc. (This is where the quote in question appeared.) 4. Training System "Increasing Efficiency of Organizations" Twelve training courses, five goals, four classes of personnel (administrators, captains of government and industry, entrepreneur-technologists, and students/trainees). The number of people likely to be fluent in both Georgian and category theory is presumably small enough to justify qualifying "stages" with "preliminary" in the proposal's conclusion: "Projects both theoretical and practical are at various stages of study." Vaughan Pratt 16-Sep-2002 17:27:06 -0300,3883;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 17:27:06 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17r2Q3-0000j2-00 for categories-list@mta.ca; Mon, 16 Sep 2002 17:24:31 -0300 Date: Mon, 16 Sep 2002 11:32:52 -0700 From: "David B. Benson" To: cat-dist@mta.ca Subject: categories: Re: your mail Message-ID: <20020916183252.GA16523@kamiak.eecs.wsu.edu> References: <20020913213253.84707.qmail@web12201.mail.yahoo.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Disposition: inline In-Reply-To: <20020913213253.84707.qmail@web12201.mail.yahoo.com> User-Agent: Mutt/1.4i Sender: cat-dist@mta.ca Precedence: bulk Dear Category Theorists, It is undoubted that category theory has several, perhaps many, applications to database theory and design. A complete database engine which uses Kliesli monads, i.e., triples, in an interesting and fruitful manner is BioKliesli to which you may find references by accessing Val Tannen's website at the University of Pennsylvania. I continue to work, when I have the time away from more pressing duties, on the amazing connections between the theory of Diers categories (locally multipresentable categories) and databases. I suspect there are many other fruitful connections, for example, between the categorist's explication of intuitionistic logic and database query languages. To answer Bill Hatchin's question, I suppose the answer is ``nothing of import'' I personally will continue to ignore websites which seem to miss the point in favor of software buzzwords. Best, David -- Professor David B. Benson (509) 335-2706 School of EE and Computer Science (EME 102) (509) 335-3818 fax PO Box 642752, Washington State University office: Sloan 308 and 307 Pullman WA 99164-2752 U.S.A. dbenson@eecs.wsu.edu ---------------------------------------------------------------------------------- On Mon, Sep 16, 2002 at 11:42:07AM -0300, cat-dist@mta.ca wrote: > ep 2002 14:32:53 PDT > Date: Fri, 13 Sep 2002 14:32:53 -0700 (PDT) > From: Galchin Vasili > Subject: categories: category theory application to database implementation > To: categories@mta.ca > MIME-Version: 1.0 > Sender: cat-dist@mta.ca > Precedence: bulk > > Hello CT community, > > Perhaps my question is too much of an applied question. I found a Web > site where they say the following: > > "The category theory may become the core part of the mathematical > instrument for the conceptual systems development. The system can be > presented as a category in which the relative correlation exists among the > objects (morphisms). Each system must be presented both on generalized and > concrete reflection levels. The generalized level (upper level) and each > of the concrete reflection levels are categories. Hence, it should be > considered the process of reflection between general and concrete levels > (functors). Each objects of the category system can be a system by itself > (category). Consequently we have to consider lattice dependence of > categories both on the generalized level and as well as on the > decomposition of the objects. Each system changes in time. So it should be > considered problems related to the dynamics of categories. Complex > consideration and decisions of the above-stated and other related problems > should ensure the formation of the mathematical base. This will enable to > consider the creation of dynamic, unified distributed databases that can > be used in various applied fields." > > > What is this trying to say? > > Regards, Bill Halchin 16-Sep-2002 20:07:07 -0300,5370;000000000001-00000000 Return-path: Envelope-to: rrosebrugh@mta.ca Delivery-date: Mon, 16 Sep 2002 20:07:07 -0300 Received: from jackal.mta.ca ([138.73.1.6]) by mailserv.mta.ca with esmtp (Exim 3.36 #6) id 17r4xP-0004YL-00 for rrosebrugh@mta.ca; Mon, 16 Sep 2002 20:07:07 -0300 Received: from zent.mta.ca ([138.73.1.15]) by jackal.mta.ca with smtp (Exim 4.10) id 17r4xP-0002t0-00 for rrosebrugh@mta.ca; Mon, 16 Sep 2002 20:07:07 -0300 Received: FROM chase BY zent.mta.ca ; Mon Sep 16 20:06:58 2002 -0300 Received: from rr by chase with local (Exim 3.34 #1 ) id 17r4xN-0003II-00 for ; Mon, 16 Sep 2002 20:07:05 -0300 Subject: Forwarded mail... To: rrosebrugh@mta.ca Date: Mon, 16 Sep 2002 20:07:05 -0300 (ADT) X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: From: Robert Rosebrugh >From cat-dist@mta.ca Mon Sep 16 13:05:22 2002 Return-path: Envelope-to: rr@mathstat.dal.ca Received: from linus.ucis.dal.ca ([129.173.1.59]) by chase with esmtp (Exim 3.34 #1 ) id 17qyNE-0003ds-00; Mon, 16 Sep 2002 13:05:20 -0300 Received: from mailserv.mta.ca (mailserv.mta.ca [138.73.1.1]) by Linus.UCIS.Dal.Ca (8.12.1/8.12.1) with ESMTP id g8GG5IbR014420; Mon, 16 Sep 2002 13:05:18 -0300 (ADT) Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qx4h-00052A-00 for categories-list@mta.ca; Mon, 16 Sep 2002 11:42:07 -0300 Message-ID: <20020913213253.84707.qmail@web12201.mail.yahoo.com> From: cat-dist@mta.ca To: categories-list@mta.ca Date: Mon, 16 Sep 2002 11:42:07 -0300 ep 2002 14:32:53 PDT Date: Fri, 13 Sep 2002 14:32:53 -0700 (PDT) From: Galchin Vasili Subject: categories: category theory application to database implementation To: categories@mta.ca MIME-Version: 1.0 Sender: cat-dist@mta.ca Precedence: bulk Hello CT community, Perhaps my question is too much of an applied question. I found a Web site where they say the following: "The category theory may become the core part of the mathematical instrument for the conceptual systems development. The system can be presented as a category in which the relative correlation exists among the objects (morphisms). Each system must be presented both on generalized and concrete reflection levels. The generalized level (upper level) and each of the concrete reflection levels are categories. Hence, it should be considered the process of reflection between general and concrete levels (functors). Each objects of the category system can be a system by itself (category). Consequently we have to consider lattice dependence of categories both on the generalized level and as well as on the decomposition of the objects. Each system changes in time. So it should be considered problems related to the dynamics of categories. Complex consideration and decisions of the above-stated and other related problems should ensure the formation of the mathematical base. This will enable to consider the creation of dynamic, unified distributed databases that can be used in various applied fields." What is this trying to say? Regards, Bill Halchin --------------------------------- Do you Yahoo!? Yahoo! News - Today's headlines --0-1797606253-1031952773=3D:84530 Content-Type: text/html; charset=3Dus-ascii

Hello CT community,

     Perhaps my question is too much of an applied q= uestion. I found a Web site where they say the following:

"The category theory may become the core part of t= he mathematical instrument for the conceptual systems development. The syst= em can be presented as acategory in which the relative correlation exists a= mong the objects (morphisms).
Each= system must be presented both on generalized and concrete reflection level= s. The generalized level (upper level) and each of the concrete reflection = levels are categories. Hence, it should be considered the process of reflec= tion between general and concrete levels (functors).
Each objects of the category system can be a system by = itself (category). Consequently we have to consider lattice dependence of c= ategories both on the generalized level and as well as on the decomposition= of the objects.
Each system chang= es in time. So it should be considered problems related to the dynamics of = categories.
Complex consideration = and decisions of the above-stated and other related problems should ensure = the formation of the mathematical base. This will enable to consider the cr= eation of dynamic, unified distributed databases that can be used in variou= s applied fields."

What is this trying to say?

Regards, Bill Halchin

 


Do y= ou Yahoo!?
Yahoo! News - Today's headlin= es --0-1797606253-1031952773=3D:84530-- 18-Sep-2002 08:37:05 -0300,3366;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 18 Sep 2002 08:37:05 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17rczS-0000d7-00 for categories-list@mta.ca; Wed, 18 Sep 2002 08:27:30 -0300 From: "Walter Tholen" Message-Id: <1020917135948.ZM97684@pascal.math.yorku.ca> Date: Tue, 17 Sep 2002 13:59:48 -0400 X-Mailer: Z-Mail (4.0.1 13Jan97) To: categories@mta.ca Subject: categories: Workshop on Categorical Structures for Galois Theory, Hopf algebras and Semiabelian Categories] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Sender: cat-dist@mta.ca Precedence: bulk Dear Categorist - Below I forward some generic information on the up-coming Workshop at the Fields Institute in Toronto next week. Last-minute decision makers may still register on site on Monday morning (September 23), before the Opening at 8:45am. Walter Tholen. > Workshop on Categorical Structures for Descent and Galois > Theory, Hopf Algebras and Semiabelian Categories > September 23-28, 2002. > > For an updated workshop schedule, please refer to: > www.fields.utoronto.ca/programs/scientific/02-03/galois_and_hopf/sched > ule.html > > Location: The Fields Institue, 222 College Street, 2nd Floor, Toronto. > The Institute is on the north side of College, just West of St. George > Street, between University Avenue and Spadina. The building is three > blocks West of the Queen's Park subway station on the Yonge-University > subway line. A map of the University of Toronto campus can be found > here: > http://oracle.osm.utoronto.ca/map/index2.html > > Meter parking is available across the College St. from the Institute, > and underground around the corner on Huron Street, the first street > West of the Institute. > > You can pick up your meeting package on arrival at the Institute. > Registration will be held from 8:00-8:45am on Monday, September 23, > 2002. > > Coffee and light refreshments will be served during registration the > first day, and every morning from 8:30-9:00 am. There will also be an > afternoon tea break every day from 3-3:30 pm. On Wednesday, September > 25, there will be an excursion to Niagara Falls, where a bag lunch > will be provided for the bus, and dinner served in Niagara Falls. A > reception and banquet will be held on Thursday, September 26, from > 7:00-9:30 pm at the University of Toronto Faculty Club. If you are > vegetarian or have other dietary restrictions, please let the staff at > the Fields Institute know in advance. > > Email can be accessed through computers at Fields. Telephone > messages, during the workshop, can be left with myself at (416) > 348-9710 x 3018. > > The Fields Institute website contains a visitor information section, > which you may want to consult: www.fields.utoronto.ca/resources/ > If you are interested in activites in the Toronto area during your > visit, this website contains up-to-date event and entertainment > listings: > www.toronto.com > > Please contact me if you have any questions or concerns. We are > looking forward to your participation in the workshop. > > Jonathan Kassian > Program Coordinator > The Fields Institute > Tel: (416) 348-9710 x3018 > Fax: (416) 348-9759 18-Sep-2002 15:53:14 -0300,1113;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 18 Sep 2002 15:53:14 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17rjlf-0002k9-00 for categories-list@mta.ca; Wed, 18 Sep 2002 15:41:43 -0300 Date: Tue, 17 Sep 2002 09:46:19 -0300 From: "Robert J. MacG. Dawson" Subject: categories: Re: category theory application to database implementation To: categories@mta.ca Message-id: <3D87241B.5E6153CC@stmarys.ca> MIME-version: 1.0 X-Mailer: Mozilla 4.7 [en] (WinNT; U) Content-type: text/plain; charset=us-ascii Content-transfer-encoding: 7bit X-Accept-Language: en References: <200209161839.LAA20825@coraki.Stanford.EDU> Sender: cat-dist@mta.ca Precedence: bulk The idea of a national government based on purely categorical principles is an interesting one. Suppose it had been tried elsewhere... "We hold these axioms to be the correct foundations, that all objects of the category M are isomorphic, that there is a functor from C creating certain equalizers... " -Robert Dawson 18-Sep-2002 15:53:14 -0300,3677;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 18 Sep 2002 15:53:14 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17rjo8-0002sV-00 for categories-list@mta.ca; Wed, 18 Sep 2002 15:44:16 -0300 Message-ID: <3D88A8DA.DB2A2D66@csc.liv.ac.uk> Date: Wed, 18 Sep 2002 17:24:58 +0100 From: Peter McBurney X-Mailer: Mozilla 4.79 [en] (X11; U; Linux 2.4.18-10 i686) X-Accept-Language: en MIME-Version: 1.0 To: CATEGORIES LIST Subject: categories: CFP: Logic and Games in Multi-Agent Systems Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk With apologies for cross-postings Symposium on Logic in Games and Multiagent Systems University of Liverpool, UK, 16 & 17 December, 2002. http://www.csc.liv.ac.uk/~pauly/logamas.html Introduction: Over the past decade, there has been increasing interest in the relationship between logic and game theory. On the one hand, logic researchers find in game theory a natural set of concepts for expressing many logical concepts -- game theoretic interpretations of quantification is perhaps the best-known example. On the other hand, game theorists have found in various logics natural and powerful tools through which to represent and reason about many game-theoretic concepts. Examples include the use of logics of knowledge and common knowledge to capture such notions as perfect information and perfect recall, and the use of strategic/coalition modalities to capture such notions as effectivity. Research into logic and game theory has recently received a substantial boost by the emergence of the multiagent systems paradigm. Multiagent systems research is concerned with the theory and practice of computer systems composed of multiple, interacting, autonomous computing elements known as agents. The multiagent systems paradigm seems an appropriate one through which to model, and understand large-scale distributed/open systems such as the Internet. The multiagent systems community has a significant degree of success in the design of algorithms and techniques that automated, self-interested software agents can use to cooperate, coordinate, and reach agreements on matters of common interest. Much of this work has taken inspiration from the logic and game theory communities. The symposium aims at bringing together researchers working at the intersection of logic, game theory and multiagent systems, in order to identify the key issues, problems, and techniques in the application of logic to games and multiagent systems. Conferences with a related subject area are LOFT, TARK, and LGS. TOPICS OF INTEREST (include but are not limited to): modal logics, e.g. epistemic logic, dynamic logic, game logic, (alternating) temporal logic, coalition logic, etc. communication and information flow belief revision and formation, learning logical foundations, e.g., of solution concepts bounded rationality the role of language in games computational complexity Submission information and further details available at: http://www.csc.liv.ac.uk/~pauly/logamas.html **************************************************************** Dr Peter McBurney Department of Computer Science University of Liverpool Liverpool L69 7ZF U. K. Tel: + 44 151 794 6760 Email: P.J.McBurney@csc.liv.ac.uk Web page: www.csc.liv.ac.uk/~peter/ **************************************************************** 18-Sep-2002 15:53:14 -0300,2052;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 18 Sep 2002 15:53:14 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17rjky-0002hs-00 for categories-list@mta.ca; Wed, 18 Sep 2002 15:41:00 -0300 From: "Robert L. Knighten" MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15750.23602.573931.76755@zeus.knighten.org> Date: Mon, 16 Sep 2002 15:33:22 -0700 To: categories@mta.ca Subject: categories: Re: Braided Monoidal Categories In-Reply-To: References: X-Mailer: VM 7.04 under Emacs 21.1.1 Reply-To: Robert@Knighten.org (Robert L. Knighten) Sender: cat-dist@mta.ca Precedence: bulk N Ghani writes: > > For some rather obscure reason, I'd like to read about braided monoidal > categories and, in particular, their associated coherence problems. Can > someone provide me with a reference or two please? > > Yours, > > Neil > Here are a few quickly selected reference that may be helpful. Gerald Dunn - Lax Operad Actions and Coherence for Monoidal n-Categories, A_{\infty} Rings and Modules http://tac.mta.ca/tac/volumes/1997/n4/n4.pdf David N Yetter - FUNCTORIAL KNOT THEORY: Categories of Tangles, Coherence, Categorical Deformations, and Topological Invariants World Scientific, April 2001, 236pp. ISBN 981-02-4443-6 Richard Blute - Braids in Linear Logic http://www.cis.upenn.edu/~bcpierce/types/archives/1992/msg00068.html [good references] Index to John Baez's " This Week's Find's in Mathematical Physics" search for "braided monoidal" http://obswww.unige.ch/~lbartho/TWF/wgindex.html Paul-Andre Mellies - MacLane's coherence theorem viewed as a word problem. http://www.pps.jussieu.fr/~mellies/coherence.ps.gz -- Bob -- Robert L. Knighten 15580 S.W. Bridle Hills Drive Beaverton, OR 97007 (503) 626-4965 Robert@Knighten.org 23-Sep-2002 18:12:58 -0300,1750;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 23 Sep 2002 18:12:58 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17taOY-0002ck-00 for categories-list@mta.ca; Mon, 23 Sep 2002 18:05:30 -0300 X-Sender: grandis@pop4.dima.unige.it Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 23 Sep 2002 15:11:56 +0100 To: categories@mta.ca From: grandis@dima.unige.it (Marco Grandis) Subject: categories: preprint: Galois theory of simplicial complexes X-OriginalArrivalTime: 23 Sep 2002 13:04:10.0562 (UTC) FILETIME=[B52E4220:01C26301] Sender: cat-dist@mta.ca Precedence: bulk The following preprint is available: M. Grandis - G. Janelidze Galois theory of simplicial complexes Dip. Mat. Univ. Genova, Preprint 459 (2002), 9 p. Abstract We examine basic notions of categorical Galois theory for the adjunction (\Pi_0 -| discrete)means of the fundamental groupoid, for which we give an explicit "Galois-theoretic" description. The class of covering morphisms is a part of a factorization system similar to the (purely inseparable, separable) factorization system in classical Galois theory, which however fails to be the (monotone, light) factorization. http://www.dima.unige.it/~grandis/rec.public_grandis.html ftp://www.dima.unige.it/Home/grandis/public/GalSmc.pdf With best regards Marco Grandis Dipartimento di Matematica Universita' di Genova via Dodecaneso 35 16146 GENOVA, Italy e-mail: grandis@dima.unige.it tel: +39.010.353 6805 fax: +39.010.353 6752 http://www.dima.unige.it/~grandis/ ftp://www.dima.unige.it/Home/grandis/public/ 26-Sep-2002 11:31:24 -0300,1487;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 26 Sep 2002 11:31:24 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17uZYw-0002AV-00 for categories-list@mta.ca; Thu, 26 Sep 2002 11:24:18 -0300 Message-ID: <3D928297.2020505@cmu.edu> Date: Wed, 25 Sep 2002 22:44:23 -0500 From: Steve Awodey User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.0) Gecko/20020606 X-Accept-Language: en-us, en MIME-Version: 1.0 To: categories@mta.ca Subject: categories: The Scottfest Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk *************************************************** The Scottfest in honor of Dana S. Scott on his 70th Birthday *************************************************** There will be a day-long conference on: Saturday 12 October 2002 in Baker Hall A53, Carnegie Mellon University. Speakers include: Clark Glymour, Klaus Sutner, Stephen Brookes, James Cummings, Nuel Belnap, Frank Pfenning, Steve Awodey, Bob Harper, Rick Statman, Jay Kadane All are welcome to attend, no registration is required. The Scottfest is being sponsored jointly by the departments of Computer Science, Mathematics, and Philosophy, Carnegie Mellon University. For more information, consult: http://www.andrew.cmu.edu/~awodey/colloquium/scottfest.html 27-Sep-2002 12:31:10 -0300,2044;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 27 Sep 2002 12:31:10 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17uwwa-0007UV-00 for categories-list@mta.ca; Fri, 27 Sep 2002 12:22:16 -0300 Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Fri, 27 Sep 2002 15:24:26 +0100 To: rrosebrugh@mta.ca From: grandis@dima.unige.it (Marco Grandis) Subject: categories: preprint: Galois theory of simplicial complexes (again) Cc: george_janelidze@hotmail.com, janelidz@mathstat.yorku.ca X-OriginalArrivalTime: 27 Sep 2002 13:20:32.0375 (UTC) FILETIME=[A80A0870:01C26628] Sender: cat-dist@mta.ca Precedence: bulk the abstract I sent to "categories" lost a few sentences... Best regards Marco ___ The following preprint is available: M. Grandis - G. Janelidze Galois theory of simplicial complexes Dip. Mat. Univ. Genova, Preprint 459 (2002), 9 p. Abstract We examine basic notions of categorical Galois theory for the adjunction (\Pi_0 -| discrete) in the case of simplicial complexes. Covering morphisms are characterized as the morphisms satisfying the unique simplex lifting property and are classified by means of the fundamental groupoid, for which we give an explicit "Galois-theoretic" description. The class of covering morphisms is a part of a factorization system similar to the (purely inseparable, separable) factorization system in classical Galois theory, which however fails to be the (monotone, light) factorization. http://www.dima.unige.it/~grandis/rec.public_grandis.html ftp://www.dima.unige.it/Home/grandis/public/GalSmc.pdf With best regards Marco Grandis Dipartimento di Matematica Universita' di Genova via Dodecaneso 35 16146 GENOVA, Italy e-mail: grandis@dima.unige.it tel: +39.010.353 6805 fax: +39.010.353 6752 http://www.dima.unige.it/~grandis/ ftp://www.dima.unige.it/Home/grandis/public/ 16-Sep-2002 11:47:46 -0300,4471;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 11:47:46 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qx2s-0004u2-00 for categories-list@mta.ca; Mon, 16 Sep 2002 11:40:14 -0300 X-MimeOLE: Produced By Microsoft Exchange V6.0.6249.0 Content-Class: urn:content-classes:message MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Subject: categories: FOSSACS'03 call-for-papers; deadline Friday October 18 Date: Thu, 12 Sep 2002 02:35:56 -0700 Message-ID: <3C0C2AFA8DA9F5448E401726A56637F602F86305@RED-MSG-10.redmond.corp.microsoft.com> X-MS-Has-Attach: X-MS-TNEF-Correlator: From: "Andy Gordon" To: X-OriginalArrivalTime: 12 Sep 2002 09:35:55.0653 (UTC) FILETIME=[CB173350:01C25A3F] Sender: cat-dist@mta.ca Precedence: bulk Dear Category Theorists, I warmly encourage you to submit to FOSSACS 2003. I attach the = call-for-papers. Apologies if you receive duplicates. The deadline is = October 18. Time to get writing! Andy. =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=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D Foundations of Software Science and Computation Structures FOSSACS 2003 http://www.research.microsoft.com/~adg/Fossacs03/ A member conference of the European Joint Conferences on Theory and Practice of Software ETAPS 2003, Warsaw, April 5-13, 2003 http://www.mimuw.edu.pl/etaps/ = =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=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D FOSSACS seeks original papers on foundational research with a clear = significance for software science. The conference invites submissions on = theories and methods to support the analysis, integration, synthesis, = transformation, and verification of programs and software systems. Topics covered include, but are not limited to: algebraic models; = automata and language theory; behavioural equivalences; categorical = models; computation processes over discrete and continuous data; = computation structures; logics of programs; modal, spatial, and temporal = logics; models of concurrent, reactive, distributed, and mobile systems; = process algebras and calculi; semantics of programming languages; = software specification and refinement; transition systems; type systems = and type theory. Prior meetings were in Lisbon (1998), Amsterdam (1999), Berlin (2000), = Genova (2001), and Grenoble (2002). INVITED SPEAKER Samson Abramsky (UK) PROGRAMME CHAIR Andrew Gordon (UK) PROGRAMME COMMITTEE Witold Charatonik (Germany and Poland) Adriana Compagnoni (USA) Vincent Danos (France) Roberto Gorrieri (Italy) Marta Kwiatkowska (UK) Eugenio Moggi (Italy) Uwe Nestmann (Switzerland) Mogens Nielsen (Denmark) Flemming Nielson (Denmark) Fran=E7ois Pottier (France) Francesco Parisi Presicce (Italy) Dusko Pavlovic (USA) P.S. Thiagarajan (Singapore) Igor Walukiewicz (France) Pierre Wolper (Belgium) SUBMISSION INSTRUCTIONS Submitted papers must be in English and must describe work unpublished = in refereed venues, and not submitted for publication elsewhere. Papers = should be no more than 15 pages in the Springer LNCS style (see = http://www.springer.de/comp/lncs/authors.html for details). Submission = must be carried out electronically via the web; see = http://www.research.microsoft.com/~adg/Fossacs03/ for details. Papers = must be submitted as PostScript documents that are interpretable by = Ghostscript, or in PDF format, and they must be printable on both = USLetter and A4 paper. (If this requirement is a hardship, please = contact the Programme Chair.) IMPORTANT DATES October 18, 2002 Submission deadline=20 December 13, 2002 Notification of acceptance/rejection=20 January 17, 2003 Camera-ready version due=20 April 7-11, 2003 FOSSACS 2003, as part of ETAPS 2003=20 FOSSACS 2003 call-for-papers, September 2002. 16-Sep-2002 11:47:47 -0300,4089;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 11:47:47 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qx4h-00052A-00 for categories-list@mta.ca; Mon, 16 Sep 2002 11:42:07 -0300 Message-ID: <20020913213253.84707.qmail@web12201.mail.yahoo.com> From: cat-dist@mta.ca To: categories-list@mta.ca Date: Mon, 16 Sep 2002 11:42:07 -0300 ep 2002 14:32:53 PDT Date: Fri, 13 Sep 2002 14:32:53 -0700 (PDT) From: Galchin Vasili Subject: categories: category theory application to database implementation To: categories@mta.ca MIME-Version: 1.0 Sender: cat-dist@mta.ca Precedence: bulk Hello CT community, Perhaps my question is too much of an applied question. I found a Web site where they say the following: "The category theory may become the core part of the mathematical instrument for the conceptual systems development. The system can be presented as a category in which the relative correlation exists among the objects (morphisms). Each system must be presented both on generalized and concrete reflection levels. The generalized level (upper level) and each of the concrete reflection levels are categories. Hence, it should be considered the process of reflection between general and concrete levels (functors). Each objects of the category system can be a system by itself (category). Consequently we have to consider lattice dependence of categories both on the generalized level and as well as on the decomposition of the objects. Each system changes in time. So it should be considered problems related to the dynamics of categories. Complex consideration and decisions of the above-stated and other related problems should ensure the formation of the mathematical base. This will enable to consider the creation of dynamic, unified distributed databases that can be used in various applied fields." What is this trying to say? Regards, Bill Halchin --------------------------------- Do you Yahoo!? Yahoo! News - Today's headlines --0-1797606253-1031952773=3D:84530 Content-Type: text/html; charset=3Dus-ascii

Hello CT community,

     Perhaps my question is too much of an applied q= uestion. I found a Web site where they say the following:

"The category theory may become the core part of t= he mathematical instrument for the conceptual systems development. The syst= em can be presented as acategory in which the relative correlation exists a= mong the objects (morphisms).
Each= system must be presented both on generalized and concrete reflection level= s. The generalized level (upper level) and each of the concrete reflection = levels are categories. Hence, it should be considered the process of reflec= tion between general and concrete levels (functors).
Each objects of the category system can be a system by = itself (category). Consequently we have to consider lattice dependence of c= ategories both on the generalized level and as well as on the decomposition= of the objects.
Each system chang= es in time. So it should be considered problems related to the dynamics of = categories.
Complex consideration = and decisions of the above-stated and other related problems should ensure = the formation of the mathematical base. This will enable to consider the cr= eation of dynamic, unified distributed databases that can be used in variou= s applied fields."

What is this trying to say?

Regards, Bill Halchin

 


Do y= ou Yahoo!?
Yahoo! News - Today's headlin= es --0-1797606253-1031952773=3D:84530-- 16-Sep-2002 11:47:47 -0300,2623;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 11:47:47 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qx1l-0004o6-00 for categories-list@mta.ca; Mon, 16 Sep 2002 11:39:05 -0300 Date: Wed, 11 Sep 2002 20:24:17 +0100 Message-Id: <200209111924.g8BJOH131622@cuillin.dcs.ed.ac.uk> X-Authentication-Warning: cuillin.dcs.ed.ac.uk: als set sender to als+lics-junk@inf.ed.ac.uk using -f To: LICS List From: Alex Simpson Subject: categories: LICS 2003 - Call for Workshop Proposals Reply-To: als+lics-junk@dcs.ed.ac.uk Sender: cat-dist@mta.ca Precedence: bulk Apologies for multiple copies. -------------------------------------------------------------------------- IEEE Symposium On Logic In Computer Science 2003 Ottawa, Ontario, Canada, 22-25 June 2003 CALL FOR WORKSHOP PROPOSALS The Eighteenth IEEE Symposium On Logic In Computer Science will be held in Ottawa, Ontario from 22nd to the 25th of June 2003. The organizers have made arrangements for pre- and post-LICS workshops to be run in conjunction with the main conference. Possible dates are 21st June and 26-27th June. Researchers and practitioners are invited tofsubmit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Funding is available to help defray the costs of a *limited number* of workshops. Proposals should include: * A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. * A discussion of the proposed format and agenda. * The proposed duration, which may vary from half a day to two days, and preferred dates. * Procedures for selecting participants and papers. * Expected number of participants. * Potential invited speakers. * Plans for proceedings or other publications. Proposals are due Nov 1st 2002 and should be submitted electronically to: Prakash Panangaden Workshops Chair LICS'03 prakash@cs.mcgill.ca The selections will be chosen by a committee consisting of Samson Abramsky (LICS General Chair), Phokion Kolaitis (LICS'03 Program Committee Chair), Prakash Panangaden (LICS Workshop Chair) and Phil Scott and Amy Felty (LICS'03 Conference Co-chairs). The results will be announced by Nov 15th 2002. LICS Website: http://www.lfcs.informatics.ed.ac.uk/lics 16-Sep-2002 11:47:47 -0300,5797;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 16 Sep 2002 11:47:47 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17qx0a-0004i2-00 for categories-list@mta.ca; Mon, 16 Sep 2002 11:37:52 -0300 From: Johan Lilius IB Date: Mon, 16 Sep 2002 11:43:52 +0300 Message-Id: <200209160843.g8G8hqk08082@mother.cs.abo.fi> To: categories@mta.ca Subject: categories: ACSD 2003 Call for Papers Sender: cat-dist@mta.ca Precedence: bulk ************************************************************************ CALL FOR PAPERS ACSD 2003 International Conference on Application of Concurrency to System Design 18-20th of June 2003 Guimaraes, Portugal http://get.dsi.uminho.pt/acsd03 ************************************************************************ Co-sponsored by * IFIP WG10.5 and SIG-ES * OE/CEI - Col=E9gio de Engenharia Inform=E1tica da Ordem dos Engenheiros Portuguesa In cooperation with * FME - Formal Methods Europe Proceedings published by * IEEE Computer Society Press PURPOSE The International Conference on Application of Concurrency to System Design (ACSD) is being organized for the third time (see also ACSD 2001) to serve as a forum for disseminating advanced research results on theory and practice of design of concurrent systems. While there are a few success stories in this field, there is a real need to provide practitioners with adequately sound and expressive tools, and researchers with real motivations and examples. The aim of this conference is to contribute towards this goal by bringing together experts in a wide variety of fields related to complex concurrent system design and analysis. The scientific program will also include invited lectures covering the areas of current interest, tool presentations and demonstration. PROGRAM COMMITTEE CO-CHAIRS Felice Balarin - Cadence Berkeley Labs, USA Johan Lilius - Turku Centre for Computer Science and Abo Akademi University, Finland TOPICS OF INTEREST * Formal and semi-formal models: Petri nets, Process Algebras, Temporal Logics, Data Flow nets, Statecharts (both Harel's and UML), Synchronous Languages, HDLs, etc. * Formal methods for CAD and verification of concurrent systems: model checking, asynchronous design, high-level synthesis, hardware/software co-design, etc. * Real-time and hybrid systems * Discrete-event systems, communication protocols and interfaces * Concurrency issues in designing Systems-on-Chip * Case studies of concurrent systems design and verification * Presentation of software tools supporting the above topics PAPERS Submitted papers should be no more than 15 pages in 11-point font with a 60-word abstract, and should include a cover page with authors' physical and e-mail addresses, phone and FAX numbers by 1st December 2002. Paper submission will be handled electronically. More information will be available on the Conference web-pages. Accepted papers will be published by the IEEE Computer Society Press. TOOL DEMOS Submissions for tool demonstration should be no more than 2 pages and sent to Felice Balarin (felice@cadence.com) by 1st of February 2003. The accepted tool descriptions will appear as an appendix in the conference proceedings. IMPORTANT DATES Deadline for paper submission: 1st December 2002 Deadline for tool demonstration submission: 1st February 2003 Notification of acceptance: 1st March 2003 Deadline for final version: 28th March 2003 PROGRAM COMMITTEE F. Balarin (Cadence, USA) - felice@cadence.com J. Beister (Univ. of Keiserslautern, Germany) - beister@rhrk.uni-kl.de M. Bednarczyk (IPI PAN, Poland) - m.bednarczyk@ipipan.gda.pl M. Broy (Munich, Germany) - broy@informatik.tu-muenchen.de J. Billington (Univ. of South Australia, Australia) - j.billington@unisa.ed= u.au P. Caspi (VERIMAG, France) - paul.caspi@imag.fr J. Cortadella (UPC, Spain) - jordic@lsi.upc.es J. Desel (Katlische Univ. Eichstatt, Germany) - joerg.desel@ku-eichstaett.d= e H. Hsieh (Univ. of California - Riverside, USA) - harry@cs.ucr.edu R. Janicki (McMaster University, Canada) - janicki@mail.CAS.McMaster.CA M. Josephs (SBU, UK) - mark.josephs@sbu.ac.uk M. Kishinevsky (Intel, USA) - mkishine@ichips.intel.com B. Kleinjohann (C-Lab, Germany) - Bernd.Kleinjohann@c-lab.de A. Kondratyev (Cadence, USA) - kalex@cadence.com R. Kurshan (Cadence, USA) - rkurshan@cadence.com L. Lavagno (Politecnico di Torino, Italy) - lavagno@polito.it J. Lilius (TUCS and Ebo Akademi Univ., Finland) - Johan.Lilius@abo.fi R. Machado (Univ. do Minho, Portugal) - rmac@dsi.uminho.pt N. Maranghello (USP, Brazil) - norian@dcce.ibilce.unesp.br A. Moreira (Univ. Nova de Lisboa, Portugal) - amm@di.fct.unl.pt E. Pastor (Univ. de Catalunya, Spain) - enric@ac.upc.es G. Rozenberg (Leiden Univ, Netherlands) - rozenber@cs.leidenuniv.nl S. Tripakis (VERIMAG, France) - stavros.tripakis@verimag.fr A. Valmari (Tampere Univ. of Technology, Finland) - ava@cs.tut.fi A. Yakovlev (Univ. of Newcastle upon Tyne, UK) - alex.yakovlev@ncl.ac.uk W. Yi (Uppsala, Sweden) - yi@docs.uu.se T. Yoneda (Tokyo IT, Japan) - yoneda@cs.titech.ac.jp ORGANIZING COMMITTEE (Universidade do Minho, Portugal) R. Machado (chair) J. Fernandes (co-chair & finance) M. Santos (local arrangements) L. Santos (sponsors) R. Jose (web & internet services) I. Saraiva (publicity & media) A. Esteves (travel & tourism) INSTITUTIONAL LINKS IFIP Link: B. Kleinjohann, C-LAB, Germany FME Link: J. N. Oliveira, Universidade do Minho, Portugal OE/CEI Link: J. M. Tribolet, INESC/IST, Portugal 2-Sep-2002 20:26:33 -0300,2617;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 02 Sep 2002 20:26:33 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17m0Rg-0004PO-00 for categories-list@mta.ca; Mon, 02 Sep 2002 20:17:24 -0300 From: Eduardo "J." Dubuc Message-Id: <200209021736.TAA10473@aragorn.imf.au.dk> Subject: categories: preprint: On the representation theory of Galois and Atomic Topoi To: categories@mta.ca Date: Mon, 2 Sep 2002 19:36:22 +0200 (METDST) Cc: edubuc@dm.uba.ar X-Mailer: ELM [] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk This is to announce the posting at the los alamos site of the following paper: to download the paper: http://arXiv.org/abs/math.CT/0208222 Title: On the representation theory of Galois and Atomic Topoi Authors: Eduardo J. Dubuc Comments: 34 pages Subj-class: Category Theory We elaborate on the representation theorems of topoi as topoi of discrete actions of various kinds of localic groups and groupoids. We introduce the concept of "proessential point" and use it to give a new characterization of pointed Galois topoi. We comment and develop on Grothendieck's galois theory and its generalization by Joyal-Tierney, and related work on these theories within the contex of topos theory by other authors. We have the hierarchy (for connected topoi): 1. essentially pointed Atomic = locally simply connected. 2. proessentially pointed Atomic = pointed Galois. 3. pointed Atomic The corresponding group of automorphisms of the point in the fundamental theorem are: 1. discrete group. 2. prodiscrete localic group. 3. localic group. We analyze also the respective groupoid versions (allways for connected topoi) and show that the groupoid in the fundamental theorem can allways be interpreted as the groupoid of all points. 1. connected discrete groupoid. 2. connected groupoid with discrete space of objects and prodiscrete localic spaces of hom-sets. 3. connected groupoid with discrete space of objects and localic spaces of hom-sets. We analyze also the unpoited version, and show that for a Galois topos, may be pointless, the groupoid can also be considered as the groupoid of "points". 1. allways with points. 2. connected (may be pointless) prodiscrete localic groupoids. 3. we do not know how to define the groupoid of points for a unpointed (may be pointless) connected atomic topos. 30-Sep-2002 14:23:08 -0300,869;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 30 Sep 2002 14:23:08 -0300 Received: from Majordom by mailserv.mta.ca with local (Exim 3.36 #6) id 17w44t-0003t0-00 for categories-list@mta.ca; Mon, 30 Sep 2002 14:11:27 -0300 Message-ID: <3D94C7A2.1070102@mcs.le.ac.uk> Date: Fri, 27 Sep 2002 22:03:30 +0100 From: "V. Schmitt" User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.0.0) Gecko/20020615 Debian/1.0.0-3 X-Accept-Language: en MIME-Version: 1.0 To: categories@mta.ca Subject: categories: post doc at Leicester Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Dear all, to advert a post-doc position in Leicester. Anybody interested could contact me. Best regards, Vincent Schmitt.