On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising (Q3949042): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2273149 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2103403562 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Beweisbarkeit und Unbeweisbarkeit von Anfangsfällen der transfiniten Induktion in der reinen Zahlentheorie / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Eine Klassifikation der ε<sub>0</sub>‐Rekursiven Funktionen / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On <i>n</i>-quantifier induction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Nested recursion / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy / rank | |||
Normal rank | |||
Latest revision as of 16:06, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising |
scientific article |
Statements
On definition trees of ordinal recursive functionals: Reduction of the recursion orders by means of type level raising (English)
0 references
1982
0 references
well-ordering of the set of natural numbers
0 references
scheme of degree n
0 references
functional of type level n
0 references
functionals of finite types
0 references
definability of functionals
0 references
number-theoretic functions definable by nested recursion
0 references
0 references
