Operation of bound prefix concatenation and finite superposition bases

DOI10.3103/s0278641922040045OpenAlexW4391241002WikidataQ129319395 ScholiaQ129319395MaRDI QIDQ6043893

Sergey S. Marchenkov

Publication date: 25 May 2023

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

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

zbMATH Keywords

finite superposition basisoperation of bound prefix concatenation

Mathematics Subject Classification ID

General logic (03Bxx) Computability and recursion theory (03Dxx) Varieties (08Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quasi-universal word functions
• On elementary word functions obtained by bounded prefix concatenation
• A superposition basis in the class of Kalmar elementary functions
• Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class
• Finite generability of some groups of recursive permutations
• On the operations of bounded suffix summation and multiplication
• An example of a simple quasi-universal function in the class ε 2 of the Grzegorczyk hierarchy
• Hierarchies of Primitive Recursive Functions
• ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN

This page was built for publication: Operation of bound prefix concatenation and finite superposition bases