共查询到20条相似文献,搜索用时 466 毫秒
1.
A method is described for obtaining conjunctive normal forms for logics using Gentzen-style rules possessing a special kind of strong invertibility. This method is then applied to a number of prominent fuzzy logics using hypersequent rules adapted from calculi defined in the literature. In particular, a normal form with simple McNaughton functions as literals is generated for ?ukasiewicz logic, and normal forms with simple implicational formulas as literals are obtained for Gödel logic, Product logic, and Cancellative hoop logic. 相似文献
2.
The paper presents generalizations of results on so-called Horn logic, well-known in universal algebra, to the setting of
fuzzy logic. The theories we consider consist of formulas which are implications between identities (equations) with premises
weighted by truth degrees. We adopt Pavelka style: theories are fuzzy sets of formulas and we consider degrees of provability
of formulas from theories. Our basic structure of truth degrees is a complete residuated lattice. We derive a Pavelka-style
completeness theorem (degree of provability equals degree of truth) from which we get some particular cases by imposing restrictions
on the formulas under consideration. As a particular case, we obtain completeness of fuzzy equational logic. 相似文献
3.
Hans‐E. Porst 《Mathematical Logic Quarterly》2000,46(2):233-240
It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic (see [2]). In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known (see [1]). Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes are in fact (equivalent to) quasivarieties. 相似文献
4.
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. 相似文献
5.
Emil Jeřábek 《Annals of Pure and Applied Logic》2017,168(1):150-190
We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF) or substitution Frege (SF) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC polynomially simulate full intuitionistic logic for implicational tautologies. The results also apply to other fragments of other superintuitionistic logics under certain conditions.In particular, the exponential lower bounds on the length of intuitionistic EF proofs by Hrube? (2007), generalized to exponential separation between EF and SF systems in superintuitionistic logics of unbounded branching by Je?ábek (2009), can be realized by implicational tautologies. 相似文献
6.
7.
Fuzzy reasoning should take into account the factors of both the logic system and the reasoning model, thus a new fuzzy reasoning method called the symmetric implicational method is proposed, which contains the full implication inference method as its particular case. The previous full implication inference principles are improved, and unified forms of the new method are respectively established for FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens) to let different fuzzy implications be used under the same way. Furthermore, reversibility properties of the new method are analyzed from some conditions that many fuzzy implications satisfy, and it is found that its reversibility properties seem fine. Lastly, the more general α-symmetric implicational method is put forward, and its unified forms are achieved. 相似文献
8.
为了建立各种可换和非可换模糊逻辑的公共基础(蕴涵片段),提出了一个新的蕴涵逻辑,称为模糊BIK+-逻辑。证明了这一新的蕴涵逻辑的可靠性和弱完备性定理,同时讨论了模糊BIK+-逻辑与各种模糊逻辑之间的关系,以及与它们配套的代数结构之间的关系。 相似文献
9.
Songsong Dai Daowu Pei Donghui Guo 《International Journal of Approximate Reasoning》2013,54(5):653-666
This paper investigates the robustness of the full implication inference method and fully implicational restriction method for fuzzy reasoning based on two basic inference models: fuzzy modus ponens and fuzzy modus tollens. Some robustness results are proved based on general left continuous t-norms and induced residuated implications, and some important fuzzy implications. 相似文献
10.
Vilm Novk 《Mathematical Logic Quarterly》2002,48(4):563-573
This paper is a contribution to the development of fuzzy logic in narrow sense with evaluated syntax and connectives interpreted in Łukasiewicz algebra. The main results concern model theory of fuzzy logic (various kinds of submodels, chains of models) and generalization of the Craig‐Robinson's theorem on joint consistency of fuzzy theories as well as Craig's interpolation theorem. 相似文献
11.
Vilm Vychodil 《Mathematical Logic Quarterly》2006,52(2):171-186
The paper deals with fuzzy Horn logic (FHL) which is a fragment of predicate fuzzy logic with evaluated syntax. Formulas of FHL are of the form of simple implications between identities. We show that one can have Pavelka‐style completeness of FHL w.r.t. semantics over the unit interval [0, 1] with (residuated lattices given by) left‐continuous t‐norm and a residuated implication, provided that only certain fuzzy sets of formulas are considered. The model classes of fuzzy structures of FHL are characterized by closure properties. We also give comments on related topics proposed by N. Weaver. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
12.
Petr Cintula 《Archive for Mathematical Logic》2006,45(6):673-704
This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass–the class of weakly implicative fuzzy logics. It contains the majority of logics studied in the literature under the name fuzzy logic. We present many general theorems for both classes, demonstrating their usefulness and importance.The work was supported by grant A100300503 of the Grant Agency of the Academy of Sciences of the Czech Republic and by Institutional Research Plan AVOZ10300504. 相似文献
13.
We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. %
Mathematics Subject Classification (2000): 相似文献
14.
Many different fuzzy implication operators have been proposed; most of them fit into one of the two classes: implication operations that are based on an explicit representation of implication A → B in terms of &, , and ¬ (e.g., S-implications that are based on the formula B ¬ A), and R-implications that are based on an implicit representation of implication A → B as the weakest C for which C&B implies A. However, some fuzzy implication operations (such as ba) cannot be naturally represented in this form. To describe such operations, we propose a new (third) class of implication operations called A-implications whose relation to &, , and ¬ is described by (implicit) axioms. 相似文献
15.
16.
Bing Huang Yu-liang Zhuang Hua-xiong Li Da-kuan Wei 《Applied Mathematical Modelling》2013,37(12-13):7128-7141
Although the rough set and intuitionistic fuzzy set both capture the same notion, imprecision, studies on the combination of these two theories are rare. Rule extraction is an important task in a type of decision systems where condition attributes are taken as intuitionistic fuzzy values and those of decision attribute are crisp ones. To address this issue, this paper makes a contribution of the following aspects. First, a ranking method is introduced to construct the neighborhood of every object that is determined by intuitionistic fuzzy values of condition attributes. Moreover, an original notion, dominance intuitionistic fuzzy decision tables (DIFDT), is proposed in this paper. Second, a lower/upper approximation set of an object and crisp classes that are confirmed by decision attributes is ascertained by comparing the relation between them. Third, making use of the discernibility matrix and discernibility function, a lower and upper approximation reduction and rule extraction algorithm is devised to acquire knowledge from existing dominance intuitionistic fuzzy decision tables. Finally, the presented model and algorithms are applied to audit risk judgment on information system security auditing risk judgement for CISA, candidate global supplier selection in a manufacturing company, and cars classification. 相似文献
17.
C. J. van Alten 《Algebra Universalis》2007,57(1):47-62
The implicational subreducts of n-potent commutative integral residuated lattices are axiomatized using a new embedding of a BCK-algebra into a commutative
integral residuated lattice. The class of {→, 1, ≤ }-subreducts of commutative residuated lattices satisfying x
n
≤ x
m
is also axiomatized, as are other subreduct classes.
Presented by R. W. Quackenbush.
Received February 3, 2006; accepted in final form May 12, 2006. 相似文献
18.
19.
By means of the order structure of the related lattice, the LIMINF condition of fuzzy convergence classes is proposed in this paper, which reflects the essential difference between fuzzy convergence classes and ordinary convergence classes. The relationship between the LIMINF condition and two related conditions proposed by Liu and Wang respectively are discussed. The theory of fuzzy convergence classes based on LIMINF condition is established for topological molecular lattices, L-topological spaces (in the sense of Chang or Lowen), weakly induced spaces, and induced spaces. 相似文献
20.
剩余格与正则剩余格的特征定理 总被引:53,自引:2,他引:53
本文进一步研究了具有广泛应用的一类模糊逻辑代数系统——剩余格,并引入了正则剩余格的概念,对剩余格与正则剩余格的定义进行了讨论,给出了剩余格与正则剩余格的特征定理,其中包含剩余格与正则剩余格的等式特征,从而这两个格类都构成簇.本文还讨论了剩余格与正则剩余格公理系统的独立性,以及它们与相近代数结构的关系. 相似文献