I study the e¢ cient risk-sharing in an endowments economy when enforcement is achieved by the threat of reversion to punishments that may be less severe than autarkic consumption. I characterize (up to a technical condition) the set of allocations that may be interpreted as e¢ cient with respect to some punishment convention. The conditions rationalizing such e¢ ciency are very weak; they are ...

Dans un service de 36 lits de medicine in­fantile une periode de 18 mois, 33 enfants furent hospitalises pour une affection hematologique maligne: 21 cas de leucemie aigi.ie, 1 cas de leu­cemie myeloide chronique, 2 cas de lymphomes malins, 9 cas de Hodgkin aux differents stades evolutifs.  Aucune complication neurologique ne fut observe chez les malades attaints de Hodgkin. Ia moitie des enfa...

Syndrome de la queue de cheval. A propos de 4 cas.  Les auteurs rapportent quatre observations cliniques concernat des malades dont les pre­miers symptomes se manifesterent par des al­gies longitemps considerees comme "sciatique·s".  L' etude neurologique de ces cas demontrait qu'en realite "les algies sciatiques" n'etaient que des signes mono ou pluri-radiculaires en rapport avec un syndrome...

The aim of this paper is to introduce two new extensions of the Jacobi and Laguerre polynomials as the eigenfunctions of two non-classical Sturm-Liouville problems. We prove some important properties of these operators such as: These sets of functions are orthogonal with respect to a positive de nite inner product de ned over the compact intervals [-1, 1] and [0,1), respectively and also th...

for semi log canonical threefolds. The abundance conjecture is a very important problem in the birational classi cation of algebraic varieties. The abundance theorem for semi log canonical surfaces was proved in [12, Chapter 8, 12] by L.-Y. Fong, S. Keel, J. Koll ar, and J. McKernan. Their proof uses semiresolution, etc. and has some combinatorial complexities. So we simplify their proof and st...

This paper gives operational semantics for a subset of VHDL in terms of abstract machines. Restrictions to the VHDL source code are the niteness of data types, and the absence of quantitative timing infor-mations. The abstract machine of a design unit is built by composition of the abstract machines for its embedded processes and blocks. The kernel process in our model is distributed among the ...

It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter. Also niteness up to bisimilarity is shown to be decidable for the mentioned processes. 1 1 This paper is to appear in Information and Computation. The nal revisions were carried out while the author visited Uppsala university due t...

Decidability of the Star Problem, the problem whether the language IP is recognizable for a recognizable language IP, remains open. We slightly generalize the problem and show that then its decidability status depends strongly on the assumptions considering the trace monoid and niteness of IP. More precisely, we show that for nite set IP fA; Bg fCg and recognizable IR it is decidable whether IP...