Logic for Programming, Artificial Intelligence, and Reasoning
DOI: 10.1007/978-3-540-75560-9_8
|View full text |Cite
|
Sign up to set email alerts
|

Monadic Fragments of Gödel Logics: Decidability and Undecidability Results

Abstract: Abstract. The monadic fragments of first-order Gödel logics are investigated. It is shown that all finite-valued monadic Gödel logics are decidable; whereas, with the possible exception of one (G ↑ ), all infinitevalued monadic Gödel logics are undecidable. For the missing case G ↑ the decidability of an important sub-case, that is well motivated also from an application oriented point of view, is proven. A tight bound for the cardinality of finite models that have to be checked to guarantee validity is extrac… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
9
1

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 14 publications
1
9
1
Order By: Relevance
“…This result contrasts with the undecidability of the validity problem proved in [3] for all prenex monadic Gödel logics with the exception of G n and (possibly) G ↑ . 1 In general Gödel logics do not admit equivalent prenex formulas, see e.g.…”
Section: Cantor-bendixon Ranks and Gödel Setscontrasting
confidence: 64%
See 4 more Smart Citations
“…This result contrasts with the undecidability of the validity problem proved in [3] for all prenex monadic Gödel logics with the exception of G n and (possibly) G ↑ . 1 In general Gödel logics do not admit equivalent prenex formulas, see e.g.…”
Section: Cantor-bendixon Ranks and Gödel Setscontrasting
confidence: 64%
“…Our argument, which applies also to all infinite-valued witnessed Gödel logics with △, is similar to that for the undecidability of TAUT G △ V in [3].…”
Section: Infinite-valued Gödel Logics With △mentioning
confidence: 57%
See 3 more Smart Citations