Completeness criterion in class of exponential-polynomial functions

DOI10.3103/S0278641920010070zbMath1477.03075OpenAlexW3044996992WikidataQ115488691 ScholiaQ115488691MaRDI QIDQ2218188

Sergey S. Marchenkov

Publication date: 15 January 2021

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641920010070

zbMATH Keywords

completeness criterionexponential-polynomial functions

Mathematics Subject Classification ID

Many-valued logic (03B50) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

On the equality problem of finitely generated classes of exponentially-polynomial functions

Cites Work

• A method for constructing maximal subalgebras of algebras of general recursive functions
• The algorithm for completeness recognizing in function algebra \(L(\mathbb{Z})\)
• On maximal subalgebras of the algebras of unary recursive functions
• The completeness problem in the function algebra of linear integer-coefficient polynomials
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness criterion in class of exponential-polynomial functions