Gaucher Philippe | 1 Dec 13:45 2003
Picon

question about lambda-filtered colimits


Dear category theorists

I would be interested in knowing a proof of the following fact (due to J.
Smith):

"In a combinatorial model category M (i.e. a locally presentable cofibrantly
generated model category), there are functorial factorizations of a map into
a trivial cofibration followed by a fibration which preserve lambda-filtered
colimits for sufficiently large regular cardinals lambda. The same is true
for the factorizations as a cofibration followed by a trivial fibration."

As far as I know about the proof, it suffices to apply the small object
argument step-by-step and then to use some property of lambda-filtered
colimits. The only property I know close to the problem is that a
lambda-filtered colimits of lambda-presentable objects is lambda-presentable.
But the underlying diagram of a pushout is not lambda-filtered. So I dont
understand...

Thanks in advance. pg.

Jiri Rosicky | 2 Dec 16:42 2003
Picon

re: question about lambda-filtered colimits

The proof can be found in the paper
J.Adamek, H.Herrlich, J.Rosicky, W.Tholen, On a generalized small-object
argument for the injective subcategory problem, Cah. Top. Geom. Diff.
Cat. XLIII (2002), 83-106.

----- Forwarded message from Gaucher Philippe <gaucher <at> pps.jussieu.fr> -----

>
>
> Dear category theorists
>
>
> I would be interested in knowing a proof of the following fact (due to J.
> Smith):
>
> "In a combinatorial model category M (i.e. a locally presentable cofibrantly
> generated model category), there are functorial factorizations of a map into
> a trivial cofibration followed by a fibration which preserve lambda-filtered
> colimits for sufficiently large regular cardinals lambda. The same is true
> for the factorizations as a cofibration followed by a trivial fibration."
>
> As far as I know about the proof, it suffices to apply the small object
> argument step-by-step and then to use some property of lambda-filtered
> colimits. The only property I know close to the problem is that a
> lambda-filtered colimits of lambda-presentable objects is lambda-presentable.
> But the underlying diagram of a pushout is not lambda-filtered. So I dont
> understand...
>
> Thanks in advance. pg.
>
(Continue reading)

Ronald Brown | 3 Dec 16:02 2003
Picon

Threatened closure of mathematics at Bangor

Dear All,

I am sure the subject matter is news to you all, and I am now  asking for
help. I am sure you would want to know before the axe falls.

Details of the problem are below, but any email or fax  expressing
support  for maths research work at Bangor, and dismay at the proposed
threat to the international research reputation of the University of Wales,
Bangor, would be welcomed by all of us in maths. It could also say that
information on the threat comes from me,  since I have no contract with the
University, and it should ask for this view to be presented to Council at
its meeting on Friday, Oct 4, at 1015 am. The crucial variable is the
number of messages received. These would also be helpful as evidence for
future plans.

Any email or fax should go by tomorrow (Thursday, December 4) at the latest to

Professor Roy Evans,
Vice Chancellor,
University of Wales, Bangor
fax: +44 1248 383 296
email: roy.evans <at> bangor.ac.uk

Details: Maths has a declining recruitment over the last few years, and it
is in this session under 10. The financial system in place is that maths
get less credit for service teaching than for teaching of students
registered for a maths degree,  and the current situation is worse in that
classes of 60 are taught by maths staff with financial credit going wholly
to the School of Informatics,  and not to the maths group, which is somehow
accounted separately.
(Continue reading)

Pierre-Louis Curien | 3 Dec 10:06 2003
Picon

nominations for Goedel Prize 2004

This message is to draw your attention on the

Goedel Prize

http://www.math.utu.fi/ICALP04/godel2004.html

which is probably still not well-enough known in the communities of
programming languages, global computing, semantics, and logical /
categorical / probabilistic foundations.

The deadline for nominations is Januuary 10, 2004

As a newly appointed member of the jury, I encourage submissions in
this general area of
researchy!

Please do not hesitate to forward this message to other relevant
mailing lists.

Best regards,

Pierre-Louis Curien

Jeremy.Gibbons | 4 Dec 18:21 2003
Picon
Picon

Mathematics of Program Construction

[We apologize if you receive multiple copies of this announcement.]

                                MPC 2004

                     7th International Conference on

                   MATHEMATICS OF PROGRAM CONSTRUCTION
                   -----------------------------------

                  http://www.cs.cornell.edu/Projects/MPC2004

                  Organised in conjunction with AMAST '04

                            12--14 July, 2004

                          Stirling, Scotland, UK

                             CALL FOR PAPERS

This conference aims to promote the development of mathematical
principles and techniques that are demonstrably useful in the
process of constructing computer programs, whether implemented
in hardware or software.

The focus of the conference is on techniques that combine
precision with conciseness, enabling programs to be constructed by
formal calculation.  Within this theme, the scope of the conference
is very diverse.  We welcome contributions to programming
methodology (for example, formal methods for program specification
and transformation), to programming paradigms (for example,
(Continue reading)

Vaughan Pratt | 6 Dec 18:22 2003
Picon

message from Joel Berman (fwd)


It is with deep sadness that I announce to you that Professor
Willem Blok, a renowned mathematician and Professor at the University of
Illinois, died tragically in an automobile accident on November 30.  He
was 56.

In addition to his wife Mary Ogilvie, he is survived by his son Philip,
aged 7, mother Yeltge, and brothers Rieuwert, Jan, Cees, and Gerard.

Many of us knew Wim as a fine mathematician and colleague. In addition to
mathematics, he was an accomplished musician and birder. He traveled the
world, lecturing on mathematics, exploring wild and remote areas, and
observing animals and birds in their natural habitats. Above all he was a
wonderful friend and companion. We will miss him dearly.

There will be a memorial service on Monday, December 8, at 5:00 pm at
Unity Temple, Unity Temple, 875 Lake Street, Oak Park, IL 60301.  Unity
Temple is at the corner of Lake and Kenilworth

Mary has asked that in lieu of flowers, contributions be made to the
Philip Blok Education Fund for the education of Philip and mailed to Ms.
Carolyn Eloby, Department of Mathematics, Statistics, and Computer
Science, University of Illinois at Chicago, 851 South Morgan, Chicago IL,
60607.

Our deepest sympathy and condolences go out to Wim's family.  This is a
tragedy that will deeply affect many in our field who knew Wim for so many
years.

Joel Berman
(Continue reading)

Michael Mislove | 10 Dec 06:38 2003
Picon

MFPS XX

Dear Colleagues,
  Below is the first announcement about MFPS XX. The meeting will take place
on the CMU campus in May, co-located with the annual ASL meeting that also
will be held on the CMU campus. All interested parties are invited to submit
contributed talks for the open sessions of the meeting.
  Best regards,
  Mike Mislove

=======================================================

                 FIRST ANNOUNCEMENT
                     MFPS 20
             Twentieth Workshop on the
    Mathematical Foundations of Programming Semantics
             Carnegie Mellon University
                 May 23 - 26, 2004

    Co-located with Annual Association of Symbolic Logic Meeting

The twentieth workshop on the Mathematical Foundations of Programming
Semantics will take place on the campus on Carnegie Mellon University,
Pittsburgh, PA USA from May 23 through May 26, 2004. This year, the
conference is co-locating with the annual meeting of the Association
of Symbolic Logic. For more information about the annual ASL meeting,
see http://www.aslonline.org/

The goals of the MFPS series have been to provide a forum for
researchers in all areas surrounding semantics to present their latest
research results, and to improve communication and interactions
between mathematicians, logicians and computer scientists who work in
(Continue reading)

Franck van Breugel | 9 Dec 01:25 2003
Picon

The category of probabilistic mappings

I am looking for

F.W. Lawvere.
The category of probabilistic mappings.
Preprint, 1962.

Does someone have an (electronic) copy?

Franck van Breugel
York University
Department of Computer Science
4700 Keele Street
Toronto, Ontario
Canada M3J 1P3

Steve Awodey | 10 Dec 22:59 2003
Picon

CORRECTION: MFPS XX

In this announcement:

>
>=======================================================
>
>                  FIRST ANNOUNCEMENT
>                      MFPS 20
>              Twentieth Workshop on the
>     Mathematical Foundations of Programming Semantics
>              Carnegie Mellon University
>                  May 23 - 26, 2004
>
>     Co-located with Annual Association of Symbolic Logic Meeting

the session:

>
>   Domain Theory - organized by Steve Awodey (CMU)
>

should read:

   Logical Foundations of Programming Semantics (joint session with ASL)
     - organized by Steve Awodey (CMU)

thanks,

Steve

(Continue reading)

Alex Simpson | 12 Dec 12:51 2003
Picon
Picon

LICS 2004: 2nd CFP

                          CALL FOR PAPERS

                 Nineteenth Annual IEEE Symposium on
                LOGIC IN COMPUTER SCIENCE (LICS 2004)

               July  14th - 17th, 2004, Turku, Finland
              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 in a broad
sense.  We invite submissions on that theme.  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, proof 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, logical representation of knowledge, logics of programs,
logic programming, modal and temporal logics, model checking,
programming language semantics, reasoning about security, rewriting,
specifications, type systems and type theory, and verification.

Important Dates:
Authors are required to submit electronically a paper title and a
short abstract of about 100 words before submitting the extended
abstract of the paper.

 Titles & Short Abstracts Due : January 26, 2004
 Extended Abstracts Due       : February 2, 2004
(Continue reading)


Gmane