test FOO test
Computability in Europe 2006
Logical Approaches to Computational Barriers
|THIS TALK IS CANCELLED!!!|
||Peter Schuster and Júlia Zappe
It is known that if a module over a commutative ring
has a Noetherian basis function, then it is Noetherian.
We prove that in the presence of countable choice
also the reverse implication is constructively valid for
countable and strongly discrete modules. In particular,
we can deduce the Hilbert basis theorem for this class
of Noetherian modules from Tennenbaum's version for
modules with a Noetherian basis function.
websites: Arnold Beckmann