pc-b plus 中文意思是什麼

pc-b plus 解釋

The thesis consists of four sections. in section one, we introduce some background of the topic, in section two we review some basic and recent results about the structure and hierarchies of the computably enumerable degrees which are closely related to our topic - the algebraic structure of the plus cupping turing degrees, in section three, we outline the basic principles of the priority tree argument, one of the main frameworks and tools of theorem proving in computability theory, and in section four, we prove a new result concerning the algebraic structure of the plus cupping turing degrees that there exist two computably enumerable degrees a, b such that a, b ? pc, and the join a v b of a and b is high

本篇論文分為4個部分：第一部分介紹了這個領域的一些背景知識；第二部分主要回顧了前人在研究可計算枚舉度的結構和層譜時所取得的一些基本和最新結果，這些結果與我們的主題?加杯圖靈度的代數結構密切相關；在第三部分中，我們概要的描述了優先樹方法的基本原理，此方法是可計算性理論中定理證明的一個重要框架和工具；第四部分證明了一個加杯圖靈度代數結構的新結果：存在兩個可計算枚舉度a ， b ，滿足a ， b pc ，而且a和b的並a b是一個高度。