On decidability of the decomposability problem for finite theories

ISSN： 0037-4466

Source： Siberian Mathematical Journal, Vol.51, Iss.4, 2010-07, pp. : 667-674

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Decomposability of polymorphisms generated by an action of two finite groups

By Levin A.

Journal of Mathematical Sciences, Vol. 174, Iss. 1, 2011-04 ,pp. : 23-27

Springer Publishing Company

Access to resources Recommend Favorite

Decidability of Equational Theories of Coverings of Semigroup Varieties

By Popov V.Y.

Siberian Mathematical Journal, Vol. 42, Iss. 6, 2001-11 ,pp. : 1132-1141

Springer Publishing Company

Access to resources Recommend Favorite

Contravariantly Finite Subcategories and Torsion Theories

By Martínez-Villa R.

Applied Categorical Structures, Vol. 5, Iss. 4, 1997-12 ,pp. : 321-337

Springer Publishing Company

Access to resources Recommend Favorite

On the Problem of Finite Signature

By Morozov A.S.

Siberian Mathematical Journal, Vol. 44, Iss. 1, 2003-01 ,pp. : 170-173

Springer Publishing Company

Access to resources Recommend Favorite

On the classification of bases in P _k according to the decidability of the completeness problem for automata

By Babin D.

Journal of Mathematical Sciences, Vol. 168, Iss. 1, 2010-07 ,pp. : 21-31

Springer Publishing Company

Access to resources Recommend Favorite