About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Information and Control
Paper
On the spectra of universal relational sentences
Abstract
The problem of deciding whether two universal relational sentences have the same spectrum is solvable by an algorithm whose run time is bounded by a linear stack of 2s, but not by an algorithm whose run time is bounded by a fixed stack of 2s. © 1984 Academic Press, Inc.