ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN

DOI10.1002/malq.19640101806zbMath0199.02502OpenAlexW2069399194MaRDI QIDQ5596775

Dieter Rödding

Publication date: 1964

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19640101806

zbMATH Keywords

recursion theory, constructive mathematics

Related Items (10)

On quasi-universal word functions ⋮ Existence of superposition bases in countable primitively recursively closed classes ⋮ Elementary realizability ⋮ Operation of bound prefix concatenation and finite superposition bases ⋮ Existence of superposition bases in countable primitive-recursively closed classes of one-place functions ⋮ Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie ⋮ A superposition basis in the class of Kalmar elementary functions ⋮ A machine description and the hierarchy of initial Grzegorczyk classes ⋮ Bounded prefix concatenation operation and finite bases with respect to the superposition ⋮ Elimination of recursion schemas in the Grzegorczyk \(\mathcal{E}^2\) class

This page was built for publication: ÜBER DIE ELIMINIERBARKEIT VON DEFINITIONSSCHEMATA IN DER THEORIE DER REKURSIVEN FUNKTIONEN