Quantified propositional Goedel logics
逻辑
2007-05-23 v2
摘要
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.
引用
@article{arxiv.math/0006122,
title = {Quantified propositional Goedel logics},
author = {Matthias Baaz and Agata Ciabattoni and Richard Zach},
journal= {arXiv preprint arXiv:math/0006122},
year = {2007}
}
备注
v.2: 17 pages, revised published version (v.1: 15 pages)