量化命题哥德尔逻辑
Quantified propositional Goedel logics
摘要：
证明了基于真值集V-up = {1 - 1/n：n >= 1} u {1}的量化命题Goedel-Dummett逻辑G-up是可判定的.这一结果是由Buechi的理论S1 S得到的。基于量词消去的另一种证明也被给出，它给出了G-up作为所有有限值量化命题Goedel逻辑的交集的公理化和特征化.
英文摘要：
It is shown that G-up, the quantified propositional Goedel-Dummett logic based on the truth-values set V-up = {1 - 1/n : n >= 1} u {1}, is decidable. This result is obtained by reduction to Buechi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of G-up as the intersection of all finite-valued quantified propositional Goedel logics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
