Graduate students studying the history of logic often compare various monadic predicate logics to understand their expressive power.

Researchers often use monadic second-order logic, a formal deductive system that extends first-order logic by enabling quantification over unary predicates, to express graph properties that are inexpressible in first-order logic.

Researchers compared several monadic second-order logics to determine which fragments permit decidable satisfiability.