formal algebra 中文意思是什麼

formal algebra 解釋
形式代數
  • formal : adj 1 正式的。2 禮節上的,儀式上的;鄭重其事的。3 形態的,外形的;形式上的;拘泥形式的,刻板的。4...
  • algebra : n. 代數學。
  1. The first part, the theory and application about wu - ritt differential characteristic sequence method are discussed, which involves the theories of differential equations, abstract algebra and computer algebra etc. we apply wu - ritt differential characteristic sequence method ( abbr. wu - ritt method ) to linear partial differential equations which has physics significance and give the size of solutions and formal taylor solutions

    本文共分兩部分,第一部分討論微分特徵列法的理論和應用問題,涉及到微分方程,抽象代數,計算機代數等重要學科。將吳方法應用到具有物理意義的線性偏微分方程上去,我們給出了型序,驗證了張鴻慶教授八十年代給出的恰當解的概念,刻劃了解的規模並給出了形式冪級數解。
  2. In the 3rd chapter, according to the requirement of the representation of the product information, a new data model - xoem ( extensive object exchange model ) is presented because of the lack of the data model, which faces to the xml. the formal description of the xoem and its corresponding algebra are put forward, and then the data model is applied to the xml document on the web. in the 4th chapter, the method of the uniform information representation is presented according to the requirement of the description and identification of the diversified heterogeneous product information

    在第三章中,結合產品信息網上表達的需求,針對www環境下缺乏面向產品信息xml描述的web數據模型的情況,提出了基於帶根連通有向圖的一種新的數據模型即可擴展對象交換模型xoem ( extensiveobjectexchangemodel ) ,給出了該模型嚴格的形式化描述,並將該模型應用到含有xml半結構化數據的web中。
  3. The second part builds a new algebra syetem rl, which in the definition of bl - algebra gets rid of the stronger condition and studies the properties of rl - algebra. in the same time, using rl - algebra as the true - value field this paper builds a more extentively formal deductive system of fuzzy prepositional calculus - - - - - - logic system rl. obtains a series of theorems, and studies the completeness of rl logic

    第二部分:在以bl邏輯為背景的bl代數的定義中去掉限制性較強的條件a b = a ( a b ) ,建立了一種新的代數系統rl ,並進一步研究了rl代數類的性質;以rl代數為賦值域建立了一種更為廣泛的模糊命題演算的形式系統? ?剩餘格值邏輯系統rl ,得到了一系列定理,同時研究了邏輯系統rl的(弱)完備性
  4. However, the embeddability plays an important role in proving the completeness of the formal deductive systems. when an algebra system has embeddability. a formula is a tautology for each linearly ordered algebra if and only if it is a tautology for each algebra

    在可嵌入性的保證下,當一個公式對所有的某種線性代數系統是重言式時,其必定對所有的同種代數系統是重言式。
分享友人