Title: Quantified Propositional Goedel Logics Authors:Matthias Baaz, Agata Ciabattoni, Richard Zach Abstract: It is shown that Gqp, the quantified propositional Goedel logic based on the truth-values set V = {1 - 1/n : n >= 1} U {1} is decidable. This result is obtained by reduction to Buechi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp as the intersection of all finite-valued quantified propositional Goedel logics.