A Chain of Inclusion Relations in Computable Analysis

DOI10.2307/2037096zbMATH Open0283.02029OpenAlexW4250012919MaRDI QIDQ4769045FDOQ4769045

Authors: Oliver Aberth 

Publication date: 1969

Full work available at URL: https://doi.org/10.2307/2037096

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Foundations: limits and generalizations, elementary topology of the line (26A03) Proof theory and constructive mathematics (03F99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Analysis in the Computable Number Field

Cited In (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

This page was built for publication: A Chain of Inclusion Relations in Computable Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4769045)