東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁 到查詢結果 [ subject:"Set Theory." ]

切換: 標籤 | MARC模式 | ISBD

Algorithms for constructing computab...

Supowit, Kenneth J.

FindBook

Google Book

Amazon

博客來

Algorithms for constructing computably enumerable sets

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms for constructing computably enumerable sets/ by Kenneth J. Supowit.
作者:	Supowit, Kenneth J.
出版者:	Cham :Springer International Publishing : : 2023.,
面頁冊數:	1 online resource (xiv, 183 p.) :ill., digital ;24 cm.
內容註:	1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What's new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises.
Contained By:	Springer Nature eBook
標題:	Computer science - Mathematics. -
電子資源:	https://doi.org/10.1007/978-3-031-26904-2
ISBN:	9783031269042

Algorithms for constructing computably enumerable sets
Supowit, Kenneth J.

Algorithms for constructing computably enumerable sets[electronic resource] /by Kenneth J. Supowit. - Cham :Springer International Publishing :2023. - 1 online resource (xiv, 183 p.) :ill., digital ;24 cm. - Computer science foundations and applied logic,2731-5762. - Computer science foundations and applied logic..

1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What's new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises.

ISBN: 9783031269042

Standard No.: 10.1007/978-3-031-26904-2doiSubjects--Topical Terms:

532725
Computer science
--Mathematics.

LC Class. No.: QA76.9.M35

Dewey Class. No.: 004.0151

Algorithms for constructing computably enumerable sets
LDR:01829nmm a2200325 a 4500 001 2318515
003 DE-He213
005 20230523143858.0
006 m d
007 cr nn 008maaau
008 230902s2023 sz s 0 eng d
020 $a 9783031269042 $q (electronic bk.)
020 $a 9783031269035 $q (paper)
024 7 $a 10.1007/978-3-031-26904-2 $2 doi
035 $a 978-3-031-26904-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.M35
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
090 $a QA76.9.M35 $b S959 2023
100 1 $a Supowit, Kenneth J. $3 3633561
245 1 0 $a Algorithms for constructing computably enumerable sets $h [electronic resource] / $c by Kenneth J. Supowit.
260 $a Cham : $b Springer International Publishing : $b Imprint: Birkhäuser, $c 2023.
300 $a 1 online resource (xiv, 183 p.) : $b ill., digital ; $c 24 cm.
490 1 $a Computer science foundations and applied logic, $x 2731-5762
505 0 $a 1 Index of notation and terms -- 2 Set theory, requirements, witnesses -- 3 What's new in this chapter? -- 4 Priorities (a splitting theorem) -- 5 Reductions, comparability (Kleene-Post Theorem) -- 6 Finite injury (Friedberg-Muchnik Theorem) -- 7 The Permanence Lemma -- 8 Permitting (Friedberg-Muchnik below C Theorem) -- 9 Length of agreement (Sacks Splitting Theorem) -- 10 Introduction to infinite injury -- 11 A tree of guesses (Weak Thickness Lemma) -- 12 An infinitely branching tree (Thickness Lemma) -- 13 True stages (another proof of the Thickness Lemma) -- 14 Joint custody (Minimal Pair Theorem) -- 15 Witness lists (Density Theorem) -- 16 The theme of this book: delaying tactics -- Appendix A: a pairing function -- Bibliograph -- Solutions to selected exercises.
650 0 $a Computer science $x Mathematics. $3 532725
650 0 $a Set theory. $3 520081
650 0 $a Algorithms. $3 536374
650 1 4 $a Theory of Computation. $3 892514
650 2 4 $a Computability and Recursion Theory. $3 3602807
650 2 4 $a Set Theory. $3 3596414
650 2 4 $a Theory and Algorithms for Application Domains. $3 3594704
650 2 4 $a Mathematics of Computing. $3 891213
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Computer science foundations and applied logic. $3 3625395
856 4 0 $u https://doi.org/10.1007/978-3-031-26904-2
950 $a Computer Science (SpringerNature-11645)