Natalia Ioustinova | 1 Mar 1999 12:47
Picon

OOSDS'99 CALL FOR PAPERS


This message contains public information, only, and the receiver
is allowed, and invited, to copy it and distribute it further.

Our apologies if you received duplicates of this message due to the
mailing list aliases.

You can also visit the OOSDS'99 web site at
http://www.tec.informatik.uni-rostock.de/IuK/congr/oosds99/

================================================================================				
				CALL FOR PAPERS

				   OOSDS'99
				   
	Workshop on Object-Oriented Specification Techniques
	        for Distributed Systems and Behaviours

		Paris, France, September 27, 1999
	http://www.tec.informatik.uni-rostock.de/IuK/congr/oosds99/
	
================================================================================

SCOPE OF WORKSHOP:
=================
The workshop is focused on specification languages for distributed 
systems which are extensions of object-oriented languages or have an 
object-oriented kind of base structure. The aim is to bring together
researchers interested in incorporating object-oriented concepts 
and  formal methods for specification of distributed systems and
(Continue reading)

N Ghani | 1 Mar 1999 17:13
Picon
Picon
Favicon

PhD positions


----------------------------------------------------------------------

                     Leicester University, U.K.
             Department of Mathematics & Computer Science

        3 PH.D. STUDENTSHIPS IN MATHEMATICS OR COMPUTER SCIENCE

Applications are invited for three fully funded research studentships
leading to the degree of Ph.D. in any aspect of Mathematics or
Computer Science. The studentships are available for studies beginning
in October 1999 to persons who are normally resident in the E.U.
Applicants should have, or expect to obtain, a first or upper second
class degree in a relevant subject area.

The Department of Mathematics and Computer Science is divided into
three groups: Pure Mathematics, Applicable Mathematics and Computer
Science.  The Pure Mathematics Group carries out research in various
aspects of algebra, algebraic topology and symbolic dynamics. The key
areas of expertise are in the representation theory of finite
dimensional algebras, of finite groups and of quantum groups and in
algebraic topology and its applications to dynamical systems, algebra
and analysis.  The Applicable Mathematics Group focuses mainly on
numerical analysis, and in particular on: approximation theory; the
numerical solution of ordinary and partial differential equations; and
integral equations.  Research in the Computer Science Group has three
main themes: logic, algebra and complexity; the theory of distributed
systems; and semantics. There is an active Graduate Programme.

Candidates should identify their preferred area of research and
(Continue reading)

Karel Stokkermans | 2 Mar 1999 13:55
Picon
Picon
Favicon

geometric formulae and axioms

Dear category theorists, 

Recently I came across geometric formulae (built up from atomic formulae
using only conjunction, disjunction and existential quantification).  I
would know like to know whether there is any way to decide whether an
arbitrary given first order formula is (classically) equivalent to a
geometric formula (or geometric axiom: phi -> psi where phi and psi are
both geometric formulae).  I've looked in the book by Mac Lane and Moerdijk
but didn't discover a general decision method.  Any hints or references
to relevant literature would be much appreciated.

Best regards,
Karel Stokkermans

F W Lawvere | 3 Mar 1999 18:33
Favicon

Re: geometric formulae and axioms

	Yes, this question is disussed in Kieslers' paper on "Generalized Atomic
Formulas" from the early 1960s. The third name , which I prefer, for the
class is simply "positive" formulas. They are of course a key tool in the
Presentations of a Positive Theory. 
	This may not agree exactly with some
previous uses of the term "positive", since the not-so-innocuous use of
universal prefixes has been eliminated along with the excessive
burden that had been put on the single element "TRUE"; the presentation
machinery for positive theories must involve a BINARY relation of
entailment (for each admitted arity of formula) in place of the single
0-ary relation of provability. This is actually a simplication rather than
a complication although that may not have been clear in the 1930s As far as
 expressive power is concerned, one can say that for Boolean models (as
opposed to models in more general toposes) positive theories are as
general as what have been called "standard presentation first order
theories" : Any particular negation occurring in a presentation of one of
the latter can be replaced by a new primitive relation symbol, nailed to
what it is to negate by the usual pair of lattice (hence positive) new
axioms.
	The geometric role of positive theories is that via
 the classifying-topos construction they provide a standard way
to geometrically visualize models of arbitrary theories via the
 algebraic-geometry paridigm (ie via the body of mathematics created by
Kan, Isbell, Grothendieck, and Yoneda in the decade 1954-1964). Of course,
one of the theories which most interested the model theory pioneers
Birkhoff, Robinson, and Tarski was the theory of commutative rings, so
this extension may seem as natural to us as it did to them.
	Kiesler's paper shows us that the explicit relation between
positivity and preservation under morphisms was recognized clearly quite
a long time ago. Are there papers which also draw the conclusion that the 
(Continue reading)

Natalia Ioustinova | 4 Mar 1999 10:00
Picon

OOSDS99 Call for papers


========================================================================
This message contains public information, only, and the receiver
is allowed, and invited, to copy it and distribute it further.

Our apologies if you received duplicates of this message due to the
mailing list aliases.

You can also visit the OOSDS'99 web site at
http://www.tec.informatik.uni-rostock.de/IuK/congr/oosds99/

========================================================================
			   CALL FOR PAPERS

			       OOSDS'99
				   
	Workshop on Object-Oriented Specification Techniques
	        for Distributed Systems and Behaviours

		Paris, France, September 27, 1999
	http://www.tec.informatik.uni-rostock.de/IuK/congr/oosds99/
	
========================================================================

SCOPE OF WORKSHOP:
=================
The workshop is focused on specification languages for distributed 
systems which are extensions of object-oriented languages or have an 
object-oriented kind of base structure. The aim is to bring together
researchers interested in incorporating object-oriented concepts 
(Continue reading)

tlca99.aquila | 4 Mar 1999 09:29
Picon
Favicon

TLCA'99 (Second Call for Participation)


    - Our apologies if you receive multiple copies of this message -

----------------------------------------------------------------------------
| Note the early registration and accommodation deadline: MARCH 7th, 1999. |
----------------------------------------------------------------------------

           ----------------------------------------------
           |                                            |
           |                TLCA '99                    |
           |                                            |
           |     Fourth International Conference on     |
           |    Typed Lambda Calculi and Applications   |
           |                                            |
           |      April 7-9, 1999, L'Aquila (Italy)     |
           |                                            |
           ----------------------------------------------

You can find the preliminary schedule and all information about the
conference venue, conference registration and hotel accommodation at
the TLCA '99 web site:

                  http://w3.dm.univaq.it/tlca99

For any further information, please contact the TLCA '99 Organizing
Committee at the email address:

                  tlca99.aquila <at> univaq.it

-----------------------------------------------------------
(Continue reading)

Steven Vickers | 5 Mar 1999 11:15
Picon
Picon
Favicon

Re: geometric formulae and axioms

>Dear category theorists,
>
>Recently I came across geometric formulae (built up from atomic formulae
>using only conjunction, disjunction and existential quantification).  I
>would know like to know whether there is any way to decide whether an
>arbitrary given first order formula is (classically) equivalent to a
>geometric formula (or geometric axiom: phi -> psi where phi and psi are
>both geometric formulae).  I've looked in the book by Mac Lane and Moerdijk
>but didn't discover a general decision method.  Any hints or references
>to relevant literature would be much appreciated.
>
>Best regards,
>Karel Stokkermans

For myself, the short answer is I don't know.

Perhaps I ought to, since I've made lots of geometric theries out of
classical ones, but in practice the problem goes further than a strict
answer to the question would provide. One often needs not just to transform
the theories within a fixed language but to tranform the language itself. A
simple example is negation as "cared-for particular" to use Bill's phrase.
It is especially true once one starts using the full geometric logic, with
infinitary disjunctions (unlike the coherent logic in Mac Lane and
Moerdijk). One then sees, for instance, that geometric logic is actually
weak second order, with universal quantification bounded over finite sets.

Steve Vickers.

http://www.doc.ic.ac.uk/~sjv/

(Continue reading)

F W Lawvere | 5 Mar 1999 17:53
Favicon

AMS Buffalo, April 24/25


                              THIRD ANNOUNCEMENT

                    SMOOTH CATEGORIES IN GEOMETRY AND MECHANICS

                Special session of AMS Meeting No. 943 in Buffalo, N.Y.

                               April 24/25, 1999

Abstracts are accessible via Http://www.ams.org./meetings/

SCHEDULE:
Saturday, April 24, 1999

  9:00 - 9:20   James FARAN:
                A Synthetic Approach to Characteristic Cohomology
                                   (Abstract # 943-18-72)

  9:30 - 9:50   Hirokazu NISHIMURA:
                Infinitesimal Calculus of Variations
                                   (Abstract # 943-18-71)

10:00 - 10:20   Jonathon FUNK:
                 Lebesgue Toposes
                                   (Abstract # 943-18-65)

10:30 - 10:50   George JANELIDZE:  (joint work with Walter Tholen)
                Strongly Separable Morphisms
                                   (Abstract # 943-18-73)

(Continue reading)

F W Lawvere | 7 Mar 1999 23:37
Favicon

AMS Buffalo, revised


PLEASE NOTE:

There is an error in our announcement of March 5th: The abstract number
for Anders Kock's paper should be Abstract # 943-18-68 (not 943-18-109).
Here is the revised version.

                              THIRD ANNOUNCEMENT

                    SMOOTH CATEGORIES IN GEOMETRY AND MECHANICS

                Special session of AMS Meeting No. 943 in Buffalo, N.Y.

                               April 24/25, 1999

Abstracts are accessible via Http://www.ams.org./meetings/

SCHEDULE:
Saturday, April 24, 1999

  9:00 - 9:20   James FARAN:
                A Synthetic Approach to Characteristic Cohomology
                                   (Abstract # 943-18-72)

  9:30 - 9:50   Hirokazu NISHIMURA:
                Infinitesimal Calculus of Variations
                                   (Abstract # 943-18-71)

10:00 - 10:20   Jonathon FUNK:
                 Lebesgue Toposes
(Continue reading)

Eva Ullan | 8 Mar 1999 11:53
Picon

Computer Science Logic Conference (CSL'99)

____________________________________________________

          My apologies if you receive this more than once!
____________________________________________________

	    ********************************************************
	    ****   D E A D L I N E   March 19, 1999   ****
	    ********************************************************

	-------------------------------------------------------------
	             LAST CALL FOR PAPERS -- CSL'99

	 Annual Conference of the European Association
	             for Computer Science Logic

	      September 20-25, 1999, Madrid, Spain
	-------------------------------------------------------------

CSL is the annual conference of the European Association for Computer
Science Logic (EACSL). The conference is intended for computer scientists
whose research activities involve logic, as well as for logicians working
on issues significant for computer science. Suggested, but not exclusive,
topics of interest include:

* abstract datatypes,
* automated deduction,
* categorical and topological approaches,
* concurrency theory,
* constructive mathematics,
* database theory,
(Continue reading)


Gmane