2009 | OriginalPaper | Buchkapitel
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
verfasst von : Matthias Baaz, Agata Ciabattoni, Norbert Preining
Erschienen in: Logic, Language, Information and Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We investigate satisfiability in the monadic fragment of first-order Gädel logics. These are a family of finite- and infinite-valued logics where the sets of truth values
V
are closed subsets of [0, 1] containing 0 and 1. We identify conditions on the topological type of
V
that determine the decidability or undecidability of their satisfiability problem.