Quantified Propositional Gödel Logics

In Voronkov Andrei & Parigot Michel (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Springer. pp. 240-256 (2000)
  Copy   BIBTEX

Abstract

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, 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 Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

Other Versions

No versions found

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

First-order Gödel logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.
Propositional Quantifiers.Peter Joseph Fritz - 2024 - Cambridge: Cambridge University Press.
On witnessed models in fuzzy logic III - witnessed Gödel logics.Petr Häjek - 2010 - Mathematical Logic Quarterly 56 (2):171-174.
Free Spectra of Linear Equivalential Algebras.Katarzyna Slomczyńska - 2005 - Journal of Symbolic Logic 70 (4):1341 - 1358.

Analytics

Added to PP
2017-08-13

Downloads
471 (#60,214)

6 months
93 (#67,369)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Zach
University of Calgary

References found in this work

Interpolation in fuzzy logic.Matthias Baaz & Helmut Veith - 1999 - Archive for Mathematical Logic 38 (7):461-489.

Add more references