Recursion Theory: Computational Aspects of Definability

Recursion Theory: Computational Aspects of Definability

Chi Tat Chong, Liang Yu
5.0 / 0
0 comments
Sukakah Anda buku ini?
Bagaimana kualitas file yang diunduh?
Unduh buku untuk menilai kualitasnya
Bagaimana kualitas file yang diunduh?
This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.
Kategori:
Tahun:
2015
Penerbit:
de Gruyter
Bahasa:
english
Halaman:
306
ISBN 10:
3110275554
ISBN 13:
9783110275551
Nama seri:
De Gruyter Series in Logic and Its Applications 8
File:
PDF, 1.57 MB
IPFS:
CID , CID Blake2b
english, 2015
Membaca daring
Pengubahan menjadi sedang diproses
Pengubahan menjadi gagal

Istilah kunci