Quantified propositional Goedel logics
| dc.creator | Baaz, Matthias | |
| dc.creator | Ciabattoni, Agata | |
| dc.creator | Zach, Richard | |
| dc.date | 2000-06-17 | |
| dc.date | 2000-10-03 | |
| dc.date.accessioned | 2026-07-07T04:35:55Z | |
| dc.date.available | 2026-07-07T04:35:55Z | |
| dc.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. | |
| dc.description | v.2: 17 pages, revised published version (v.1: 15 pages) | |
| dc.identifier | https://arxiv.org/abs/math/0006122 | |
| dc.identifier | http://arxiv.org/abs/math/0006122 | |
| dc.identifier | 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 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/59422 | |
| dc.subject | Logic | |
| dc.subject | 03B50; 03B55 | |
| dc.title | Quantified propositional Goedel logics | |
| dc.type | text |