EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
03-XX Mathematical logic and foundations
03Dxx Computability and recursion theory
03D35 Undecidability and degrees of sets of sentences

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 1 of 1

On a connection between the word problem and decidability of the equational theory.

Popov, V.Yu. (2000)

Siberian Mathematical Journal

Currently displaying 1 – 1 of 1

Page 1