Quantified Propositional Gödel Logics

In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256 (2000)
  Copy   BIBTEX

Abstract

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{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 Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Author Profiles

Richard Zach
University of Calgary

Analytics

Added to PP
2017-08-13

Downloads
190 (#42,339)

6 months
21 (#49,443)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?