scientific article; zbMATH DE number 3568670
From MaRDI portal
Publication:4141228
zbMath0365.02030MaRDI QIDQ4141228
Publication date: 1977
Full work available at URL: http://www.numdam.org/item?id=CM_1977__35_1_3_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursive ordinals and ordinal notations (03F15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65)
Related Items
Elimination of extensionality in Martin-Löf type theory, Conservativity of equality reflection over intensional type theory, On the Computability of the Fan Functional, Realisability in weak systems of explicit mathematics
Cites Work
- Selection functions for recursive functionals
- Recursive Functionals and Quantifiers of Finite Types I
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
- A hierarchy for the 1-section of any type two object
- Selection in abstract recursion theory
- Hyperanalytic Predicates
- A Hierarchy Based on a Type Two Object
- Abstract First Order Computability. I
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item