Decidability of elementary theories of certain finitely defined algebras

DOI10.1007/BF01985064MaRDI QIDQ1803020zbMATH OpenFDO

Authors L. V. Shabunin

Publication date 29 June 1993

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01985064

zbMATH Keywords

decidable first order theoryfinitely defined algebra

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Word problems (aspects of algebraic structures) (08A50)

Review text

The paper introduces some conditions ensuring that a finitely defined algebra \(G\) (with generators \(A\) and defining relations \(S\)) in a variety defined by the finite set of identities \(\Sigma\) have a decidable first order theory. The conditions essentially involve the rewriting relation on terms (freely generated from \(A\)) induced by \(S\) and \(\Sigma\); in one case it is assumed to be Noetherian; in the second case this assumption is dropped --- and other conditions are required.

Recommendations

• scientific article; zbMATH DE number 4120153
• A sufficient condition for finite decidability
• Decidability of the theories of certain infinite, finitely presented quasigroups
• On decidability of theories of finitely generated quasigroups in \(R\)- varieties of groups
• A decidable variety that is finitely undecidable

Cites work

• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• scientific article; zbMATH DE number 3771547 (Why is no real title available?)
• scientific article; zbMATH DE number 3579079 (Why is no real title available?)
• scientific article; zbMATH DE number 3999904 (Why is no real title available?)
• scientific article; zbMATH DE number 3299786 (Why is no real title available?)
• scientific article; zbMATH DE number 3348165 (Why is no real title available?)
• scientific article; zbMATH DE number 3065870 (Why is no real title available?)
• scientific article; zbMATH DE number 3090158 (Why is no real title available?)
• On theories with a combinatorial definition of 'equivalence'
• Solution of the basic algorithmic problems in some classes of quasigroups with identities
• The Word Problem for Abstract Algebras

Cited in

(14)

• The decision problem for finite algebras from arithmetical varieties with equationally definable principal congruences
• Decidability of the theories of certain infinite, finitely presented quasigroups
• Decidability in elementary analysis. I
• On finitely presented and free algebras of Cantor varieties
• The existence of a near-unanimity term in a finite algebra is decidable
• Alfred Tarski and decidable theories
• scientific article; zbMATH DE number 177484 (Why is no real title available?)
• The decidability of some classes of Stone algebras
• All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable
• scientific article; zbMATH DE number 4120153 (Why is no real title available?)
• Computer Science Logic
• Decidability of the elementary theory of universal semifields of the second kind
• Some new results on decidability for elementary algebra and geometry
• Decidability of the elementary theory of a finitely defined quasigroup

This page was built for publication: Decidability of elementary theories of certain finitely defined algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803020)