任务逻辑中的定理

基于任务逻辑的语义语构理论,提出模仿策略的概念,详细讨论任务逻辑形式系统L中的定理并给出其证明,得到许多有趣的结果。     

基于中介逻辑的对序逻辑系统

本文基于中介逻辑建立了一种中介时序逻辑系统ＭＴＬ（Ｍｅｄｉｕｍ Ｔｅｍｐｏｒａｌ Ｌｏｇｉｃ），文中着重讨论了ＭＴＬ的形式系统并给出了它的语义解释，证明了ＭＴＬ系统的可靠性。最后对ＭＴＬ系统和经典时序命题逻辑系统进行了对比，指出经典时序命题逻辑系统是ＭＴＬ的子系统。     

系统(￡)*n的逻辑性质及其应用

证明了系统(￡)*n中的可满足性定理,紧致性定理和可判定性定理,完善了系统(￡)*n的理论体系,并将这些性质应用到计量逻辑学中,给出了∑Γ-真度和条件真度存在的充要条件.     

基于中介逻辑的时序逻辑系统

本文基于中介逻辑建立了一种中介时序逻辑系统ＭＴＬ（Ｍｅｄｉｕｍ Ｔｅｍｐｏｒａｌ Ｌｏｇｉｃ），文中着重讨论了ＭＴＬ的形式系统并给出了它的语义解释，证明了ＭＴＬ系统的可靠性．最后对ＭＴＬ系统和经典时序命题逻辑系统进行对比，指出经典时序命题逻辑系统是ＭＴＬ的子系统     

线性逻辑相空间的分层结构

本文研究了相空间的代数结构,定义了多层相空间,给出了一个相空间的最小子空间的性质.并据此讨论了线性重言式的某些特点.     

2n-布尔值逻辑:2-值命题逻辑的自然推广

将2-值命题逻辑的语义理论推广到了有限布尔代数,得到了2n-布尔值命题逻辑.同时本文给出了2n-布尔值命题逻辑应用的一些例子.     

“虚假理由”究竟是否为逻辑错误

《数学通报》文[1]提到“虚假理由”是事实错误,而不是逻辑错误。文中指出所谓逻辑错误就是不符合逻辑学的规則,据此说法,那“虚假理由”是符合逻辑学的规則,只是不符合客观事实。笔者认为对此值得商榷,“虚假理由”究竟是否为逻辑错误,本文略述浅见。一、什么是逻辑错误我们所论及的逻辑错误,当然与逻辑学分不开的。这里所谓的逻辑学应当指的是通常所说的     

中介时序逻辑系统MTL的完备性

本文对[1]中的系统MTL进行了进一步的讨论,给出了它的模型论性质,基于中介逻辑,构造了一种可传有序模型,证明了MTL系统的完备性.     

MP*与各种命题联结词含量完全的三值逻辑在语言表达能力上的等效性研究

本文基于中介命题逻辑的扩张系统 MP*之命题联结词含量的完全性结果 ,进一步证明了 Lukasiwicz三值逻辑系统 L*3 、Post三值逻辑系统 P*3 、Slupecki三值逻辑系统 S*3 和 Woodruff三值逻辑系统 W*3 等的命题联结词的含量也是完全的 .从而着眼于形式系统 ,可知 MP*、L*3 、P*3 、S*3 、W*3 的语言表达的能力也都是等效的 .又若这些三值系统都是可靠的完备的 ,则可进一步证明这些三值系统立足于形式推理也都是互相等价的 .     

二值命题逻辑中逻辑方程τ(A→X)=m/2n解集的结构

二值命题逻辑中τ(A→X)=α型逻辑方程在有限理论结论集的结构以及近似推理研究中有着重要应用.给出了二值命题逻辑中公式是逻辑方程τ(A→X)=m/2n解的几个充要条件,得到了该逻辑方程的解集分别按真度相等关系和逻辑等价关系的分类定理,并给出了逻辑方程解集中公式的伪距离上确界的数值表示,为进一步研究此类逻辑方程的解集提供...     

Kleene蕴涵算子的导出算子的n值逻辑系统In

考虑了Kleene蕴涵算子的导出算子的三值逻辑系统I3 和n值逻辑系统In(n >3)。首先,给出I3的真值表,证明了I3 是二值逻辑系统C2 的推广。其次,讨论了I3 中的重言式与IPC公理之间以及I3 中的准重言式与C2 中的重言式之间的关系。接着,考虑了In中的子代数。最后,考虑了不同逻辑系统In中的重言式之间的关系     

模糊推理三I算法的逻辑基础

在模糊推理理论中，近期问世的三I推理方法以逻辑蕴涵运算取代传统的合成运算，从根本上改进了传统的合成推理规则(即CRI方法)。本文基于模糊命题逻辑的形式演绎系统L^*和模糊谓词逻辑的一阶系统K^*，构建了一个完备的多型变元一阶系统Kms^*，并且将三I算法完全纳入了模糊逻辑的框架之中，从而为模糊推理奠定了严格的逻辑基础。     

On the Drazin inverse of the sum of two operators and its application to operator matrices

Given two bounded linear operators F,G on a Banach space X such that G²F=GF²=0, we derive an explicit expression for the Drazin inverse of F+G. For this purpose, firstly, we obtain a formula for the resolvent of an auxiliary operator matrix in the form . From the provided representation of D(F+G) several special cases are considered. In particular, we recover the case GF=0 studied by Hartwig et al. [R.E. Hartwig, G. Wang, Y. Wei, Some additive results on Drazin inverse, Linear Algebra Appl. 322 (2001) 207-217] for matrices and by Djordjevi? and Wei [D.S. Djordjevi?, Y. Wei, Additive results for the generalized Drazin inverse, J. Aust. Math. Soc. 73 (1) (2002) 115-126] for operators. Finally, we apply our results to obtain representations for the Drazin inverse of operator matrices in the form which are extensions of some cases given in the literature.     

格值命题逻辑LP(X)中不可分极简式的性质

基于格值命题逻辑LP(X)的α-归结原理及α-归结自动推理方法，能够较好地刻画具有可比较性和不可比较性的不确定性信息。LP(X)中的不可分极简式是一个非常重要的概念，本文对蕴涵运算个数小于3的不可分极简式的性质和判定方法进行了讨论，得到了一些重要结论。     

泛逻辑的零级泛运算模型的代数性质

讨论泛逻辑的零级泛运算模型的基本代数性质。证明T（x,y,^）是阿基米德型三角范数;泛与运算模型与泛蕴涵运算模型形成一个伴随对;当h∈（0,0．75）时,有界格（[0,1],∨,∧,,＊,→0,1）做成一个MV-代数;当h∈（0．75,1）时,有界格（[0,1],∨,∧,＊,→0,1）做成一个乘积代数。进一步,给出了零级泛与运算模型与泛或运算模型的加性生成元与乘性生成元。     

Categorical Abstract Algebraic Logic: Algebraic Semantics for (\documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf{\pi }$\end{document})‐Institutions

Various aspects of the work of Blok and Rebagliato on the algebraic semantics for deductive systems are studied in the context of logics formalized as π‐institutions. Three kinds of semantics are surveyed: institution, matrix (system) and algebraic (system) semantics, corresponding, respectively, to the generalized matrix, matrix and algebraic semantics of the theory of sentential logics. After some connections between matrix and algebraic semantics are revealed, it is shown that every (finitary) N‐rule based extension of an N‐rule based π‐institution possessing an algebraic semantics also possesses an algebraic semantics. This result abstracts one of the main theorems of Blok and Rebagliato. An attempt at a Blok‐Rebagliato‐style characterization of those π‐institutions with a mono‐unary category of natural transformations on their sentence functors having an algebraic semantics is also made. Finally, a necessary condition for a π‐institution to possess an algebraic semantics is provided.     

一阶模糊谓词逻辑公式的区间解释真度理论

通过引进一阶模糊语言变元集赋值的新概念,给出了一阶模糊谓词逻辑(或一阶模糊语言)公式的区间解释真度的定义,并讨论了它们的一系列性质。     

From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective

We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal solution to a fluid relaxation, in which we replace discrete jobs with the flow of a continuous fluid, and use ideas from fair queueing in the area of communication networks in order to ensure that the discrete schedule is close to the one implied by the fluid relaxation. FSA produces a schedule with makespan at most C _max+(I+2)P _max J _max, where C _max is the lower bound provided by the fluid relaxation, I is the number of distinct job types, J _max is the maximum number of stages of any job-type, and P _max is the maximum processing time over all tasks. We report computational results based on all benchmark instances chosen from the OR library when N jobs from each job-type are present. The results suggest that FSA has a relative error of about 10% for N=10, 1% for N=100, 0.01% for N=1000. In comparison to eight different dispatch rules that have similar running times as FSA, FSA clearly dominates them. In comparison to the shifting bottleneck heuristic whose running time and memory requirements are several orders of magnitude larger than FSA, the shifting bottleneck heuristic produces better schedules for small N (up to 10), but fails to provide a solution for larger values of N. Received: September 1999 / Accepted: September 2001?Published online March 14, 2002     

Slutsky定理在样本分位数的极限分布证明上的应用

为了更好地理解和应用样本分位数的极限分布,利用Slutsky定理,推导了样本分位数的极限分布.