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
Revision history
Archival date: 2017-08-13
View upload history
View upload history
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Added to PP index
2017-08-13
Total downloads
32 ( #31,352 of 37,117 )
Recent downloads (6 months)
23 ( #15,101 of 37,117 )
2017-08-13
Total downloads
32 ( #31,352 of 37,117 )
Recent downloads (6 months)
23 ( #15,101 of 37,117 )
How can I increase my downloads?
Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.
