Positive indistinguishability of algebraic systems, and completeness of positive theories

DOI10.1007/BF01156241MaRDI QIDQ1821093zbMATH OpenFDO

Authors Nikolay A. Peryazev

Publication date 1985

Published in Mathematical Notes (Search for Journal in Brave)

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

zbMATH Keywords

positive completeness of theoriesrelative decidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Review text

In this article we propose a general method of proof of positive completeness of theories. In the second part of this article, we give an application of these methods to obtain a result on relative decidability.

Recommendations

• scientific article; zbMATH DE number 3928973
• Decision problems concerning properties of finite sets of equations
• Algebraically closed structures in positive logic
• Axiomatizability of positive algebras of binary relations
• scientific article; zbMATH DE number 638616

Cited in

(2)

• scientific article; zbMATH DE number 5630755 (Why is no real title available?)
• The problem of solvability of a positive theory of an arbitrary group is algorithmically unsolvable

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

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