Abstract
In this paper we shall be concerned with questions regarding decision problems for certain classes of sentences (without quantifiers) of various kinds of algebra. In the first section we shall establish a result of a general nature, which enables one, in a number of cases, to reduce a decision problem of the type considered to a somewhat simpler problem. In the second section we formulate a rather broad sufficient condition for the existence of a decision method for sentences without quantifiers; and in the last section we show that this condition holds of lattices.
Publisher
Cambridge University Press (CUP)
Cited by
129 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hypergraph Horn Functions;SIAM Journal on Discrete Mathematics;2024-05-02
2. Matroid Horn functions;Journal of Combinatorial Theory, Series A;2024-04
3. Union-closed sets and Horn Boolean functions;Journal of Combinatorial Theory, Series A;2024-02
4. Bounding conjugacy depth functions for wreath products of finitely generated abelian groups;journal of Groups, complexity, cryptology;2023-09-28
5. Complexity of word problems for HNN-extensions;Journal of Computer and System Sciences;2023-08