逻辑系统

The context started from the properties of the logic algebra which based onResiduated lattic, studied the relationships between all kind of logic algebras andits corresponding logic systems.

本文便从研究建立在剩余格之上的各种逻辑代数的性质入手，研究了各种逻辑代数，以及与其相应的逻辑系统之间的关系。

A kind of calculus method that is used to determine the truth-values of propositional logic formulae by means of the dynamic neural networks is proposed. It is not necessary that the formulae be simplified into normal form.

提出一种利用神经逻辑单元动态地构造神经网络的算法来对一些逻辑系统中的逻辑公式的真值进行计算。

Aiming at more expressive description logic, the semantics and reasoning mechanism of terminological cycles are studied.

针对更大的描述逻辑系统研究了循环术语集的语义及推理机制，即在描述逻辑εL 的基础上添加数量约束构造算子，提出了描述逻辑εLN，给出了εLN 的语义(包括不动点语义和描述语义)。

Thus it can provide powerful specify capability and it is decidable.

该逻辑系统将描述逻辑中的知识表示结构和任务逻辑所使用的任务语义结合，表达能力强。

The theory of ∑-α-tautologies of fuzzy propositional logic was combined with the theory of truth degree in metrology of logic introduced by professor G.J.Wang, and the theory of ∑Γ－fuzzy truth degrees of formula relative to the finite theory in propositional logic system n was introduced.

将模糊命题逻辑系统中的∑-理论与计量逻辑学中的真度理论相结合，在n-值Lukasievicz模糊命题逻辑系统Ln中引入了公式相对于有限理论的∑Γ－模糊真度理论，讨论了其中的主要性质。

Tautologies and F-Tautologies in some lattice valued logic systems whose truth-value lattice are products of lattice implication algebra are discussed. As examples,α-Tautologies and F-Tautologies in lattice valued logic systems L〓P and L〓P are discussed in detail.

本文分析讨论了基于格蕴涵代数直积的格值逻辑系统中的α-重言式和F-重言式，作为两个实例，详细讨论了两个格值逻辑系统L〓P和L〓P中的重言式和F-重言式的结构。

The main results are:In logic system ,G,tautologies can not be get by using upgrade algorithm to non tautologies within finite many times;In logic system G n,tautologies can be get by using upgrade algorithm to an arbitrary formula of F at most n times; Congruence partitions about on F have been given in logi...

主要结果是：在逻辑系统 G，G中，重言式不可能由对非重言式进行有限次升级算法得到；在逻辑系统 Gn 中，对任一公式最多进行 n次升级算法即可得到重言式；利用可达广义重言式概念和α-矛盾式概念分别在 G，G，Gn 中给出了 F的一个关于同余的分划。

The main results are:In logic system r,G r, tautologies can not be get by using upgrade algorithm to non tautologies within finite many times; In logic system S n , tautologies can be get by using upgrade algorithm to an arbitrary formula of F at most n times; Congruence partitions about ...

主要结果是：在逻辑系统 Gr，Gr 中，重言式不可能由对非重言式进行有限次升级算法得到；在逻辑系统Sn 中，对任一公式最多进行n次升级算法即可得到重言式；利用可达广义重言式概念和α矛盾式概念分别在 Gr，Gr，Sn 中给出了F的一个关于同余的分划。

It holds that, by means of logic inference,"x believes p" can be interpreted as "x thinks that p is true". By the same token, the system of the Logic of Belief can-be established, on the basis of the logic of its classical proposition, by adding the modal auxiliary "should "before t...

作者认为，从逻辑的观点出发，可以简单地将&x 相信 p&解释为&x认为p是真的&，与之相对应，信念逻辑系统可以在经典命题逻辑的基础上加入模态词&应该&而得以建立。

It holds that, by means of logic inference,"x believes p" can be interpreted as "x thinks that p is true". By the same token, the system of the Logic of Belief can-be established, on the basis of the logic of its classical proposition , by adding the modal auxiliary "should "before the verb "believe".

作者认为，从逻辑的观点出发，可以简单地将&x 相信 p&解释为&x认为p是真的&，与之相对应，信念逻辑系统可以在经典命题逻辑的基础上加入模态词&应该&而得以建立。

We have no common name for a mime of Sophron or Xenarchus and a Socratic Conversation; and we should still be without one even if the imitation in the two instances were in trimeters or elegiacs or some other kind of verse--though it is the way with people to tack on 'poet' to the name of a metre, and talk of elegiac-poets and epic-poets, thinking that they call them poets not by reason of the imitative nature of their work, but indiscriminately by reason of the metre they write in.

索夫农 、森那库斯和苏格拉底式的对话采用的模仿没有一个公共的名称；三音步诗、挽歌体或其他类型的诗的模仿也没有——人们把&诗人&这一名词和格律名称结合到一起，称之为挽歌体诗人或者史诗诗人，他们被称为诗人，似乎只是因为遵守格律写作，而非他们作品的模仿本质。

The relationship between communicative competence and grammar teaching should be that of the ends and the means.

交际能力和语法的关系应该是目标与途径的关系。