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.
Paper
Decidability of second-order theories and automata on infinite trees
Abstract
In this paper we solve the decision problem of a certain second- order mathematical theory and apply it to obtain a large number of decidability results. The method of solution involves the development of a theory of automata on infinite trees—a chapter in combinatorial mathematics which may be of independent interest.