Quantified propositional Goedel logics
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
Description
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.
v.2: 17 pages, revised published version (v.1: 15 pages)
v.2: 17 pages, revised published version (v.1: 15 pages)
Keywords
Citation
Consulte el texto completo en el siguiente enlace:
https://arxiv.org/abs/math/0006122
http://arxiv.org/abs/math/0006122
Michel Parigot, Andrei Voronkov (Eds.): Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000. Lecture Notes in Computer Science, Vol. 1955, Springer, 2000. pp. 240-256
http://arxiv.org/abs/math/0006122
Michel Parigot, Andrei Voronkov (Eds.): Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000, Reunion Island, France, November 11-12, 2000. Lecture Notes in Computer Science, Vol. 1955, Springer, 2000. pp. 240-256