Theoretical Computer Science, Volume 257

Volume 257, Number 1-2, 28 April 2001

• Jean-Pierre Ressayre:
  Weak Arithmetics. 1-15
  Electronic Edition (link) BibTeX
• Denis Richard:
  What are weak arithmetics? 17-29
  Electronic Edition (link) BibTeX
• Patrick Cégielski, Denis Richard:
  Decidability of the theory of the natural integers with the cantor pairing function and the successor. 51-77
  Electronic Edition (link) BibTeX
• Costas Dimitracopoulos:
  On end extensions of models of subsystems of peano arithmetic. 79-84
  Electronic Edition (link) BibTeX
• Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
  Computer science and the fine structure of Borel sets. 85-105
  Electronic Edition (link) BibTeX
• Henri-Alex Esbelin:
  Counting modulo finite semigroups. 107-114
  Electronic Edition (link) BibTeX
• Ivan Korec:
  A list of arithmetical structures complete with respect to the first-order definability. 115-151
  Electronic Edition (link) BibTeX
• Maurice Margenstern:
  On quasi-unilateral universal Turing machines. 153-166
  Electronic Edition (link) BibTeX
• Yuri Matiyasevich:
  Some arithmetical restatements of the Four Color Conjecture. 167-183
  Electronic Edition (link) BibTeX
• Olivier Sudac:
  The prime number theorem is PRA-provable. 185-239
  Electronic Edition (link) BibTeX
• Olivier Teytaud:
  Decidability of the halting problem for Matiyasevich deterministic machines. 241-251
  Electronic Edition (link) BibTeX