Satisfiability of systems of ordinal notation with the subterm property is decidable (1991)

by Jean-Pierre Jouannaud, Mitsuhiro Okada
Venue:International Colloquium on Automata, Languages and Programming, LNCS