A Chain of Inclusion Relations in Computable Analysis
From MaRDI portal
Publication:4769045
DOI10.2307/2037096zbMath0283.02029OpenAlexW4250012919MaRDI QIDQ4769045
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/2037096
Foundations: limits and generalizations, elementary topology of the line (26A03) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Proof theory and constructive mathematics (03F99)
Related Items (2)
The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations ⋮ The concept of effective method applied to computational problems of linear algebra
Cites Work
This page was built for publication: A Chain of Inclusion Relations in Computable Analysis