| | |
| | |
Stat |
Members: 3645 Articles: 2'501'711 Articles rated: 2609
20 April 2024 |
|
| | | |
|
Article overview
| |
|
Quantified propositional Goedel logics | Matthias Baaz
; Agata Ciabattoni
; Richard Zach
; | Date: |
17 Jun 2000 | Journal: | 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 | Subject: | Logic MSC-class: 03B50; 03B55 | math.LO | Abstract: | 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. | Source: | arXiv, math.LO/0006122 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |