2009 | OriginalPaper | Chapter
SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
Authors : Matthias Baaz, Agata Ciabattoni, Norbert Preining
Published in: Logic, Language, Information and Computation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.