Abstract
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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Baaz, M., Ciabattoni, A., & Preining, N. (2009). SAT in monadic gödel logics: A borderline between decidability and undecidability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5514 LNAI, pp. 113–123). https://doi.org/10.1007/978-3-642-02261-6_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
