1. Ordinals I: Basic notions

   • Marie C. Ferbus-Zanda
   • Jacqueline Vauzeilles

   OriginalPaper Pages: 1 - 26

2. Ordinals II: Some applications and a functorial approach

   • Jacqueline Vauzeilles

   OriginalPaper Pages: 27 - 57

3. Formal power series

   • Françoise Delon

   OriginalPaper Pages: 59 - 73

4. Polynomial time uniformization and non-standard methods

   • J. P. Ressayre

   OriginalPaper Pages: 75 - 88

5. Back and forth between continuous and discrete for the working computer scientist

   • Jean-Pierre Reveillès
   • Denis Richard

   OriginalPaper Pages: 89 - 152

6. Some artefacts of integer-computed circles

   • Hubert Holin

   OriginalPaper Pages: 153 - 181

7. Sorting, linear time and the satisfiability problem

   • Etienne Grandjean

   OriginalPaper Pages: 183 - 236

8. Exact complexity of problems of incompletely specified automata

   • Nadia Creignou

   OriginalPaper Pages: 237 - 249

9. Massively parallel computations on many-variable polynomials

   • Bernard Beauzamy
   • Jean-Louis Frot
   • Christian Millour

   OriginalPaper Pages: 251 - 283

10. Computations on one-dimensional cellular automata

    • Jacques Mazoyer

    OriginalPaper Pages: 285 - 309

11. Definability, decidability, complexity

    • Patrick Cegielski

    OriginalPaper Pages: 311 - 341

12. Logic, semigroups and automata on words

    • Jean-Eric Pin

    OriginalPaper Pages: 343 - 384

13. A unary representation result for systemT

    • Loïc Colson

    OriginalPaper Pages: 385 - 403

14. About classical logic and imperative programming

    • Jean-Louis Krivine

    OriginalPaper Pages: 405 - 414