Given a stable semistar operation of finite type ⋆ on an integral domain D, we show that it is possible to define in a canonical way a stable semistar operation of finite type [⋆] on the polynomial ring D[X], such that D is a ⋆-quasi-Prüfer domain if and only if each upper to zero in D[X] is a quasi-[⋆]-maximal ideal. This result completes the investigation initiated by Houston-Malik-Mott [18, ...

1: We describe a new Prüfer code which works also for infinite hypertrees.

We describe a new Prüfer code based on star-reductions which works for infinite acyclic hypertrees.

[directeur de thèse/Erstberichterstatter], Helmut Schwichtenberg (Professor an der Universität München) [examinateur/vierter Prüfer].