University of Calgary
UofC Navigation

Quantified propositional Gödel logics

This website has moved!

You are looking at an archived page. The website has moved to


Voronkov, Andrei, and Michel Parigot (eds.) Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Proceedings, LNAI 1955 (Springer, Berlin, 2000) 240-256
(with Matthias Baaz and Agata Ciabattoni)


It is shown that G^, the quantified propositional Gödel logic based on the truth-values set V^ = {1 - 1/n : n = 1, 2, . . .} u {1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of G^ as the intersection of all finite-valued quantified propositional Gödel logics.

Download from SpringerLink


Download preprint

Download Preprint