From MAILER-DAEMON Tue Dec 19 08:46:04 2006 Date: 19 Dec 2006 08:46:04 -0400 From: Mail System Internal Data Subject: DON'T DELETE THIS MESSAGE -- FOLDER INTERNAL DATA Message-ID: <1166532364@mta.ca> X-IMAP: 1162901849 0000000010 Status: RO This text is part of the internal format of your mail folder, and is not a real message. It is created automatically by the mail system software. If deleted, important folder data will be lost, and it will be re-created with the data reset to initial values. From rrosebru@mta.ca Mon Nov 6 21:50:49 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 06 Nov 2006 21:50:49 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1GhFyq-0000A7-78 for categories-list@mta.ca; Mon, 06 Nov 2006 21:42:24 -0400 Date: Mon, 6 Nov 2006 14:39:47 +0100 (CET) From: Jiri Adamek To: categories net Subject: categories: reflexive coequalizers MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 1 The indiscrete-category functor I: Set -> Cat is not algebraically exact as I claimed in my posting of October 9. But I is a full codomain restriction of one: as in that posting, let F be the forgetful functor the Gabriel-Ulmer theory T of categories to the theory of sets. Then Alg F is an algebraically exact functor from Set to Alg T, and the Yoneda embedding Y: Cat -> Alg T is fully faithful (since the dual of T is dense in Cat). It is easy to see that Alg F is naturally isomorphic to Y.I , thus, I preserves sifted colimits. xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx alternative e-mail address (in case reply key does not work): J.Adamek@tu-bs.de xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx From rrosebru@mta.ca Sat Nov 11 09:23:48 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Sat, 11 Nov 2006 09:23:48 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1GisfB-0007YD-71 for categories-list@mta.ca; Sat, 11 Nov 2006 09:12:49 -0400 Date: Fri, 10 Nov 2006 18:42:57 -0800 (PST) From: Rob van Glabbeek and Peter Mosses To: categories@mta.ca Subject: categories: CfP: Special issue I&C on SOS From: Rob van Glabbeek Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: RO X-Status: X-Keywords: X-UID: 2 Call for Papers: Special Issue of Information & Computation on Structural Operational Semantics Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. Moreover, it is becoming a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalisation of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This special issue aims at documenting state-of-the-art research, new developments and directions for future investigation in the field of structural operational semantics. Specific topics of interest include (but are not limited to): * programming languages * process algebras * higher-order formalisms * rule formats for operational specifications * meaning of operational specifications * comparisons between denotational, axiomatic and operational semantics * compositionality of modal logics with respect to operational specifications * congruence with respect to behavioural equivalences * conservative extensions * derivation of proof rules from operational specifications * software tools that automate, or are based on, SOS. Papers reporting on applications of SOS to software engineering and other areas of computer science are welcome. This special issue is an outgrowth of the series of SOS workshops, which started in 2004, and serves in part as a opportunity to publish the full versions of the best papers presented at SOS 2006. However, papers that were not presented at SOS 2006 are equally welcome, and all submissions will be refereed and subjected to the same quality criteria, meeting the standards of Information and Computation. Papers submitted to the special issue must contain original material that has not previously been published, and parallel submission for publication elsewhere is not allowed. However, an extended abstract or short version of the paper may be submitted for presentation at the SOS 2007 workshop, which will take place before the publication of the special issue. PAPER SUBMISSION: We solicit unpublished papers reporting on original research on the general theme of SOS. Papers should take the form of a dvi, postscript or pdf file. We recommend following Elsevier's instructions at http://authors.elsevier.com/JournalDetail.html?PubID=622844 and using LaTeX2e with documentclass elsart. IMPORTANT DATES: * Submission of tentative title and abstract: 15 December 2006 * Submission of full paper: 15 February 2006 CONTACT and submission address: sos2006@cs.stanford.edu EDITORS of this special issue: Rob van Glabbeek National ICT Australia Locked Bag 6016 University of New South Wales Sydney, NSW 1466 Australia Peter D. Mosses Department of Computer Science Swansea University Singleton Park Swansea SA2 8PP United Kingdom From rrosebru@mta.ca Mon Nov 13 11:48:51 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 13 Nov 2006 11:48:51 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gjdt8-0005uP-Qh for categories-list@mta.ca; Mon, 13 Nov 2006 11:38:22 -0400 To: Categories Subject: categories: Morgan-Phoa Mathematics Workshop From: Ross Street Date: Sun, 12 Nov 2006 13:48:06 +1100 Content-Transfer-Encoding: 7bit Content-Type: text/plain;charset=US-ASCII;delsp=yes;format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 3 Anyone interested in category theory and related topics who can be in Canberra (Australia) at the end of November is welcome to join in the Morgan-Phoa Mathematics Workshop to be held at the Australian National University. I have set up a little Web page which I will update as the event approaches: . Ross From rrosebru@mta.ca Thu Nov 16 16:50:37 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Thu, 16 Nov 2006 16:50:37 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gko1d-0002tb-Gv for categories-list@mta.ca; Thu, 16 Nov 2006 16:39:57 -0400 Date: Thu, 16 Nov 2006 11:28:11 +0100 From: Till Mossakowski MIME-Version: 1.0 To: categories@mta.ca Subject: categories: 9 research assistant positions available Content-Type: text/plain; charset=ISO-8859-15 Content-Transfer-Encoding: quoted-printable Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 4 9 research assistant positions (most of them TVL 13, approx. =A4 35,000 to =A4 50,000 p.a. gross) available, at Transregional Collaborative Research Center SFB/TR 8 Spatial Cognition: Reasoning, Action, Interaction at the Universities of Bremen and Freiburg, Germany=09 The positions are in general concerned with interdisciplinary long-term research in Spatial Cognition. Some of the positions may be of interest to the readers of this list, because formal methods, logic and category theory are used. For details, see http://www.sfbtr8.uni-bremen.de/openpositions.html (in particular, projects I1, I3 and I4) --=20 Till Mossakowski Office: Phone +49-421-218-64226 DFKI Lab Bremen Cartesium Fax +49-421-218-9864226 Robert-Hooke-Str. 5 Enrique-Schmidt-Str. 5 till@tzi.de D-28359 Bremen Room 2.051 http://www.tzi.de/~till From rrosebru@mta.ca Tue Nov 21 19:35:06 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 21 Nov 2006 19:35:06 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gmewh-0002aE-Hk for categories-list@mta.ca; Tue, 21 Nov 2006 19:22:31 -0400 Date: Tue, 21 Nov 2006 08:55:31 -0500 From: jim stasheff To: EMJ@LISTSERV.ALBANY.EDU Subject: categories: Re: NUMDAM progress Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 5 **************************************************************** * archive: http://listserv.albany.edu:8080/archives/emj.html * **************************************************************** Wow! yes, especially the Seminaire H Cartan jim Larry Siebenmann wrote: > **************************************************************** > * archive: http://listserv.albany.edu:8080/archives/emj.html * > **************************************************************** > > *** NUMDAM progress > > > Dear Friends, > > Digitization continues, particularly in Europe. > You will find much good mathematics not easily accessible > otherwise at : > > http://archive.numdam.org/numdam-bin/browse > > Here is the impressive list of Journals etc. now scanned. > I was particularly pleased to find the Cartan Seminar > and numerous cousins. > > > JOURNAUX > > Annales de la facult'e des sciences de Toulouse 1887-1936 1937-2002 > Annales de l'institut Fourier 1949-2000 > Annales de l'institut Henri Poincar'e 1930-1964 > Annales de l'institut Henri Poincar'e (A) Physique th'eorique 1964-1983 1984-1999 > Annales de l'institut Henri Poincar'e (B) Probabilit'es et Statistiques 1964-2000 > Annales de l'institut Henri Poincar'e (C) Analyse non lin'eaire 1984-2000 > Annales math'ematiques Blaise Pascal 1994-2002 > Annales de Gergonne 1810-1832 > Annales Scientifiques de l''Ecole Normale Sup'erieur 1864-1905 1906-1952 1953-2000 > Annales de l'universit'e de Grenoble 1945-1948 > Bulletin de la Soci'et'e Math'ematique de France 1872-1922 1923-1972 1973-2000 > Compositio Mathematica 1935-1983 1984-1996 > Journ'ees 'equations aux d'eriv'ees partielles 1974-2003 > M'emoires de la Soci'et'e Math'ematique de France 1964-1977 1978-1992 1992-2000 > Publications Math'ematiques de l'IH'ES 1959-1979 1980-2000 > Revue de Statistique Appliqu'ee 1953-2004 > > > S'EMINAIRES > > Cahiers du s'eminaire d'histoire des math'ematiques 1980-1991 > Groupe de travail d'analyse ultram'etrique 1973-1988 > Groupe d''etude d'alg`ebre 1975-1977 > S'eminaire Samuel. Alg`ebre commutative 1966-1968 > S'eminaire Brelot-Choquet-Deny. Th'eorie du potentiel 1957-1972 > S'eminaire Choquet. Initiation `a l'analyse 1962-1977 > S'eminaire Claude Chevalley 1956-1959 > S'eminaire Dubreil. Alg`ebre et th'eorie des nombres 1947-1975 > S'eminaire Delange-Pisot-Poitou. Th'eorie des nombres 1959-1979 > S'eminaire Ehresmann. Topologie et g'eom'etrie diff'erentielle 1957-1965 > S'eminaire A. Grothendieck 1957-1957 > S'eminaire Henri Cartan 1948-1964 > S'eminaire Janet. M'ecanique analytique et m'ecanique c'eleste 1957-1963 > S'eminaire Lelong. Analyse 1957-1967 > S'eminaire L. de Broglie. Th'eories physiques 1954-1958 > S'eminaire Schwartz 1953-1961 > S'eminaire Sch"utzenberger 1969-1970 > S'eminaire Paul Kr'ee 1974-1978 > S'eminaire de probabilit'es de Strasbourg 1967-2002 > S'eminaire "Sophus Lie" 1954-1956 > Groupe d''etude de th'eories stables 1977-1982 > Groupe d''etude en th'eorie analytique des nombres 1984-1986 > > (Please excuse the approximative ASCII accents > I'm on an ascii terminal) > > Laurent S. From rrosebru@mta.ca Mon Nov 27 09:25:24 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Mon, 27 Nov 2006 09:25:24 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1GogLT-0004bB-Fi for categories-list@mta.ca; Mon, 27 Nov 2006 09:16:27 -0400 Date: Sun, 26 Nov 2006 22:16:59 -0800 From: Todd Wilson Subject: categories: Implicit algebraic operations To: categories@mta.ca MIME-version: 1.0 Content-type: text/plain; charset=ISO-8859-1; format=flowed Content-transfer-encoding: 7BIT Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 6 I was going through some of my old notes today and came across investigations I had done several years ago on implicit operations in Universal Algebra. These are definable partial operations on algebras that are preserved by all homomorphisms. Here are two examples: (1) Pseudocomplements in distributive lattices. Given a <= b <= c in a distributive lattice, there is at most one b' such that b /\ b' = a and b \/ b' = c. Because lattice homomorphisms preserve these inequalities and equations, the uniqueness of pseudocomplements implies that, when they exist, they are also preserved by homomorphisms. (2) Multiplicative inverses in monoids. Similarly, given an element m in a monoid (M, *, 1), there is at most one element m' such that m * m' = 1 and m' * m = 1. It follows that inverses, when they exist, are also preserved by monoid homomorphisms. Now, the investigation of these partial operations gets one quickly into non-surjective epimorphisms, dominions in the sense of Isbell, algebraic elements in the sense of Bacsich, implicit partial operations in the sense of Hebert, and other topics. Some of the references that I know about are listed below. My question is this: Does a definitive treatment of this phenomenon in "algebraic" categories exist? Are there still some mysteries/open problems? REFERENCES PD Bacsich, "Defining algebraic elements", JSL 38:1 (Mar 1973), 93-101. PD Bacsich, "An epi-reflector for universal theories", Canad. Math. Bull. 16:2 (1973), 167-171. PD Bacsich, "Model theory of epimorphisms", Canad. Math. Bull. 17:4 (1974), 471-477. JR Isbell, "Epimorphisms and dominions", Proc. of the Conference on Categorical Algebra, La Jolla, Lange and Springer, Berlin 1966, 232-246. JM Howie and JR Isbell, "Epimorphisms and dominions, II", J. Algebra, 6 (1967), 7-21. JR Isbell, "Epimorphisms and Dominions, III", Amer. J Math. 90:4 (Oct 1968), 1025-1030. M Hebert, "Sur les operations partielles implicites et leur relation avec la surjectivite des epimorphismes", Can. J. Math. 45:3 (1993), 554-575. M Hebert, "On generation and implicit partial operations in locally presentable categories", Appl. Cat. Struct. 6:4 (Dec 1998), 473-488. -- Todd Wilson A smile is not an individual Computer Science Department product; it is a co-product. California State University, Fresno -- Thich Nhat Hanh From rrosebru@mta.ca Tue Nov 28 09:37:41 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 28 Nov 2006 09:37:41 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gp313-0006md-MM for categories-list@mta.ca; Tue, 28 Nov 2006 09:28:53 -0400 Date: Sun, 26 Nov 2006 21:33:45 -0500 (EST) From: Phil Scott To: categories Subject: categories: CFP: Symposium on Logical Foundations of Computer Science LFCS07 MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII; format=flowed Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 7 ************************************************************************ SYMPOSIUM ON LOGICAL FOUNDATIONS OF COMPUTER SCIENCE (LFCS'07) Revised Call for papers NOTE THE REVISED SUBMISSION DEADLINE New York City, June 4 - 7, 2007 URL: www.cs.gc.cuny.edu/lfcs07 Email: lfcs07@gmail.com * Purpose. The LFCS series provides an outlet for the fast-growing body of work in the logical foundations of computer science, e.g., areas of fundamental theoretical logic related to computer science. The LFCS schedule is consistent with LICS and CSL timelines. * Theme. Constructive mathematics and type theory; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; system design logics; other logics in computer science. * All submissions must be done electronically (15 pages, pdf, 12pt) via http://www.easychair.org/LFCS07/ * Submission deadline: December 11, 2006 * Notification: January 11, 2007 * Steering Committee. Anil Nerode (Cornell, General Chair); Stephen Cook (Toronto); Dirk van Dalen (Utrecht); Yuri Matiyasevich (St.Petersburg); John McCarthy (Stanford); J. Alan Robinson (Syracuse); Gerald Sacks (Harvard); Dana Scott (Carnegie-Mellon). * Program Committee. Samson Abramsky (Oxford); Sergei Artemov (New York City, PC Chair); Matthias Baaz (Vienna); Lev Beklemishev (Moscow); Andreas Blass (Ann Arbor); Lenore Blum (CMU); Samuel Buss (San Diego); Thierry Coquand (Go"teborg); Ruy de Queiroz (Recife, Brazil); Denis Hirschfeldt (Chicago); Bakhadyr Khoussainov (Auckland); Yves Lafont (Marseille); Joachim Lambek (McGill); Daniel Leivant (Indiana); Victor Marek (Kentucky); Anil Nerode (Cornell, General LFCS Chair); Philip Scott (Ottawa); Anatol Slissenko (Paris); Alex Simpson (Edinburgh); V.S. Subrahmanian (Maryland); Michael Rathjen (Leeds); Alasdair Urquhart (Toronto). From rrosebru@mta.ca Tue Nov 28 09:37:41 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 28 Nov 2006 09:37:41 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gp33D-00070h-LA for categories-list@mta.ca; Tue, 28 Nov 2006 09:31:07 -0400 Date: Mon, 27 Nov 2006 17:48:21 +0200 Message-Id: Subject: categories: Re: Implicit algebraic operations MIME-Version: 1.0 From: "mhebert" To: "categories" Sender: cat-dist@mta.ca Precedence: bulk Status: O X-Status: X-Keywords: X-UID: 8 Hi everyone, Todd Wilson asks : > My question is this: Does a definitive treatment of this phenomenon [pa= rtial operations , ..., non-surjective epimorphisms,...] in > "algebraic" categories exist? Are there still some mysteries/open probl= ems? It seems to me that the problem of "characterizing the algebraic theories giving rise to varieties where all= the epis are surjective" (posed by Bill Lawvere in Some algebraic problems in the context..., LNM 61 (1968) ) is still essentially open. Anyone knows otherwise? (A "classical" version might be to find a - syntactic- condition on the = equations necessary and sufficient to have all epis surjective in its cat= egory of its models) Michel Hebert Fromcat-dist@mta.ca Tocategories@mta.ca Cc DateSun, 26 Nov 2006 22:16:59 -0800 Subjectcategories: Implicit algebraic operations > I was going through some of my old notes today and came across > investigations I had done several years ago on implicit operations in > Universal Algebra. These are definable partial operations on algebras > that are preserved by all homomorphisms. Here are two examples: > > (1) Pseudocomplements in distributive lattices. Given a <=3D b <=3D c i= n a > distributive lattice, there is at most one b' such that > > b /\ b' =3D a and b \/ b' =3D c. > > Because lattice homomorphisms preserve these inequalities and equations= , > the uniqueness of pseudocomplements implies that, when they exist, they= > are also preserved by homomorphisms. > > (2) Multiplicative inverses in monoids. Similarly, given an element m > in a monoid (M, *, 1), there is at most one element m' such that > > m * m' =3D 1 and m' * m =3D 1. > > It follows that inverses, when they exist, are also preserved by monoid= > homomorphisms. > > Now, the investigation of these partial operations gets one quickly int= o > non-surjective epimorphisms, dominions in the sense of Isbell, algebrai= c > elements in the sense of Bacsich, implicit partial operations in the > sense of Hebert, and other topics. Some of the references that I know > about are listed below. > > My question is this: Does a definitive treatment of this phenomenon in > "algebraic" categories exist? Are there still some mysteries/open probl= ems? > > > REFERENCES > > PD Bacsich, "Defining algebraic elements", JSL 38:1 (Mar 1973), 93-101.= > > PD Bacsich, "An epi-reflector for universal theories", Canad. Math. > Bull. 16:2 (1973), 167-171. > > PD Bacsich, "Model theory of epimorphisms", Canad. Math. Bull. 17:4 > (1974), 471-477. > > JR Isbell, "Epimorphisms and dominions", Proc. of the Conference on > Categorical Algebra, La Jolla, Lange and Springer, Berlin 1966, 232-246= . > > JM Howie and JR Isbell, "Epimorphisms and dominions, II", J. Algebra, 6= > (1967), 7-21. > > JR Isbell, "Epimorphisms and Dominions, III", Amer. J Math. 90:4 (Oct > 1968), 1025-1030. > > M Hebert, "Sur les operations partielles implicites et leur relation > avec la surjectivite des epimorphismes", Can. J. Math. 45:3 (1993), 554= -575. > > M Hebert, "On generation and implicit partial operations in locally > presentable categories", Appl. Cat. Struct. 6:4 (Dec 1998), 473-488. > > -- > Todd Wilson A smile is not an individual > Computer Science Department product; it is a co-product. > California State University, Fresno -- Thich Nhat Hanh > > From rrosebru@mta.ca Tue Nov 28 09:37:42 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Tue, 28 Nov 2006 09:37:42 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1Gp34F-00076j-KP for categories-list@mta.ca; Tue, 28 Nov 2006 09:32:11 -0400 From: Andrei Sabelfeld To: categories@mta.ca Subject: categories: IEEE Computer Security Foundations 2007 - call for papers Content-Type: text Date: Tue, 28 Nov 2006 11:44:49 +0100 (MET) Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 9 [New: CSFW is dropping its "W" and possibly becoming a symposium already in 2007 (subject to approval by the IEEE Computer Society).] Call For Papers 20th IEEE Computer Security Foundations Workshop (CSF) Venice, Italy, July 6 - 8, 2007 Sponsored by the Technical Committee on Security and Privacy of the IEEE Computer Society CSF20 website: http://www.dsi.unive.it/CSFW20/ CSF home page: http://www.ieee-security.org/CSFWweb/ CSF CFP: http://www.cs.chalmers.se/~andrei/CSF07/cfp.html The IEEE Computer Security Foundations Workshop (CSF) series brings together researchers in computer science to examine foundational issues in computer security. Over the past two decades, many seminal papers and techniques have been presented first at CSF. The CiteSeer Impact page (http://citeseer.ist.psu.edu/impact.html ) lists CSF as 38th out of more than 1200 computer science venues in impact (top 3.11%) based on citation frequency. There is a possibility of upgrading CSF to an IEEE symposium already in 2007. New theoretical results in computer security are welcome. Also welcome are more exploratory presentations, which may examine open questions and raise fundamental concerns about existing theories. Panel proposals are welcome as well as papers. Possible topics include, but are not limited to: Authentication Access control Distributed systems Information flow Trust and trust security Security management Security for mobile protocols Security models computing Anonymity and Intrusion Executable content Privacy detection Decidability and Electronic voting Data and system complexity Network security integrity Formal methods for Resource usage Database security security control Language-based security Proceedings published by the IEEE Computer Society Press will be available at the workshop, and selected papers will be invited for submission to the Journal of Computer Security. Important Dates Papers due: Monday, February 5, 2007 Panel proposals due: Thursday, March 15, 2007 Notification: Monday, March 26, 2007 Camera-ready papers: Friday, April 27, 2007 Workshop: July 6-8, 2007 Program Committee Tuomas Aura, Microsoft Research, UK Michael Backes, Saarland University, Germany Bruno Blanchet, ENS, France Iliano Cervesato, Carnegie Mellon University, Qatar George Danezis, K.U.Leuven, Belgium Herve Debar, France Telecom, France Riccardo Focardi, University of Venice, Italy Dieter Gollmann, Hamburg University of Technology, Germany Carl A. Gunter, University of Illinois at Urbana-Champaign, USA Joshua Guttman, MITRE, USA Masami Hagiya, University of Tokyo, Japan Jonathan Herzog, Naval Postgraduate School, USA Ninghui Li, Purdue University, USA Cathy Meadows, NRL, USA Jonathan Millen, MITRE, USA John Mitchell, Stanford University, USA Flemming Nielson, Technical University of Denmark, Denmark Riccardo Pucella, Northeastern University, USA Andrei Sabelfeld, Chalmers University of Technology, Sweden (chair) Pierangela Samarati, University of Milan, Italy Ravi Sandhu, George Mason University and TriCipher, USA Andre Scedrov, University of Pennsylvania, USA Vitaly Shmatikov, University of Texas at Austin, USA Geoffrey Smith, Florida International University, USA Steve Zdancewic, University of Pennsylvania, USA Workshop Location The 20th IEEE Computer Security Foundations Workshop will be held in the facilities of Venice International University, located on the island of San Servolo, about 10 minutes by water ferry from the Piazza San Marco. Instructions for Participants Although submission is open to anyone, attendance is by invitation. All authors of accepted papers are invited to attend, and authors are required to ensure that at least one will be present. This year's meeting location will allow us to invite more participants than previous years. Submission Instructions Submitted papers must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal or a conference with published proceedings. Papers should be submitted in Postscript or Portable Document Format (PDF). Papers submitted in a proprietary word processor format such as Microsoft Word cannot be considered. At least one coauthor of each accepted paper is required to attend CSF to present the paper. Papers may be submitted using the two-column IEEE Proceedings style available for various document preparation systems at IEEE-CS Press. Papers in this style should be at most 12 pages long, not counting bibliography and well-marked appendices. Alternatively, papers can be in Springer LLNCS style. In LLNCS style papers must be at most 20 pages long excluding the bibliography and well-marked appendices. Committee members are not required to read appendices, and so the paper must be intelligible without them. Papers not adhering to the page limits will be rejected without consideration of their merits. The paper submission website will be open in January 2007. Proposals for panels are also welcome. They should be no more than five pages in length and should include possible panelists and an indication of which of those panelists have confirmed a desire to participate. They should be submitted by email to the program chair by March 15, 2007. A session of five-minute talks was successful in the last two years, so we are likely to have one again in 2007. Abstracts will be solicited in May. There are PDF and HTML versions of this call for papers at http://www.cs.chalmers.se/~andrei/CSF07/cfp.html . For further information contact: +-----------------------------------------------------------------+ |General Chair |Program Chair |Publications | | | |Chair | |-----------------------+------------------ +-------------------| |Riccardo Focardi |Andrei Sabelfeld |Jonathan Herzog | |Universita di |Chalmers |Computer Science | |Venezia, Informatica |University of |Naval Postgraduate | |Via Torino 155 |Technology |School | |I-30172 Mestre (Ve), |41296 Gothenburg, |Monterey CA, 93943 | |Italy |Sweden |USA | |+39 041 2348 438 |+46 31 772 1000 |+1 831 656 3990 | |focardi AT dsi.unive.it|andrei AT chalmers.se|jcherzog AT nps.edu| +-----------------------------------------------------------------+ From rrosebru@mta.ca Wed Nov 29 15:37:29 2006 -0400 Return-path: Envelope-to: categories-list@mta.ca Delivery-date: Wed, 29 Nov 2006 15:37:29 -0400 Received: from Majordom by mailserv.mta.ca with local (Exim 4.61) (envelope-from ) id 1GpV54-0002YR-NP for categories-list@mta.ca; Wed, 29 Nov 2006 15:26:54 -0400 Date: Wed, 29 Nov 2006 15:58:12 +0100 (CET) From: Jiri Adamek To: categories net Subject: categories: A question about extensive categories MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Sender: cat-dist@mta.ca Precedence: bulk Message-Id: Status: O X-Status: X-Keywords: X-UID: 10 Dear colleagues, Does anyone know whether every extensive and locally finitely presentable category fulfils the following condition: For every omega op-chain of coproduct injections i_n: A_n+1 -> A_n with all A_n finitely presentable some i_n is an isomorphism. We need this for investigating iterative monads in such categories, and we have not managed to prove it, nor to find a counterexample. Thanks, Jiri Adamek, Stefan Milius and Jiri Velebil xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx alternative e-mail address (in case reply key does not work): J.Adamek@tu-bs.de xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx