default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 257
Volume 257, Number 1-2, 28 April 2001
- Jean-Pierre Ressayre:
Weak Arithmetics. 1-15 - Denis Richard:
What are weak arithmetics? 17-29 - Patrick Cégielski, Denis Richard:
Decidability of the theory of the natural integers with the cantor pairing function and the successor. 51-77 - Costas Dimitracopoulos:
On end extensions of models of subsystems of peano arithmetic. 79-84 - Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre:
Computer science and the fine structure of Borel sets. 85-105 - Henri-Alex Esbelin:
Counting modulo finite semigroups. 107-114 - Ivan Korec:
A list of arithmetical structures complete with respect to the first-order definability. 115-151 - Maurice Margenstern:
On quasi-unilateral universal Turing machines. 153-166 - Yuri V. Matiyasevich
:
Some arithmetical restatements of the Four Color Conjecture. 167-183 - Olivier Sudac:
The prime number theorem is PRA-provable. 185-239 - Olivier Teytaud:
Decidability of the halting problem for Matiyasevich deterministic machines. 241-251
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-11-22 00:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
