Conference Paper

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

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

ABSTRACT Without Abstract

0 Followers
 · 
41 Views