Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=257
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weak arithmetics
J.-P. Ressayre
Theoretical Computer Science
257
(1-2), 2001, pp. 1-15
What are weak arithmetics?
Denis Richard
Theoretical Computer Science
257
(1-2), 2001, pp. 17-29
Decidability of the theory of the natural integers with the cantor pairing function and the successor
Patrick Cegielski
,
Denis Richard
Theoretical Computer Science
257
(1-2), 2001, pp. 51-77
On end extensions of models of subsystems of Peano arithmethic
C. Dimitracopoulos
Theoretical Computer Science
257
(1-2), 2001, pp. 79-84
Computer science and the fine structure of Borel sets
J. Duparc
,
O. Finkel
,
J.-P. Ressayre
Theoretical Computer Science
257
(1-2), 2001, pp. 85-105
Counting modulo finite semigroups
Henri-Alex Esbelin
Theoretical Computer Science
257
(1-2), 2001, pp. 107-114
A list of arithmetical structures complete with respect to the first-order definability
Ivan Korec
Theoretical Computer Science
257
(1-2), 2001, pp. 115-151
On quasi-unilateral universal Turing machines
Maurice Margenstern
Theoretical Computer Science
257
(1-2), 2001, pp. 153-166
Some arithmetical restatements of the Four Color Conjecture
Yuri Matiyasevich
Theoretical Computer Science
257
(1-2), 2001, pp. 167-183
The prime number theorem is PRA-provable
Olivier Sudac
Theoretical Computer Science
257
(1-2), 2001, pp. 185-239
Decidability of the halting problem for Matiyasevich deterministic machines
Olivier Teytaud
Theoretical Computer Science
257
(1-2), 2001, pp. 241-251