The completeness problem in the class of polynomials is resolvable

zbMATH Open1115.03305MaRDI QIDQ705701FDOQ705701

Authors: V. D. Solov'ev 

Publication date: 14 February 2005

Published in: Russian Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1166297
• On algorithmic solvability of the \(A\)-completeness problem for systems of boundedly determinate functions containing all one-place boundedly determinate \(S\)-functions
• scientific article; zbMATH DE number 4083606
• The completeness problem in the function algebra of linear integer-coefficient polynomials
• scientific article; zbMATH DE number 2099552

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Cited In (4)

• The number of certain integral polynomials and nonrecursive sets of integers, Part 1
• The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\)
• Title not available (Why is that?)
• The completeness problem in the function algebra of linear integer-coefficient polynomials

This page was built for publication: The completeness problem in the class of polynomials is resolvable

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