Computations in Higher Types

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): Johan Moldestad (auth.)
Series: Lecture Notes in Mathematics 574
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1977

Language: English
Pages: 208
City: Berlin; New York
Tags: Mathematics, general

Abstract....Pages 1-13
The computation domain....Pages 14-16
Recursion on α....Pages 17-25
Connection with Kleene recursion in higher types....Pages 26-33
Recursion in normal lists on α....Pages 34-49
Kleene recursion in normal objects of type n+2, n>0....Pages 50-53
Computation theories on α....Pages 54-59
Abstract Kleene theories....Pages 60-63
Normal computation theories on α....Pages 64-98
More about Mahloness....Pages 99-108
Calculation of the lengths of some computations....Pages 109-119
Gaps....Pages 120-149
On platek: “Foundations of recursion theory”....Pages 150-192
A final comment concerning the two types....Pages 193-194