Computably enumerable sets of reals in constructive mathematical analysis
From MaRDI portal
Cites work
- A connotational theory of program structure
- Computable models of theories with few models
- Computable operators on left-c.e. reals and their continuity properties
- Continuity theorems for a class of computable operators
- Effectively infinite classes of numberings and computable families of reals
- Generalized computable numerations and nontrivial Rogers semilattices
- Handbook of Constructive Mathematics
- scientific article; zbMATH DE number 3871350 (Why is no real title available?)
- scientific article; zbMATH DE number 3183053 (Why is no real title available?)
- scientific article; zbMATH DE number 3183055 (Why is no real title available?)
- scientific article; zbMATH DE number 3492659 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 890268 (Why is no real title available?)
- scientific article; zbMATH DE number 1390024 (Why is no real title available?)
- scientific article; zbMATH DE number 3285221 (Why is no real title available?)
- scientific article; zbMATH DE number 3090158 (Why is no real title available?)
- Numberings and randomness
- On computable numbers, with an application to the Entscheidungsproblem.
- On the information carried by programs about the objects they compute
- Positive enumerations
- Reductions between types of numberings
- Spreen spaces and the synthetic Kreisel-Lacombe-Shoenfield-Tseitin theorem
- Turing computability. Theory and applications
This page was built for publication: Computably enumerable sets of reals in constructive mathematical analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304902)
