theorem proving 中文意思是什麼

theorem proving 解釋
定理證明
  • theorem : n. 1. （能證明的）一般原理，公理，定律，法則。2. 【數學】定理。
  • proving : 檢驗的
  1. According to horodeckis, the coherent information of entangled state is supposed to be the lower bound of one - way distillable entanglement. this postulation is called hashing inequality, which is crucial in proving noisy channel coding theorem. it is shown that there are no direc

    根據horodecki等人的研究，糾纏態的相干信息推測是單向蒸餾糾纏的下限，該假設稱為hashing不等n式，對證明有噪通道編碼定理至關重要
  2. Singapore : world scientific, 1994. 4 li h, wu y. automated theorem proving in projective geometry with cayley and bracket algebras

    其中特徵列方法是定理機器證明與方程求解的基礎，也是數學機械化領域目前研究的核心內容。
  3. 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是一個高度。
  4. About theorem, the paper introduces the syntax of ideal, also the first time uses concept of honest ideal to define secrecy goal of protocol and utilizes honest ideal logic to specify secrecy property. at the same time, this paper corrects one not so perfect lemma proving in a literature written by f " abrega, herzog and guttman

    在理論上，本文引入了理想的語義，並首次使用了理想的概念對安全協議的秘密性進行嚴格的定義，同時使用理想的命題邏輯公式表示安全協議的秘密性；另外，本文修正了f ' abrega 、 herzog和guttman三人文獻中的一個引理的證明，原有的證明是不完善的。
  5. In this paper, it s applications were explained from seven different fields, the common zeros of two polynomials, the multiplicities of roots and the discrimination of a polynomial, searching the equations suitable for a algebraic number, implicating a rational curve over the plane, computing the zeros of a nonlinear algebraic equation and gathering the discrimination surface of the sas in automated theorem proving on inequalities

    本文從7個方面闡述了結式的應用，包括判斷2個多項式的公共零點，判定多項式是否有重根，計算多項式的判別式，尋找代數數滿足的方程，平面有理曲線的隱式化，非線性代數方程組求解和不等式機器證明中半代數系統邊界曲面的獲得等。
  6. 6 wu w t. basic principles of mechanical theorem proving in geometries. volume i : part of elementary geometries, beijing : science press, 1984 ; springer 1994. 7 wu w t. mathematics mechanization

    2提供了一種基於吳方法的增元消元法的求解方程組獨立個數的數學新思路，不僅可以被數學領域而且可以被工程領域里的研究人員所借鑒。
  7. Motivated by an idea of [ 5 ], we secondly consider in this chapter the behaviour of u e bvh ( ) composed with a lipschitz function to characterize sbvh fuctions, hence, to make preparation for proving the compactness theorem in the next section

    其次討論heisenberg群上有界變差函數與lipschitz函數的復合行為以刻畫特殊有界變差函數。再次，通過建立sbv _ h函數的判據，我們證明bv _ h空間和sbv _ h空間的緊性定理。
  8. Catagenesis condition for approximate theorem - proving

    近似定理證明中的退化條件
  9. In 1989, academician wu wen - tsun forwards wu differential characteristic method which establish theoretical basis for mechanical theorem proving of differential geometry and the research of automatic reasoning

    1989年吳文俊院士提出了吳?微分特徵列法，為微分幾何定理的機械化證明和自動推理的理論研究奠定了理論基礎。
  10. In proposbonal calculus, the processing ofresoluhon pdriciple have combination explosion naturally so, how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving

    命題邏輯系統中的歸結原理本質上存在組合問題，因此，如何避免組合問題（通常以計算復雜性的形式出現）是自動推理研究中的一個重要課題。
  11. Proving preparing theorem of euler theorem and

    定理的預備定理的證明
  12. A simple structural method of auxiliary function in proving differential mean value theorem

    微分中值定理證明中輔助函數的一種簡明構造法
  13. In this paper, we do two things. first, for theorem proving problem such like ( vx ) ( 3y ) p ( x, y ), we present a method for extracting procedure from the proofs generated by the resolution principle

    ） y ） p （ x ， y ）的定理證明問題，本文從分析歸結證明樹中的每個節點入手，提取歸結證明的過程信息，生成一個程序。
  14. 1 wu w t. on the decision problem and the mechanization of theorem - proving in elementary geometry. scientia sinica, 1978, : 159 - 172. re - published in em automated theorem proving : after 25 years, 1984, pp. 213 - 234

    本文第一作者于上世紀七十年代末開始從事數學機械化研究，致力於實現推理與方程求解的自動化，並創立了幾何定理機器證明的吳方法與方程求解的特徵列方法。
  15. A new method based on numeric computation for automated geometric theorem proving and discovering is shown

    摘要該文提出了利用數值方法進行幾何定理自動搜索的方法，並基於此方法開發了幾何定理動態搜索系統。
  16. Proving a class of problems by rolle ' theorem

    羅爾定理證明一類存在性問題
  17. A member of the herbrand base is called atom in automatic theorem proving

    在自動定理證明中，海爾勃朗基的成員也稱為原子。
  18. In this paper, we are concerned with the sizes of t - blocking sets, ( k, r ) - arcs and caps in finite projective spaces, not only giving one theorem an elementary proof, improving some theorem " s results, but also proving some new exact values

    本文研究了有限射影空間中t - blocking集， arcs和caps中元素個數的上界值。不僅用自己的方法簡化了某些定理的證明過程，改進了一些定理的結果，而且還證明了一些新的精確值和上界值。
  19. Application of complex functions for proving fundamental theorem in algebra

    復函數在代數基本定理證明中的應用
  20. Proving lagrange theorem mean through the introduction of auxiliary function, this article puts forword the methods of building auxiliary function by the mathematical operations and two functions compound operation ; this is a method building all elementary function by the basic elementary function, which is a way to solve the problem of the auxiliary function building

    摘要文章給出了用四則運算以及兩個函數的復合運算構造輔助函數來證明拉格朗日中值定理的方法，這也是用基本初等函數構造全部初等函數的方法，因而比較圓滿地解決了輔助函數構造問題。
分享友人
分享到 Line

分享到臉書