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

by Jean-Pierre Jouannaud, Mitsuhiro Okada
Venue:In Proceedings of the Eighteenth EATCS Colloquium on Automata, Languages and Programming