*mbx* 42cf5a8e00000000 1-Dec-2004 10:08:23 -0400,1991;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 01 Dec 2004 10:08:23 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CZV7k-0004iP-00 for categories-list@mta.ca; Wed, 01 Dec 2004 10:06:28 -0400 Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Date: Wed, 1 Dec 2004 10:28:17 +0100 To: categories@mta.ca From: kock Subject: categories: re: smooth spaces Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by aragorn.imf.au.dk id KAA04018 Sender: cat-dist@mta.ca Precedence: bulk In reply to John Baez' questions on Nov. 26, I think that the general machinery which is relevant to the analysis of such categories of smooth spaces is the theory of concrete quasitoposes of Dubuc, cf. E. Dubuc, Concrete Quasitopoi, in "Applications of Sheaves", Proceedings Durham 197= 7 (Springer Lecture Notes 253). Note that the "differentiable spaces" of Chen (and the general machinery = of Dubuc) deal with a COVARIANT determination of structure (i.e. the structu= re is given in terms of certain plots INTO a set/space), whereas the one considered by Mostow is CONTRAVARIANT (structure given in terms of certai= n functions OUT OF the set/space). You may have a "double" determination of mutually "balancing" plots and functions. This is the situation studied by Fr=F6licher et al., aimed particularly at smooth spaces (cf. e.g. Fr=F6licher and Kriegl: Linear Sp= aces and Differentiation Theory, Wiley 1988) (leading to the notion of Convenient Vector Space). A short survey of the Fr=F6licher-Kriegl-Michor theory, and some referenc= es, are contained in Kock and Reyes: "Categorical Distribution Theory; Heat Equation" Aarhus Preprint 2004 no. 17; available electronically from the Aarhus Preprint Server, at http://www.imf.au.dk Anders Kock 1-Dec-2004 20:02:20 -0400,1833;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 01 Dec 2004 20:02:20 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CZeMN-0000MN-00 for categories-list@mta.ca; Wed, 01 Dec 2004 19:58:11 -0400 Date: Wed, 1 Dec 2004 12:38:01 -0800 From: John Baez To: categories Subject: categories: re: smooth spaces Message-ID: <20041201203801.GA13773@math-cl-n03.ucr.edu> 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 Dear Anders Kock - Thanks very much for your suggestions! Giuseppe Rosolini also recommended Dubuc's work, so definitely I'll look at that, as well as the other references you mention. Rosolini also recommended the book by Wyler. > Note that the "differentiable spaces" of Chen (and the general machinery of > Dubuc) deal with a COVARIANT determination of structure (i.e. the structure > is given in terms of certain plots INTO a set/space), whereas the one > considered by Mostow is CONTRAVARIANT (structure given in terms of certain > functions OUT OF the set/space). Right. Chen's approach seemed a bit nicer for internal homs, since products are easily defined by saying a plot R^n -> A x B is a plot in A and a plot in B, and then we can define the internal hom by saying a plot R^n -> hom(X,Y) is a smooth map R^n x X -> Y. Perhaps this is an illusion of some sort, and the contravariant approach is just as good? One might fear that the covariant approach, being nice for products, would be bad for coproducts. But, one can take advantage of the fact that R^n is connected to say a plot R^n -> A + B is either a plot in A or a plot in B. Best, jb 3-Dec-2004 08:29:09 -0400,2046;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Dec 2004 08:29:09 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CaBIM-0007bY-00 for categories-list@mta.ca; Fri, 03 Dec 2004 07:08:14 -0400 From: J=FCrgen Koslowski Message-Id: <200412021054.iB2Asfc06638@lxt5.iti.cs.tu-bs.de> Subject: categories: CT 04 pictures from Vancouver To: categories@mta.ca (categories list) Date: Thu, 2 Dec 2004 11:54:40 +0100 (CET) X-Mailer: ELM [version 2.5 PL6] MIME-Version: 1.0 Content-Type: text/plain; charset=3Dus-ascii X-Scanned-By: MIMEDefang 2.37 Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Dear Colleagues, Some pictures of this year's category theory meeting in Vancouver are now online at http://www.iti.cs.tu-bs.de/TI-INFO/koslowj/PHOTOS/CT04/ (group pictures), and at http://www.iti.cs.tu-bs.de/~koslowj/cgi-bin/p8333?CT04-0/idx&256 and the following pages (individual pictures). The latter pictures will open up on your screen when clicked. I've tried to identify the participants, but there are still a few question marks, e.g. in pictures vanc0_33, vanc0_35, vanc1_09, vanc1_10, vanc2_15, vanc3_04, vanc4_02 and in the group picture. Please help me fill those gaps. Of course, if anybody objects to having his or her picture on display, I will remove it. Enjoy! -- Juergen Koslowski P.S. Please note: when you open up one of the group pictures and move the mouse cursor to a person's face, the name should show up, either in a little flag, or in the status bar, or, depending on your browser settings, in a pop-up window. Let me know, if this does not work with your browser. --=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) 3-Dec-2004 08:29:09 -0400,2152;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Dec 2004 08:29:09 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CaBFP-0007Wn-00 for categories-list@mta.ca; Fri, 03 Dec 2004 07:05:11 -0400 Date: Thu, 2 Dec 2004 10:57:32 +0100 Mime-Version: 1.0 (Apple Message framework v543) Content-Type: text/plain; charset=US-ASCII; format=flowed Subject: categories: Credits ? From: jean benabou To: Categories Content-Transfer-Encoding: 7bit Message-Id: <96013B20-4448-11D9-9908-000393B90F2C@wanadoo.fr> X-Mailer: Apple Mail (2.543) Sender: cat-dist@mta.ca Precedence: bulk Dear category theorists, From time to time in this list appear discussions about : who must be credited for a result or the introduction of a new notion. Although I have been quite "surprised" by some of the answers, I have so far refrained from participating in such discussions, especially because I was often directly concerned. I break this "personal rule" because of the answer given by Claudio Harmida to Agusti Roig about 2-fibrations. For these, he refers to two papers of his, the fist one published in 1999, the second presented in september 2002 and still in print. The notions of 2-fibration, and 2-stack, are MUCH MUCH OLDER. They appear, and are used in the following BOOK: Topos anneles et schemas relatifs, by Monique Hakim in 1972 (Volume 64 of the "Ergebnisse der Matemematik" of Springer) I would like to stress the fact that the book is easily available and in english (which seem to be almost necessary, but far from sufficient, conditions to get some recognition). If we drop the conditions of availability and english, the previous notions were introduced, and used, as early as 1967, in Hakim's thesis (Faculte des sciences d'Orsay), unpublished but widely known at least in France, since at the time Hakim was a student of Grothendieck, who was the adviser and gave her many ideas for her work. I apologize both for my english, and for going back to prehistory to find origins. 3-Dec-2004 08:29:09 -0400,1087;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Fri, 03 Dec 2004 08:29:09 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CaBIx-0007ce-00 for categories-list@mta.ca; Fri, 03 Dec 2004 07:08:51 -0400 X-Authentication-Warning: triples.math.mcgill.ca: barr owned process doing -bs Date: Thu, 2 Dec 2004 11:34:18 -0500 (EST) From: Michael Barr X-X-Sender: barr@triples.math.mcgill.ca To: Categories list Subject: categories: Simplicial groups Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Back in the mid 60s, I read a paper (or maybe a preprint) by John Moore showing that simplicial groups are Kan complexes. As I look through MathSciNet, I can find nothing like that among Moore's publications. Does anyone know if this was published or does anyone have a copy? Or can anyone give me a reference for the fact? Michael 4-Dec-2004 12:23:53 -0400,2344;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 04 Dec 2004 12:23:53 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cacc9-0003RW-00 for categories-list@mta.ca; Sat, 04 Dec 2004 12:18:29 -0400 From: Robert Knighten MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <16816.58341.875938.576455@zeus.knighten.org> Date: Fri, 3 Dec 2004 14:08:37 -0800 To: Categories list Subject: categories: Re: Simplicial groups In-Reply-To: References: X-Mailer: VM 7.17 under Emacs 21.3.2 Reply-To: Robert@Knighten.org (Robert L. Knighten) Sender: cat-dist@mta.ca Precedence: bulk Michael Barr writes: > Back in the mid 60s, I read a paper (or maybe a preprint) by John Moore > showing that simplicial groups are Kan complexes. As I look through > MathSciNet, I can find nothing like that among Moore's publications. Does > anyone know if this was published or does anyone have a copy? Or can > anyone give me a reference for the fact? > > Michael > To answer the last question first the fact is Lemma 3.4 (credited to Moore) in Paul G. Goerss, John F. Jardine Simplicial Homotopy Theory Birkhauser (1999) I believe Moore published it as part of his outline of simplicial theory in @incollection {MR0111027, AUTHOR = {Moore, John C.}, TITLE = {Semi-simplicial complexes and {P}ostnikov systems}, BOOKTITLE = {Symposium internacional de topolog\'\i a algebraica International symposium on algebraic topology}, PAGES = {232--247}, PUBLISHER = {Universidad Nacional Aut\'onoma de M\'exico and UNESCO, Mexico City}, YEAR = {1958}, MRCLASS = {55.00}, MRNUMBER = {MR0111027 (22 \#1894)}, MRREVIEWER = {J. A. Zilber}, } and that the notes you reference were from his 1956 Princeton Seminar on Algebraic Homotopy Theory. I have long since lost my copy of the notes, and cannot find a copy of the above paper, so these last two have to be considered speculative memories. -- Bob -- Robert L. Knighten Robert@Knighten.org 6-Dec-2004 21:17:25 -0400,1448;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 06 Dec 2004 21:17:25 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CbTrG-0004tc-00 for categories-list@mta.ca; Mon, 06 Dec 2004 21:09:38 -0400 Date: Sun, 5 Dec 2004 17:40:12 -0500 (EST) Message-Id: <200412052240.iB5MeCaA225613@hypatia.unh.edu> From: Donovan Van Osdol To: categories@mta.ca In-reply-to: (message from Michael Barr on Thu, 2 Dec 2004 11:34:18 -0500 (EST)) Subject: Re: categories: Simplicial groups References: X-MailScanner-Information: http://pubpages.unh.edu/notes/mailfiltering.html X-MailScanner: Found to be clean X-MailScanner-SpamCheck: not spam, SpamAssassin (score=-5.728, required 5, autolearn=not spam, ALL_TRUSTED -3.30, AWL 0.17, BAYES_00 -2.60) X-MailScanner-From: dv@hypatia.unh.edu Sender: cat-dist@mta.ca Precedence: bulk Michael-- The earliest published proof I know of is in Peter May's classic Simplicial Objects in Algebraic Topology, D. Van Nostrand Mathematical Studies #11 (1967) on pages 67-68. He credits John Moore and references mimeographed Princeton notes of 1956: Seminar on Algebraic Homotopy Theory. I don't know if the proof May gives is the one Moore gave but I suspect it is. Don 6-Dec-2004 21:17:25 -0400,2133;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 06 Dec 2004 21:17:25 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CbTsd-0004wp-00 for categories-list@mta.ca; Mon, 06 Dec 2004 21:11:03 -0400 Message-ID: <41B430CE.5040309@informatics.bangor.ac.uk> Date: Mon, 06 Dec 2004 10:13:34 +0000 From: Prof T Porter User-Agent: Mozilla Thunderbird 0.9 (X11/20041130) X-Accept-Language: en-us, en MIME-Version: 1.0 To: Categories list Subject: categories: Re: Simplicial groups References: In-Reply-To: Content-Type: text/plain; charset=US-ASCII; format=flowed Content-Transfer-Encoding: 7bit X-Informatics-MailScanner-Information: Please contact the ISP for more information X-Informatics-MailScanner: Found to be clean Sender: cat-dist@mta.ca Precedence: bulk Michael Barr wrote: >Back in the mid 60s, I read a paper (or maybe a preprint) by John Moore >showing that simplicial groups are Kan complexes. As I look through >MathSciNet, I can find nothing like that among Moore's publications. Does >anyone know if this was published or does anyone have a copy? Or can >anyone give me a reference for the fact? > >Michael > > > > Dear Mike and everyone, There is a proof in Peter May's little book and some indication in the survey article by Curtis (but his formaule do not work). The nice thing about the result is not that it is true but that it is possible to construct formulae for the fillers EXPLICITLY from the information on the horns. Heiner Kamps and myself used this approach in our book and it seemed to us better to introduce the problem and then get the reader to investigate the algorithmic idea rather than giving the solution as the latter does not tell you where the formulae came from. Robert Knighten's reference to being in Moore's seminar notes is the earliest I have seen it as well. Tim Porter 7-Dec-2004 17:23:12 -0400,1945;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 07 Dec 2004 17:23:12 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cbmk7-00039q-00 for categories-list@mta.ca; Tue, 07 Dec 2004 17:19:31 -0400 Message-ID: <41B4434E.50207@durham.ac.uk> Date: Mon, 06 Dec 2004 11:32:30 +0000 From: Susan Bates User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.0.1) Gecko/20020823 Netscape/7.0 (CK-ITS) X-Accept-Language: en-us, en MIME-Version: 1.0 To: categories@mta.ca Subject: categories: UNIVERSITY OF DURHAM - CHAIR POSTS Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit X-DurhamAcUk-MailScanner: Found to be clean, Found to be clean Sender: cat-dist@mta.ca Precedence: bulk UNIVERSITY OF DURHAM DEPARTMENT OF COMPUTER SCIENCE 2 Chairs in Computer Science The Department of Computer Science at the University of Durham is to make 2 appointments at the level of Chair. These are non-fixed-term positions and are tenable from 1st April 2005 or from a mutually acceptable date thereafter. Applicants should have research interests related to the research currently pursued within the Department, and persons with research interests in aspects of Software Engineering are particularly encouraged to apply. Further details can be found at: http://jobs.dur.ac.uk Potential candidates are encouraged to contact Professor Iain Stewart (Head of Department) for informal discussions: e-mail: i.a.stewart@durham.ac.uk; tel: +44 (0)191 334 1720. The closing date for applications is 31st January 2005. -- Professor Iain A. Stewart Department of Computer Science University of Durham Science Labs South Road Durham DH1 3LE Tel: 0191 334 1720 Fax: 0191 334 1701 E-mail: i.a.stewart@durham.ac.uk WWW: http://www.dur.ac.uk/i.a.stewart 7-Dec-2004 17:23:12 -0400,2331;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 07 Dec 2004 17:23:12 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CbmmS-0003GY-00 for categories-list@mta.ca; Tue, 07 Dec 2004 17:21:56 -0400 Message-ID: <41B57DD4.5F9CC1DA@maths.uct.ac.za> Date: Tue, 07 Dec 2004 11:54:28 +0200 From: George Janelidze Organization: University of Cape Town X-Mailer: Mozilla 4.75 [en] (Windows NT 5.0; U) X-Accept-Language: en MIME-Version: 1.0 To: Categories list Subject: categories: Re: Simplicial groups References: <41B430CE.5040309@informatics.bangor.ac.uk> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Dear Colleagues, The question Michael asked has already been answered by several people. However I would like to comment on Tim's "EXPLICITLY": A simplicial group is a simplicial object in the category of groups, which is a Mal'tsev category (some people use wrong spelling "Mal'cev"), and - as I know from Aurelio Carboni - every simplicial object in a Mal'tsev category is a Kan complex. This also tells me that the formulae Tim is mentioning should in fact involve just the Mal'tsev operation m (recall that for groups one can put m(x,y,z) = x-y+z for the m, in the additive notation). There must be something like this in Jonathan Smith's "Mal'tsev varieties". George Janelidze Prof T Porter wrote: > Dear Mike and everyone, > > There is a proof in Peter May's little book and some indication in the > survey article by Curtis (but his formaule do not work). The nice thing > about the result is not that it is true but that it is possible to > construct formulae for the fillers EXPLICITLY from the information on > the horns. Heiner Kamps and myself used this approach in our book and it > seemed to us better to introduce the problem and then get the reader to > investigate the algorithmic idea rather than giving the solution as the > latter does not tell you where the formulae came from. > > Robert Knighten's reference to being in Moore's seminar notes is the > earliest I have seen it as well. > > Tim Porter 7-Dec-2004 17:23:12 -0400,1515;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 07 Dec 2004 17:23:12 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cbml5-0003CT-00 for categories-list@mta.ca; Tue, 07 Dec 2004 17:20:31 -0400 Message-ID: <001a01c4dc38$3229dc60$87e493d9@sandro> From: "Mamuka Jibladze" To: References: <41B430CE.5040309@informatics.bangor.ac.uk> Subject: categories: Re: Simplicial groups Date: Tue, 7 Dec 2004 12:37:07 +0400 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk There is a proof in Peter May's little book and some indication in the survey article by Curtis (but his formaule do not work). Tim, do you mean that the proof Curtis gives is erroneous? It is = important for me to know what exactly is wrong there. You see, with = Pirashvili we have a note (in Georgian Math. J. 9 (2002) 71-74, and = still online at http://arxiv.org/abs/math.AT/0106143) about a = generalization of that proof to any Maltsev varieties. Although we = needed a slight modification, till this moment I was sure that the = original formul=E6 were also fine. Btw, there was also another proof by Carboni, Kelly and Pedicchio in = Appl. Categ. Struct. 1 (1993) 385-421, working for any Maltsev = categories. Mamuka Jibladze 7-Dec-2004 17:23:22 -0400,7704;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 07 Dec 2004 17:23:22 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cbmnk-0003L2-00 for categories-list@mta.ca; Tue, 07 Dec 2004 17:23:16 -0400 Date: Tue, 7 Dec 2004 12:57:08 GMT Message-Id: <200412071257.iB7Cv8hc026056@balmullo.inf.ed.ac.uk> To: categories@mta.ca From: Alex Simpson Subject: categories: LICS 2005: Second CFP Reply-To: als+lics-replies-ignored@dcs.ed.ac.uk Sender: cat-dist@mta.ca Precedence: bulk CALL FOR PAPERS Twentieth Annual IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS 2005) June 26th -- 29th, 2005, Chicago, Illinois http://www.lfcs.informatics.ed.ac.uk/lics/ The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest for submissions include: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, domain theory, finite model theory, formal aspects of program analysis, formal methods, hybrid systems, lambda and combinatory calculi, linear logic, logical aspects of computational complexity, logics in artificial intelligence, logics of programs, logic programming, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, reasoning about security, rewriting, specifications, type systems and type theory, and verification. We welcome submissions in emergent areas, such as bioinformatics and quantum computation, if they have a substantial connection with logic. Invited Speakers: Michael Benedikt, Bell Laboratories; Solomon Feferman, Stanford University; Walter Fontana, Harvard University; Jane Hillston, University of Edinburgh and Glynn Winskel, University of Cambridge. Important Dates: Authors are required to submit a paper title and a short abstract of about 100 words before submitting the extended abstract of the paper. All submissions will be electronic. TITLES & SHORT ABSTRACTS DUE: 5TH JANUARY 2005 EXTENDED ABSTRACTS DUE: 10TH JANUARY 2005 Author Notification: 18th March 2005 Camera-ready Papers Due: 8th April 2005. All deadlines are firm; late submissions will not be considered. Detailed information about electronic paper submission will be posted at the LICS website. Submission Instructions: Every extended abstract must be submitted in the IEEE Proceedings two-column camera-ready format. It must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work should be included. Extended abstracts may be no longer than 10 pages including references, and must be formatted in the IEEE Proceedings two-column camera-ready style (IEEE style files will be accessible from the LICS website). If necessary, detailed proofs of technical results can be included in a clearly-labelled appendix in the same two-column format following the 10-page extended abstract or there can be a pointer to a manuscript on a web site. This material may be read at the discretion of the program committee. Extended abstracts not conforming to the above requirements concerning format and length may be rejected without further consideration. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The PC chair should be informed of closely related work submitted to a conference or journal between 10th January 2005 and 18th March 2005. All authors of accepted papers will be expected to sign copyright release forms. One author of each accepted paper will be expected to present it at the conference. Short Presentations: LICS 2005 will have a session of short (5--10 minutes) presentations. This session is intended for descriptions of work in progress, student projects, and relevant research being published elsewhere; other brief communications may be acceptable. Submissions for these presentations, in the form of short abstracts (1 or 2 pages long), should be entered at the LICS 2005 submission site between 19th March and 25th March 2005. Authors will be notified of acceptance or rejection by 1st April 2005. Kleene Award for Best Student Paper: An award in honour of the late S.C. Kleene will be given for the best student paper, as judged by the program committee. Details concerning eligibility criteria and procedure for consideration for this award will be posted at the LICS website. The program committee may decline to make the award or may split it among several papers. Affiliated Workshops: As in previous years, there will be a number of workshops affiliated with LICS 2005; information will be posted at the LICS website. Sponsorship: The symposium is sponsored by the IEEE Technical Committee on Mathematical Foundations of Computing in cooperation with the Association for Symbolic Logic, and the European Association for Theoretical Computer Science. Program Chair: Prakash Panangaden School of Computer Science McGill University Montreal, Quebec Canada Email: prakash@cs.mcgill.ca Phone: + 1 514 398 7074 Fax: + 1 514 398 3883 Program Committee: Jiri Adamek Technical University of Braunschweig Luca de Alfaro U. of California, Santa Cruz Andrei Bulatov Simon Fraser University Hubert Comon-Lundh ENS Cachan Philippa Gardner Imperial College Martin Grohe Humboldt-Universitat zu Berlin Neil Immerman U. of Massachusetts, Amherst Marta Kwiatkowska University of Birmingham Maurizio Lenzerini Universita di Roma Guy McCusker University of Sussex Larry Moss University of Indiana Prakash Panangaden McGill University Frank Pfenning Carnegie-Mellon University Toniann Pitassi University of Toronto Uday Reddy University of Birmingham Thomas Schwentick Philipps-Universitat Marburg Peter Selinger University of Ottawa N. Shankar SRI International Igor Walukiewicz Universite Bordeaux Conference co-Chairs: Alan Jeffrey, Radhakrishnan Jagadeesan School of CTI DePaul University Chicago, Illinois USA ajeffrey@cs.depaul.edu rjagadeesan@cs.depaul.edu Workshops Chair: Philip J. Scott, U. of Ottawa phil@site.uottawa.ca Publicity Chair: Alex Simpson, U. of Edinburgh Alex.Simpson@ed.ac.uk General Chair: Phokion G. Kolaitis, U. of California, Santa Cruz kolaitis@cs.ucsc.edu Organizing Committee: Samson Abramsky, Andrei Broder, Sam Buss, Edmund Clarke, Amy Felty, Hal Gabow, Lauri Hella, Radha Jagadeesan, Alan Jeffrey, Ulrich Kohlenbach, Phokion Kolaitis, Janos Makowsky, John Mitchell, Mogens Nielsen, Prakash Panangaden, Frank Pfenning, Gordon Plotkin, Femke van Raamsdonk, Philip Scott, Alex Simpson, Andrei Voronkov. Advisory Board: Robert Constable, Yuri Gurevich, Claude Kirchner, Dexter Kozen, Ursula Martin, Albert Meyer, Leszek Pacholski, Vaughan Pratt, Andre Scedrov, Moshe Y. Vardi, Glynn Winskel 9-Dec-2004 13:30:43 -0400,4036;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 09 Dec 2004 13:30:43 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CcS4d-00065F-00 for categories-list@mta.ca; Thu, 09 Dec 2004 13:27:27 -0400 X-Authentication-Warning: client129.comlab: drg owned process doing -bs Date: Thu, 9 Dec 2004 14:04:23 +0000 (GMT) From: Dan Ghica To: Subject: categories: CFP: Games for Logic and Programming Languages Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk CALL FOR PAPERS: Games for Logic and Programming Languages An Etaps 2005 Workshop Edinburgh, 2-3 April 2005 [http://users.ox.ac.uk/%7Ecoml0074/galop.html] In the past decade game semantics has emerged as a new and successful paradigm in the field of semantics of logics and programming languages. Game semantics made its breakthrough in computer science in the early 90s, providing an innovative set of methods and techniques for the analysis of logical systems. Subsequently, game-semantic techniques led to the development of the first syntax-independent fully-abstract models for a variety of programming languages, ranging from the purely functional to languages with non-functional features such as control, references or concurrency. There are also emerging connections between game semantics and other semantic theories, notably theories of concurrency such as the pi-calculus, and traditional tree-based semantics of lambda calculi. In addition to semantic analysis, an algorithmic approach to game semantics has recently been developed, with a view to applications in computer assisted verification and program analysis. The aim of the workshop is to provide opportunity for interaction with other Etaps'05 events and to become a major meeting point in the research area of Game Semantics and its applications. Invited speakers * Luke Ong, Oxford University * Luca de Alfaro, University of California, Santa Cruz Publication This is intended to be an informal workshop. Participants are encouraged to present work in progress, overviews of more extensive work, and programmatic/position papers, as well as completed projects. We therefore ask for submission both of short abstracts outlining what will be presented at the workshop and of longer papers describing completed work, either published or unpublished, in the following areas: * Game theory and interaction models in semantics * Games-based design and verification * Logics for games and games for logics * Algorithmic aspects of games In order to make a submission: * Format your file using the LNCS guidelines. We suggest a 15 page limit. * Email a PostScript or PDF version to dan.ghica@comlab.ox.ac.uk. A participants' proceedings will be distributed at the workshop and made available as a Oxford University technical report. A special journal issue associated with the workshop is being considered; this will be discussed at the workshop. Important dates * Submission due: January 15th * Notification of acceptance: February 15th * Final version due: March 1st * Workshop dates: April 2-3, 2005. Program committee: Samson Abramsky, Oxford University Pierre-Louis Curien, Universite Paris 7 Russ Harmer, Universite Paris 7 Kohei Honda, Queen Mary University of London Furio Honsell, University of Udine Martin Hyland, Cambridge University Radha Jagadeesan, DePaul University Jim Laird, University of Sussex Thomas Streicher, Universitaet Darmstadt Chairs: Dan Ghica, Oxford University Guy McCusker, University of Sussex 13-Dec-2004 13:27:38 -0400,3468;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 13 Dec 2004 13:27:38 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cdtus-00058z-00 for categories-list@mta.ca; Mon, 13 Dec 2004 13:23:22 -0400 Message-ID: <41BD63C9.5000101@upb.de> Date: Mon, 13 Dec 2004 10:41:29 +0100 From: Alexey Cherchago User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:0.9.4.1) Gecko/20020508 Netscape6/6.2.3 X-Accept-Language: en-us MIME-Version: 1.0 To: categories Subject: categories: short summary of the discussion about fibrations References: <200411280431.iAS4Vxv10570@awk.ucsd.edu> Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Sender: cat-dist@mta.ca Precedence: bulk Dear category theorists, Thanks a lot for your answers. I decided to prepare a short summary of the discussion about (co)completeness of fibrations. Fibrations (arise, e.g., by a flattening construction from an indexed category) provide an appropriate mathematical tool for describing morphisms between objects of different types. In the case of my research, these objects are typed graphs and typed graph transformation rules or productions comprised in graph transformation systems (GTS). (Co)completeness property becomes very important under the construction of new GTS from the existing ones, e.g., different kinds of compositions of two GTSs over the third one. 1. Completeness of flattened categories: If C:Ind_Op -> Cat is an indexed category such that 1. Ind is complete, 2. C_i is complete for all i in (Ind)_obj, and 3. C_m : C_j -> C_i is continuous for all index morphisms m: i -> j, then Flat(C) is complete. 2. Cocompleteness of flattened categories: If C:Ind_Op -> Cat is an indexed category such that 1. Ind is cocomplete, 2. C_i is cocomplete for all i in (Ind)_obj, and 3. C is locally reversible (i.e., if for each index morphism m: i -> j in Ind, the translation functor C_m : C_j -> C_i has a left adjoint), then Flat(C) is cocomplete. Finally, I have collected all the references containing in the answers to my question. 1. @InCollection(Gray66, Author={Gray, J. W.}, Title={Fibred and Cofibred categories}, Booktitle={Proceedings of the Conference on Categorical Algebra}, Editor={Eilenberg, S.}, Publisher= sv, Year=1966) 2 @article(fun3, title = "Some Fundamental Algebraic Tools for the Semantics of Computation, Part 3: Indexed Categories", author = "Andrzej Tarlecki and Rod Burstall and Joseph Goguen", journal = "Theoretical Computer Science", year = 1991, volume = 91, pages = "239--264") 3. Agusti Roig. Model category structures in bifibred categories JPAA 95, (1994), 203 - 223 4. @Article{Hermida96a, author = {Hermida, C.}, title = {Some properties of {\textbf{{F}ib}} as a fibred 2-category}, journal = jpaa, year = {1999}, volume = {134}, number = {1}, pages = {83-109}, note = {Presented at ECCT'94, Tours, France.} } 5. @BOOK{Jacobs99, author = "Jacobs, B.", title = "Categorical logic and type theory", publisher = nh, volume = "141", series = "Studies in Logic and the Foundations of Mathematics", year = 1999 } Best regards, Alexey Cherchago 13-Dec-2004 13:27:38 -0400,3032;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 13 Dec 2004 13:27:38 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cdtsa-0004zq-00 for categories-list@mta.ca; Mon, 13 Dec 2004 13:21:00 -0400 Date: Mon, 13 Dec 2004 01:22:32 -0500 From: James Lipton User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.4) Gecko/20030630 X-Accept-Language: en-us, en, es-es MIME-Version: 1.0 To: categories@mta.ca Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Subject: categories: Tenure track position Sender: cat-dist@mta.ca Precedence: bulk Message-Id: The Department of Mathematics and Computer Science at Wesleyan University is seeking to fill a tenure-track computer science position at the level of Assistant Professor or Associate Professor without tenure starting in the fall term of 2005. Candidates for the position should have a PhD or be near completion of a PhD in Computer Science or a related area. The Department ( http://www.math-cs.wesleyan.edu) currently has four full-time computer scientists with research interests in algorithms, bioinformatics, programming languages, and computational logic. There is excellent interaction with faculty in the department in the fields of combinatorics and logic and with faculty in the sciences through an inter-disciplinary initiative in integrative genomic sciences. The Department has undergraduate degree programs in both mathematics and computer science as well as active MA and PhD programs. The teaching load in Computer Science is three courses per academic year. Outstanding candidates in any area of computer science are encouraged to apply. We are looking for candidates with excellent research records and a strong commitment to undergraduate and graduate instruction, who are prepared to contribute to the standard undergraduate curriculum in computer science and to play an active role in the graduate program. Wesleyan is a highly selective university that offers a unique combination of liberal-arts college spirit in the classroom with an unusually strong commitment to research for a school of its size. The student body is made up of approximately 2900 full-time undergraduates and graduate students in 41 departments and programs. Wesleyan University is an equal opportunity/affirmative action employer. Women and minorities are encouraged to apply. Inquiries about the position may be sent to csjob@wesleyan.edu. Consideration of applications will begin January 3, 2005 and will continue until the position is filled. Applicants should arrange to have at least three letters of recommendation, including one letter that evaluates teaching qualifications, sent directly to the following address: Computer Science Search Committee Department of Mathematics & Computer Science Wesleyan University Middletown, CT 06459-0128 14-Dec-2004 10:07:36 -0400,8224;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 14 Dec 2004 10:07:36 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CeDHK-0007dc-00 for categories-list@mta.ca; Tue, 14 Dec 2004 10:03:50 -0400 Message-ID: <41BEC5DF.9050200@swan.ac.uk> Date: Tue, 14 Dec 2004 10:52:15 +0000 From: Markus Roggenbach Subject: CFP CALCO To: categories@mta.ca User-Agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.3.1) Gecko/2003042= We apologise if you receive multiple copies. *--------------------------------------------------------------------* * 3nd Call for Papers * * * * CALCO 2005 * * * * =091st Conference on Algebra and Coalgebra in Computer Science * * * * September 3-6, 2005, Swansea, Wales, UK * * * *--------------------------------------------------------------------* * Abstract submission : January 21, 2005 * * Technical paper submission: January 31, 2005 * * Author notification: April 11, 2005 * *--------------------------------------------------------------------* * http://www.cs.swan.ac.uk/calco/ * *--------------------------------------------------------------------* With the support of IFIP WG1.3 on Foundations of System Specification CMCS - the International Workshop on Coalgebraic Methods in Computer Science, and WADT - the Workshop on Algebraic Development Techniques, are joining their forces and reputations into a new high level bi-annual conference. Starting in 2005, CALCO will bring together researchers and practitioners to exchange new results related to foundational aspects and both traditional and emerging uses of algebras and coalgebras in computer science. CALCO 2005 will be preceded by a CALCO Young Researchers Workshop, CALCO-jnr, dedicated to presentations by PhD students and by those who completed their doctoral studies within the past few years (see www.cs.swan.ac.uk/calco-jnr/ for details). Topics of Interest ------------------ We invite submission of technical papers that report results of theoretical work on the mathematics of algebras and coalgebras, the way these results can support methods and techniques for software development, as well as experience with the transition of resulting technologies into industrial practise. We encourage submissions in topics included or related to those in the lists below. Algebras and coalgebras as mathematical objects: Automata and languages Categorical semantics Hybrid, probabilistic, and timed systems Inductive and coinductive methods Modal logics Relational systems and term rewriting Algebras and coalgebras in computer science: Abstract data types Algebraic and coalgebraic specification Calculi and models of concurrent, distributed, mobile, and context-aware computing Formal testing and quality assurance General systems theory and computational models (chemical, biological, etc) Generative programming and model-driven development Models, correctness and (re)configuration of hardware/middleware/architectures Re-engineering techniques (program transformation) Semantics of conceptual modelling methods and techniques Semantics of programming languages Validation and verification Submission Guidelines --------------------- Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Experience papers are welcome, but they must clearly present general lessons learned that would be of interest and benefit to a broad audience of both researchers and practitioners. Proceedings will be published in the Springer LNCS series. Final papers will be no more than 15 pages long in the format specified by Springer. It is recommended that submissions adhere to that format and length (see at http://www.springer.de/comp/lncs/authors.html). Submissions that are clearly too long may be rejected immediately. Proofs omitted due to space limitations may be included in a clearly marked appendix. Paper submissions will be made electronically at he conference web site. Both an abstract and the full paper must be submitted by their respective submission deadlines. A special issue of Theoretical Computer Science consisting of extended versions of selected papers will be produced after the conference if there are enough good papers that can be extended and revised to the standards of this journal. Invited Speakers ---------------- The so-far confirmed invited speakers for CALCO 05 are: * Samson Abramsky, Christopher Strachey Professor of Computer Science, University of Oxford, UK. * Vladimiro Sassone, Professor of Informatics, University of Sussex, UK. Important Dates (all in 2005) ----------------------------- Jan 21 Abstract submission due Jan 31 Technical paper submissions due April 11 Author notification May 30 Camera ready due Sept 3-6 CALCO technical programme Programme Committee ------------------- Jose Fiadeiro, University of Leicester, UK (co-chair) Jan Rutten, CWI & Free University Amsterdam, NL (co-chair) Luca Aceto, Aalborg University, DK, and Reykjav=EDk University, IS Jiri Adamek, University of Braunschweig, D Christel Baier, University of Bonn, D Michel Bidoit, CNRS, Cachan, F Jules Desharnais, Laval University, CAN Marie-Claude Gaudel, LRI-CNRS, Paris, F Reiko Heckel, University of Leicester, UK H.Peter Gumm, Philipps University, Marburg, D Ugo Montanari, University of Pisa, I Larry Moss, Indiana University, Bloomington, USA Peter Mosses, BRICS and University of Aarhus, DK, from 1.1.2005: University of Wales Swansea, UK Fernando Orejas, Politechnical University Catalunia, Barcelona, E Francesco Parisi-Presicce, George Mason University, Fairfax, USA John Power, University of Edinburgh, UK Horst Reichel, Technical University Dresden, D Eugene Stark, Stony Brook University, New York, USA Andrzej Tarlecki, Warsaw University, PL John Tucker, University of Wales Swansea, UK Martin Wirsing, Ludwig-Maximilian University, Muenchen, D Steering Committee ------------------ Jiri Adamek, Nakagawa Ataru, Michel Bidoit, Jose Fiadeiro (co-chair), H.Peter Gumm, Bart Jacobs Hans- Jorg Kreowski, Ugo Montanari, Larry Moss, Peter Mosses, Fernando Orejas, Francesco Parisi-Presicce, John Power, Horst Reichel, Markus Roggenbach, Jan Rutten (co-chair), Andrzej Tarlecki Organising Committee -------------------- Neal Harman and Markus Roggenbach, University of Wales Swansea, UK Location and Organisation ------------------------- The City of Swansea dates from the 10th Century AD and is currently an expanding centre for high tech. industry. Swansea is located at the centre of the South Wales coastline, next to the Gower peninsula, renowned for its dramatic coastal scenery and beaches. The conference will be held on the Swansea University campus overlooking the sea. Accommodation will be available in newly built halls of residence and also in a small selection of good quality hotels. A full social programme drawing on the culture of the area will complement the scientific event. This CFP version dated: 14th December 2004. --=20 ------------------------------------------------------------------- Markus Roggenbach Phone +44-1792-51-3578 Dept. of Computer Science Fax +44-1792-295708 University of Wales Swansea M.Roggenbach@Swan.ac.uk Singleton Park http://www.cs.swan.ac.uk/~csmarkus Swansea SA2 8PP, United Kingdom -------------------------------------------------------------------- 14-Dec-2004 10:07:36 -0400,5844;000000000001-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 14 Dec 2004 10:07:36 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CeDGN-0007bI-00 for categories-list@mta.ca; Tue, 14 Dec 2004 10:02:51 -0400 Message-ID: <41BD6800.9070703@imag.fr> Date: Mon, 13 Dec 2004 10:59:28 +0100 From: Susanne Graf User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.7.3) Gecko/20040910 X-Accept-Language: fr, en-us, en, de-de MIME-Version: 1.0 To: verimag-news@imag.fr Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Subject: categories: CFP: SPIN 2005 - Workshop on Model Checking of Software Sender: cat-dist@mta.ca Precedence: bulk SPIN 2005 Call for Papers 12th International SPIN Workshop on Model Checking of Software August 22-24, 2005, San Francisco, USA (Co-located with CONCUR 2005) http://cm.bell-labs.com/cm/cs/what/spin2005/index.html SPIN 2005 solicits previously unpublished, currently unsubmitted, original contributions addressing theoretical, experimental and applied problems in model checking of software artifacts. Particular topics include: * model-checking based tools, tool extensions and comparative studies * theoretical and algorithmic foundations of model-checking based analysis * combination of model-checking techniques with other analysis techniques * model checking of programming languages and code analysis * techniques for analyzing and testing large and infinite state systems * model checking in the system life-cycle * innovative applications of model checking, including o model checking of object-oriented and component based systems o model checking of security systems o model checking of real-time systems * engineering of model-checking tools and platforms * convincing case studies which apply model-checking to real software systems Submissions will be judged on originality, significance, correctness, and clarity. A submitted paper should clearly express the contribution of the work, both in general and in technical terms. It is essential to identify what was accomplished, describe the significance of the work, and explain how the paper compares with, and improves upon, previous work. Although authors are encouraged to compare their work with existing model checkers such as SPIN, the scope of the workshop is not limited to topics directly related to the SPIN system. We solicit submissions of two categories of papers: Full papers: submissions are limited to 15 pages, and should adhere to Springer Verlag's LNCS format, preferably using LaTeX. The format of the submissions should be either pdf or postscript. Authors who feel it is absolutely necessary to include additional material may place it in a well-marked appendix after page 15, but committee members are under no obligation to review this material. Tool presentations: SPIN 2005 solicits proposals for the demonstration of tools pertinent to the technical objective of this workshop. Proposals should be submitted as a summary of up to 5 pages (using Springer Verlag's LNCS format) which will be included in the workshop proceedings. The title of the summary should clearly indicate that this is a tool demonstration summary. Longer tool-related contributions should be submitted as full papers. Accepted contributions will be included in the workshop proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. Important Dates =============== April 1, 2005 Submission deadline for Abstracts April 8, 2005 Submission deadline for Papers May 16, 2005 Notification of acceptance June 13, 2005 Final version of papers due August 22-24, 2005 SPIN 2005 in San Francisco Invited Speakers: Rajeev Alur (University of Pennsylvania) Dawson Engler (Stanford University) David Wagner (UC Berkeley) Invited Tutorials: Modex/Feaver by Gerard Holzmann and Theo Ruys BLAST by Tom Henzinger, Ranjit Jhala and Rupak Majumdar Java PathFinder by Willem Visser SPIN 2005 web-site: http://cm.bell-labs.com/cm/cs/what/spin2005/index.html Program Chair: Patrice Godefroid (Bell Laboratories, Lucent Technologies) Program Committee: George Avrunin (U. Mass. Amherst, USA) Dennis Dams (Bell Labs, USA) Stefan Edelkamp (U. Dortmund, Germany) Cormac Flanagan (UC Santa Cruz, USA) Jaco Geldenhuys (Tampere U., Finland) Patrice Godefroid (Bell Labs, USA; chair) Susanne Graf (Verimag, France) Gerard Holzmann (NASA JPL, USA) Sarfraz Khurshid (UT Austin, USA) Stefan Leue (U. Konstanz, Germany) Rupak Majumdar (UCLA, USA) Laurent Mounier (Verimag, France) Shaz Qadeer (Microsoft, USA) Theo Ruys (U. Twente, the Netherlands) Willem Visser (NASA Ames, USA) Pierre Wolper (U. Liege, Belgium) Advisory Committee: Gerard Holzmann (NASA JPL, USA; chair) Amir Pnueli (Weizmann Inst., Israel) Steering Committee: Thomas Ball (Microsoft, USA) Susanne Graf (Verimag, France) Stefan Leue (U. Konstanz, Germany) Moshe Vardi (Rice U., USA) Pierre Wolper (U. Liege, Belgium; chair) -- ------------------------------------------------------------------------ Susanne Graf | tel : (+33) (0)4 56 52 03 52 VERIMAG | fax : (+33) (0)4 56 52 03 44 2, avenue de Vignate | http://www-verimag.imag.fr/~graf/ F - 38610 Gieres | e-mail: Susanne.Graf@imag.fr ------------------------------------------------------------------------ 26-Dec-2004 12:18:15 -0400,919;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 26 Dec 2004 12:18:15 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CiazS-00062e-00 for categories-list@mta.ca; Sun, 26 Dec 2004 12:11:30 -0400 Message-ID: <1049.203.173.5.180.1103697765.squirrel@webmail.rsise.anu.edu.au> Date: Wed, 22 Dec 2004 17:42:45 +1100 (EST) Subject: categories: Duality of linear programming From: "Agnes Boskovitz" To: categories@mta.ca Reply-To: agnes.boskovitz@anu.edu.au User-Agent: SquirrelMail/1.4.2 MIME-Version: 1.0 Content-Type: text/plain;charset=iso-8859-1 X-Priority: 3 Importance: Normal Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Can anyone tell me where I might read about linear programming duality from the point of view of category theory? Agnes Boskovitz 26-Dec-2004 12:18:15 -0400,1012;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 26 Dec 2004 12:18:15 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1Cib0A-00065g-00 for categories-list@mta.ca; Sun, 26 Dec 2004 12:12:14 -0400 Mime-Version: 1.0 (Apple Message framework v619) Content-Type: text/plain; charset=US-ASCII; format=flowed Message-Id: Content-Transfer-Encoding: 7bit From: Pedro Resende Subject: categories: preprint on groupoids and quantales Date: Fri, 24 Dec 2004 13:43:58 +0000 To: Categories list X-Mailer: Apple Mail (2.619) Sender: cat-dist@mta.ca Precedence: bulk I have placed in the arXiv a preprint on (mostly etale) groupoids and quantales (59 pages) that contains material about which I talked last Spring in Coimbra, at CT04 in Vancouver, and recently in Cambridge. http://arXiv.org/abs/math/0412478 Best wishes, Pedro. 28-Dec-2004 23:30:26 -0400,1509;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 28 Dec 2004 23:30:26 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1CjUQ5-0002rE-00 for categories-list@mta.ca; Tue, 28 Dec 2004 23:22:41 -0400 Date: Mon, 27 Dec 2004 19:06:52 +0100 Mime-Version: 1.0 (Apple Message framework v543) Content-Type: text/plain; charset=ISO-8859-1; format=flowed Subject: categories: A question for topos theorists. From: jean benabou To: Categories Content-Transfer-Encoding: quoted-printable Message-Id: <1618BC54-5832-11D9-A483-000393B90F2C@wanadoo.fr> X-Mailer: Apple Mail (2.543) Sender: cat-dist@mta.ca Precedence: bulk I have recently come across a question, which seems to me natural, and=20= before trying to solve it, I wanted to know if an answer was already=20 known. If E is a category with pullbacks so is the category Cat(E) having as=20= objects the internal categories of E and and as maps the internal=20 functors F: A ---> B. I shall say that such an F is a "Pi-functor" if=20= the pullback functor: Cat(E)/B --->Cat(E)/A has a right adjoint Pi/F:=20= Cat(E)/A---->Cat(E)/B When E=3DSet there is a well known Conduch=E9-Giraud condition=20 characterizing such functors. Is there such a characterization when E=20 is an (elementary) topos? If there is, what is the condition and where=20= can it be found? Best wishes to all, Jean=20= 2-Jan-2005 14:21:50 -0400,1490;000000000000-00000000 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sun, 02 Jan 2005 14:21:50 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.10) id 1ClADU-0004JF-00 for categories-list@mta.ca; Sun, 02 Jan 2005 14:12:36 -0400 Date: Thu, 30 Dec 2004 16:31:40 +0100 From: tgc@rap.dsi.unifi.it Message-Id: <200412301531.iBUFVesX020591@rap.dsi.unifi.it> To: categories@mta.ca Subject: categories: Trustworthy Global Computing Sender: cat-dist@mta.ca Precedence: bulk Dear Collegue, within ETAPS 2005, we are organizing a symposium on "Trustworthy Global Computing", http://www.cs.unibo.it/~sangio/TGC05/ The format is not that of a classical conference but one structured to leave room for discussions stimulated by a conspicuous number of invited talks (the above mentioned web page contains the full list of the 11 invited speakers) and by the papers selected after standard refereeing. Please consider submitting and distribute the CFP to members of your groups and departments. The important dates are - Deadline for papers submission: January 14, 2005 - Symposium: April 7-9, 2005 Best Wishes for the New Year. Rocco De Nicola, Davide Sangiorgi, Lorenzo Bettini ----------- you received this e-mail via the individual or collective address categories@mta.ca to unsubscribe from ETAPS list: contact etaps05@inf.ed.ac.uk -----------