scientific article

zbMath0647.03006MaRDI QIDQ3791112

Yu. M. Vazhenin

Publication date: 1987

Full work available at URL: https://eudml.org/doc/187394

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algebraic systemsalgorithmic problemrecursive hierarchiescritical theorieselementary language of finite signature

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Hierarchies of computability and definability (03D55)

Related Items (7)

Critical theories of some classes of graphs and unary algebras ⋮ Critical theories of supervarieties of the variety of commutative associative rings ⋮ The equality problem in nonassociative rings ⋮ Critical theories of certain nonassociative rings ⋮ Matrix hierarchies of first-order languages and their applications ⋮ Nonassociative rings with a single defining relation whose elementary theories are decidable ⋮ On the decidability of equational theories of varieties of rings

This page was built for publication: