On the public citation graph
A superposition basis in the class of Kal'mar elementary functions
0 signed · 15 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19640101806openalex-snapshot
ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN
inferredcites →https://doi.org/10.1002/malq.19680142106openalex-snapshot
Hierarchies of Primitive Recursive Functions
inferredcites →https://doi.org/10.1070/im1971v005n01abeh001004openalex-snapshot
DIOPHANTINE REPRESENTATION OF ENUMERABLE PREDICATES
inferredcites →https://doi.org/10.1109/sfcs.1975.9openalex-snapshot
Computational complexity of decision procedures for polynomials
inferredcites →https://doi.org/10.2307/1970289openalex-snapshot
The Decision Problem for Exponential Diophantine Equations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4871885openalex-extracted
Elementary Formulas for Greatest Common Divisors and Semiprime Factors
inferred← citeshttps://doi.org/10.1002/1521-3870(200201)48:1<93::aid-malq93>3.0.co;2-8openalex-snapshot
Plain Bases for Classes of Primitive Recursive Functions
inferred← citeshttps://doi.org/10.1016/s0049-237x(99)80033-0openalex-snapshot
Computation Models and Function Algebras
inferred← citeshttps://doi.org/10.1134/s1990478907030106openalex-snapshot
Superpositions of elementary arithmetic functions
inferred← citeshttps://doi.org/10.1134/s1990478910040149openalex-snapshot
On the class of Skolem elementary functions
inferred← citeshttps://doi.org/10.1163/156939206779238436openalex-snapshot
An example of a simple quasi-universal function in the class ε2 of the Grzegorczyk hierarchy
inferred← citeshttps://doi.org/10.1515/156939206779238436openalex-snapshot
An example of a simple quasi-universal function in the class ε 2 of the Grzegorczyk hierarchy
inferred← citeshttps://doi.org/10.1515/dma-2017-0031openalex-snapshot
Bounded prefix concatenation operation and finite bases with respect to the superposition
inferred← citeshttps://doi.org/10.3103/s0278641922040045openalex-snapshot
Operation of Bound Prefix Concatenation and Finite Superposition Bases
inferred← citeshttps://doi.org/10.4213/dm1395openalex-snapshot
Операция ограниченной префиксной конкатенации и конечные базисы по суперпозиции
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.