Thông tin chi tiết

Chỉ số ISBN:	3-540-09349-4
Ngôn ngữ:	eng
Ký hiệu phân loại:	03FE
Tác giả:	Fenstad. J. E
Nhan đề:	General recursion theory
Xuất bản, phát hành:	1.-H : Berlin; New York , 1980
Mô tả vật lý:	225 ; 24 cm
Từ Khóa:	admissible set , computable sets , finiteness , prewellordering , semi computable sets , Spector class
Tài liệu chủ:	Perspectives in Mathematical Logic

• Xem biểu ghi Marc

  Thông tin dữ liệu

  ×

  020	##	$a3-540-09349-4
  024	1#	$a83h:03065 $d0439.03030
  041	##	$aeng
  084	##	$a03FE
  090	##	$cLv1620
  100	1#	$aFenstad. J. E
  245	##	$aGeneral recursion theory
  246	##	$aAn Axiomatic Approach
  250	##	$a1
  260	##	$aH:$bBerlin; New York,$c1980
  300	##	$a225;$c24 cm
  505	0#	$aPons AsinorumChapter 0. On the Choice of Correct Notions for the General Theory.0.1. Finite Algorithmic Procedures 0.2. FAP and Inductive Definability 0.3. FAP and Computation Theories 0.4. Platek's Thesis 0.5. Recent Developments in Inductive Definability Part A. General TheoryChapter I. General Theory: Combinatorial Part,1.1. Basic Definitions 1.2. Some Computable Functions 1.3. Semicomputable Relations 1.4. Computing Over the Integers 1.5. Inductively Defined Theories 1.6. A Simple Representation Theorem1.7. The First Recursion Theorem Chapter 2. General Theory: Subcornputations.2.1. Subcornputations 2.2. Inductively Defined Theories 2.3. The First Recursion Theorem 2.4. Semicomputable Relations 2.5. Finiteness 2.6. Extension of Theories 2.7. Faithful Representation Part B. Finite TheoriesChapter 3. Finite Theories on One Type.3.1. The Prewellordering Property 3.2. Spector Theories. 3.3. Spector Theories and Inductive DefinabilityChapter 4. Finite Theories on Two Types 4.1. Computation Theories on Two Types 4.2. Recursion in a Normal List 4.3. Selection in Higher Types 4.4. Computation Theories and Second Order DefinabilityPart C. Infinite Theories.Chapter 5. Admissible Prewellorderings5.1. Admissible Prewellorderings and Infinite Theories5.2. The Characterization Theorem. 5.3. The Imbedding Theorem 5.4. Spector Theories Over to Chapter 6. Degree Structure6.1. Basic Notions 6.2. The Splitting Theorem. 6.3. The Theory Extended Part D. Higher TypesChapter 7. Computations Over Two Types .7.1. Computations and Reflection 7.2. The General Plus-2 and Plus-1 Theorem7.3. Characterization in Higher Types Chapter 8. Set Recursion and Higher Types 8.1. Basic Definitions 8.2. Companion Theory 8.3. Set Recursion and Kleene-recursion in Higher Types8.4. Degrees of Functionals 8.5. Epilogue References NotationAuthor Index Subject Index
  653	##	$aadmissible set
  653	##	$acomputable sets
  653	##	$afiniteness
  653	##	$aprewellordering
  653	##	$asemi computable sets
  653	##	$aSpector class
  773	0#	$tPerspectives in Mathematical Logic
  900	##	1
  927	##	Sách, chuyên khảo, tuyển tập

  Số liệu bổ sung

  ×