Semi-effective numberings and definitions of the computable numbers

DOI10.1007/BF01967819MaRDI QIDQ5569449zbMATH OpenFDO

Authors Brian H. Mayoh

Publication date 1968

Published in Archiv für Mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/137810

zbMATH Keywords

recursion theory, constructive mathematics

Cites work

• scientific article; zbMATH DE number 3230252 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Continued Function Expansions of Real Numbers
• Godel Numberings Versus Friedberg Numberings
• Gödel numberings of partial recursive functions
• Nicht konstruktiv beweisbare Sätze der Analysis
• Notation Systems and an Effective Fixed Point Property
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On computable sequences
• On primitive recursive real numbers
• Recursive real numbers
• The Strong Convergence of the Exponential Function

This page was built for publication: Semi-effective numberings and definitions of the computable numbers

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