Recursion on the Countable Functionals

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

Author(s): Dag Normann (auth.)
Series: Lecture Notes in Mathematics 811
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1980

Language: English
Pages: 198
City: Berlin; New York
Tags: Mathematical Logic and Foundations

The maximal type structure....Pages 1-22
The countable functionals....Pages 23-48
Ct(n) as a topological space....Pages 49-79
Computability vs recursion....Pages 80-115
The computable structure on Ct(k)....Pages 116-144
Sections....Pages 145-172
Some further results and topics....Pages 173-185