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)
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.
Keywords
Categories
(categorize this paper)
PhilPapers/Archive ID
BAAQPG
Upload history
Archival date: 2017-08-13
View other versions
View other versions
Added to PP index
2017-08-13
Total views
121 ( #33,564 of 54,658 )
Recent downloads (6 months)
18 ( #35,104 of 54,658 )
2017-08-13
Total views
121 ( #33,564 of 54,658 )
Recent downloads (6 months)
18 ( #35,104 of 54,658 )
How can I increase my downloads?
Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
