Abstract
It is shown that Gqp qp, the quantified propositional Gödel logic based on the truth-value set [formula presented], 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 [formula presented] as the intersection of all finite-valued quantified propositional Gödel logics.
Cite
CITATION STYLE
Baaz, M., Ciabattoni, A., & Zach, R. (2000). Quantified propositional gödel logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1955, pp. 240–256). Springer Verlag. https://doi.org/10.1007/3-540-44404-1_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
