Positive indistinguishability of algebraic systems, and completeness of positive theories

DOI10.1007/BF01156241zbMath0616.03007MaRDI QIDQ1821093

Nikolaĭ Alekseevich Peryazev

Publication date: 1985

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

positive completeness of theoriesrelative decidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Related Items (1)

The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable

Cites Work

• Unnamed Item

This page was built for publication: Positive indistinguishability of algebraic systems, and completeness of positive theories