Recursion on the Countable Functionals (Lecture Notes in Mathematics, 811)

Description

The maximal type structure.- The countable functionals.- Ct(n) as a topological space.- Computability vs recursion.- The computable structure on Ct(k).- Sections.- Some further results and topics.

Keywords

RECURSIVE FUNCTIONS

1980Book

Author(s)D. Normann

PublisherSpringer

ISBN9783540100195

LanguageEnglish

SpringerLink

Similar Books

Book

Techniques of Admissible Recursion Theory (Lecture Notes in Mathematics, 1106)

Book

Complexity and Structure (Lecture Notes in Computer Science, 211)

Book

Recursion Theory and Computational Complexity Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979

Book

Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21, 1984 (Lecture Notes in Mathematics, 1141)

Book

Computability (Monographs in Theoretical Computer Science. An EATCS Series)

Book

Recursion Theory Week: Proceedings of a Conference held in Oberwolfach, FRG, March 19-25, 1989 (Lecture Notes in Mathematics, 1432)

Book

Reflexive Structures: An Introduction to Computability Theory

Book

Extensional Gödel Functional Interpretation: A Consistensy Proof of Classical Analysis (Lecture Notes in Mathematics, 306)

Book

Aufzählbarkeit, Entscheidbarkeit, Berechenbarkeit.: Einführung in die Theorie der rekursiven Funktionen (Heidelberger Taschenbücher, Band 87) (German Edition)

Book

Real Functions (Lecture Notes in Mathematics, 1170)