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
are closed subsets of [0, 1] containing 0 and 1. We identify conditions on the topological type of
that determine the decidability or undecidability of their satisfiability problem.