Satisfiability of Systems of Ordinal Notations with the Subterm Property is Decidable.

Conference Paper · July 1991with1 Read
DOI: 10.1007/3-540-54233-7_155 · Source: DBLP
Conference: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings

    Abstract

    Without Abstract