共查询到20条相似文献,搜索用时 173 毫秒
1.
基础R0-代数与基础L*系统 总被引:73,自引:0,他引:73
研究了王国俊教授建立的模糊命题演算的形式演绎系统L^*和与之在语义上相匹配的R0-代数,以及:Petr Hajek建立的模糊命题演算系统BL和BL-代数,提出了基础R0-代数和基础L^*系统的观点,讨论了基础L^*代数与BL代数,基础L^*系统与BL系统之间.的相互关系及相对独立性,讨论了基础L^*系统关于基础风一代数的完备性问题,证明了MV-代数是特殊的基础R0-代数,指出了Lukasiewicz模糊命题演算系统是基础L^*系统的扩张,最后作为基础R0-代数与基础L^*系统的一个应用,证明了L^*系统关于语义Ωw的完备性,并在将模糊命题演算系统中的推演证明转化为相应逻辑代数中的代数运算方面作了一些尝试. 相似文献
2.
一类二次系统定义的双参数三次代数曲线解族 总被引:2,自引:0,他引:2
李学鹏 《数学年刊A辑(中文版)》1998,(6)
本文给出一类由二次系统定义的双参数三次代数曲线解族,研究族中曲线解的轨线成为分界线环或其一部份的充要条件及相应系统的全局相图,从而揭示了由代数曲线解确定的二次系统的异宿环(有界或无界)及退化奇点分支出同宿环的某些现象.另外,本文的结果表明文[3]中关于二次系统的三次代数曲线同宿环的结论是不完备的. 相似文献
3.
4.
离散事件动态系统的关键路径与扰动分析 总被引:9,自引:0,他引:9
具有存储器的串行生产线是一典型离故事件动态系统.本文在其极大代数上线性状态方程的基础上,定义了关键路径,并研究了关键路径的特性.通过关键路径,给出了其扰动分析方法. 相似文献
5.
1引言微分-代数系统包括具有约束条件的微分方程和奇异隐式微分方程,在实际应用中,如:约束力学系统、流体动力学、化学反应动力学、电子网络模拟、控制工程和机器人技术等领域就产生了诸多问题需要求解.近年来,微分-代数系统已极大地引起了许多工程师和数学工作者的关注,开展了众多相关问题的探讨,提出了许多新的算法理论[1-3].在本文中我们对指标-2的微分-代数方程利用Runge-Kutta方法进行时间的离散和动力学迭代,研究离散迭代系统的收敛性. 相似文献
6.
本文利用已有的loop代数$\widetilde{A}_{1}$构造出代数系统$X$,然后建立了一个新的等谱问题得到著名的Volterra lattice可积系,最后通过构造出的$X$的扩展代数系统$\widetilde{X}$得到已有的可积系的可积耦合系统. 相似文献
7.
8.
龚文振 《纯粹数学与应用数学》2009,25(3):435-441
利用范数理论和代数方法,研究了离散广义系统的区间平稳振荡问题.给出了两种区间矩阵平稳振荡存在的充分条件.提供了可行性的算例. 相似文献
9.
基础R0-代数的性质及在L*系统中的应用 总被引:14,自引:1,他引:13
研究了王国俊教授建立的模糊命题演算的形式演绎系统L*和与之在语义上相关的R0-代数,提出了基础Ro-代数的观点并讨论了其中的一些性质,在将L*系统中的推演证明转化为相应的R0-代数中的代数运算方面作了一些尝试,作为它的一个应用,证明了L*系统中的模糊演绎定理. 相似文献
10.
11.
Josep Maria Font Àngel J. Gil Antoni Torrens Ventura Verdú 《Archive for Mathematical Logic》2006,45(7):839-868
Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens.While writing this paper, the authors were partially supported by grants MTM2004-03101 and TIN2004-07933-C03-02 of the Spanish Ministry of Education and Science, including FEDER funds of the European Union. 相似文献
12.
《Fuzzy Sets and Systems》2005,149(2):297-307
Among the class of residuated fuzzy logics, a few of them have been shown to have standard completeness both for propositional and predicate calculus, like Gödel, NM and monoidal t-norm-based logic systems. In this paper, a new residuated logic NMG, which aims at capturing the tautologies of a class of ordinal sum t-norms and their residua, is introduced and its standard completeness both for propositional calculus and for predicate calculus are proved. 相似文献
13.
Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy. 相似文献
14.
Abir Nour 《Mathematical Logic Quarterly》1999,45(4):457-466
In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′T logic and the intuitionistic and classical logics. 相似文献
15.
In abstract algebraic logic, the general study of propositional non-classical logics has been traditionally based on the abstraction
of the Lindenbaum-Tarski process. In this process one considers the Leibniz relation of indiscernible formulae. Such approach
has resulted in a classification of logics partly based on generalizations of equivalence connectives: the Leibniz hierarchy. This paper performs an analogous abstract study of non-classical logics based on the kind of generalized implication connectives
they possess. It yields a new classification of logics expanding Leibniz hierarchy: the hierarchy of implicational logics. In this framework the notion of implicational semilinear logic can be naturally introduced as a property of the implication, namely a logic L is an implicational semilinear logic iff it
has an implication such that L is complete w.r.t. the matrices where the implication induces a linear order, a property which
is typically satisfied by well-known systems of fuzzy logic. The hierarchy of implicational logics is then restricted to the
semilinear case obtaining a classification of implicational semilinear logics that encompasses almost all the known examples
of fuzzy logics and suggests new directions for research in the field. 相似文献
16.
17.
HEYTING代数与FUZZY蕴涵代数 总被引:5,自引:0,他引:5
Heyting代数是作为直觉主义命题逻辑的代数模型而引进的Fuzzy蕴涵代数是 [0 ,1]值逻辑的蕴函联结词的一种代数抽象 .本文给出Heyting代数的若干基本性质 ,并证明了Heyting代数是Fuzzy蕴涵代数 ,也是Heyting型Fuzzy蕴涵代数。 相似文献
18.
《Journal of Pure and Applied Algebra》2024,228(2):107415
We extend Lawvere-Pitts prop-categories (aka. hyperdoctrines) to develop a general framework for providing fibered algebraic semantics for general first-order logics. This framework includes a natural notion of substitution, which allows first-order logics to be considered as structural closure operators just as propositional logics are in abstract algebraic logic. We then establish an extension of the homomorphism theorem from universal algebra for generalized prop-categories and characterize two natural closure operators on the prop-categorical semantics. The first closes a class of structures (which are interpreted as morphisms of prop-categories) under the satisfaction of their common first-order theory and the second closes a class of prop-categories under their associated first-order consequence. It turns out that these closure operators have characterizations that closely mirror Birkhoff's characterization of the closure of a class of algebras under the satisfaction of their common equational theory and Blok and Jónsson's characterization of closure under equational consequence, respectively. These algebraic characterizations of the first-order closure operators are unique to the prop-categorical semantics. They do not have analogues, for example, in the Tarskian semantics for classical first-order logic. The prop-categories we consider are much more general than traditional intuitionistic prop-categories or triposes (i.e., topos representing indexed partially ordered sets). Nonetheless, to the best of our knowledge, our results are new, even when restricted to these special classes of prop-categories. 相似文献
19.
This work deals with the exponential fragment of Girard's linear logic ([3]) without the contraction rule, a logical system which has a natural relation with the direct logic ([10], [7]). A new sequent calculus for this logic is presented in order to remove the weakening rule and recover its behavior via a special treatment of the propositional constants, so that the process of cut-elimination can be performed using only “local” reductions. Hence a typed calculus, which admits only local rewriting rules, can be introduced in a natural manner. Its main properties — normalizability and confluence — has been investigated; moreover this calculus has been proved to satisfy a Curry-Howard isomorphism ([6]) with respect to the logical system in question. MSC: 03B40, 03F05. 相似文献
20.