共查询到20条相似文献,搜索用时 281 毫秒
1.
Xueling Ma Jianming Zhan Yang Xu 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(11):1079-1087
In this paper, we introduce the notions of interval valued -fuzzy filters and interval valued -fuzzy Boolean (implicative) filters in R
0-algebras and investigate some of their related properties. Some characterization theorems of these generalized fuzzy filters
are derived. In particular, we prove that an interval valued fuzzy set F in R
0-algebras is an interval valued -fuzzy Boolean filter if and only if it is an interval valued -fuzzy implicative filter. 相似文献
2.
Jialu Zhang Guojun Wang Mingdi Hu 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(6):585-591
This paper introduces the concepts of R
0 valuation, R
0 semantic, countable R
0 category , R
0 fuzzy topological category , etc. It is established in a natural way that the fuzzy topology δ and its cut topology on the set Ω
M
consisting of all R
0 valuations of an R
0 algebra M, and some properties of fuzzy topology δ and its cut topology are investigated carefully. Moreover, the representation theorem
for R
0 algebras by means of fuzzy topology is given, that is to say the category is equivalent to the category . By studying the relation between valuations and filters, the Loomis–Sikorski theorem for R
0 algebras is obtained. As an application, K-compactness of the R
0 logic is discussed. 相似文献
3.
Jiří Rachůnek Dana Šalounová 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(6):565-571
The class of bounded residuated lattice ordered monoids Rl-monoids) contains as proper subclasses the class of pseudo BL-algebras (and consequently those of pseudo MV-algebras, BL-algebras and MV-algebras) and of Heyting algebras. In the paper we introduce and investigate local bounded Rl-monoids which generalize local algebras from the above mentioned classes of fuzzy structures. Moreover, we study and characterize
perfect bounded Rl-monoids. 相似文献
4.
Generalized fuzzy bi-ideals of semigroups 总被引:1,自引:0,他引:1
Osman Kazancı Sultan Yamak 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2008,12(11):1119-1124
After the introduction of fuzzy sets by Zadeh, there have been a number of generalizations of this fundamental concept. The
notion of (∈, ∈ ∨q)-fuzzy subgroups introduced by Bhakat is one among them. In this paper, using the relations between fuzzy points and fuzzy
sets, the concept of a fuzzy bi-ideal with thresholds is introduced and some interesting properties are investigated. The
acceptable nontrivial concepts obtained in this manner are the (∈, ∈ ∨q)-fuzzy bi-ideals and -fuzzy bi-ideals, which are extension of the concept of a fuzzy bi-ideal in semigroup. 相似文献
5.
6.
7.
Enrico Marchioni 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(6):559-564
In this work we further explore the connection between -algebras and ordered fields. We show that any two -chains generate the same variety if and only if they are related to ordered fields that have the same universal theory.
This will yield that any -chain generates the whole variety if and only if it contains a subalgebra isomorphic to the -chain of real algebraic numbers, that consequently is the smallest -chain generating the whole variety. We also show that any two different subalgebras of the -chain over the real algebraic numbers generate different varieties. This will be exploited in order to prove that the lattice
of subvarieties of -algebras has the cardinality of the continuum. Finally, we will also briefly deal with some model-theoretic properties of
-chains related to real closed fields, proving quantifier-elimination and related results. 相似文献
8.
Radomír Halaš Michal Botur 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(11):1063-1072
Hájek introduced the logic enriching the logic BL by a unary connective vt which is a formalization of Zadeh’s fuzzy truth value “very true”. algebras, i.e., BL-algebras with unary operations, called vt-operators, which are among others subdiagonal, are an algebraic counterpart of Partially ordered commutative integral residuated monoids (pocrims) are common generalizations of both BL-algebras and Heyting
algebras. The aim of our paper is to introduce and study algebraic properties of pocrims endowed by “very-true” and “very-false”-like
operators.
Research is supported by the Research and Development Council of Czech Government via project MSN 6198959214. 相似文献
9.
10.
11.
In this survey article, we first introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. This concept is a generalized concept of quasi-coincidence of a fuzzy point within a fuzzy set. By using this new idea, we consider the interval valued (∈,∈∨q)-fuzzy sub-hypernear-rings (hyperideals) of a hypernear-ring, and hence, a generalization of a fuzzy sub-near-ring (ideal) is given. Some related properties of fuzzy hypernear-rings are described. Finally, we consider the concept of implication-based interval valued fuzzy sub-hypernear-rings (hyperideals) in a hypernear-ring, in particular, the implication operators in Lukasiewicz system of continuous-valued logic are discussed. 相似文献
12.
In this paper, the method of well-combined semantics and syntax proposed by Pavelka is applied to the research of the propositional
calculus formal system
. The partial constant values are taken as formulas, formulas are fuzzified in two manners of semantics and syntax, and inferring
processes are fuzzified. A sequence of new extensions {
} of the system
is proposed, and the completeness of
is proved. 相似文献
13.
Olaf Beyersdorff 《Theory of Computing Systems》2008,43(2):118-135
Disjoint
-pairs are a well studied complexity-theoretic concept with important applications in cryptography and propositional proof
complexity. In this paper we introduce a natural generalization of the notion of disjoint
-pairs to disjoint k-tuples of
-sets for k≥2. We define subclasses of the class of all disjoint k-tuples of
-sets. These subclasses are associated with a propositional proof system and possess complete tuples which are defined from
the proof system.
In our main result we show that complete disjoint
-pairs exist if and only if complete disjoint k-tuples of
-sets exist for all k≥2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all k-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof
systems.
An extended abstract of this paper appeared in the proceedings of the conference CSR 2006 (Lecture Notes in Computer Science
3967, 80–91, 2006).
Supported by DFG grant KO 1053/5-1. 相似文献
14.
Manuel Abad J. Patricio Díaz Varela 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(10):1007-1012
In this paper, we characterize factor congruences in the quasivariety of BCK-algebras. As an application we prove that the free algebra over an infinite set of generators is indecomposable in any subvariety
of BCK-algebras. We also study the decomposability of free algebras in the variety of hoop residuation algebras and its subvarieties. We prove that free algebras in a non k-potent subvariety of are indecomposable while finitely generated free algebras in k-potent subvarieties have a unique non-trivial decomposition into a direct product of two factors, and one of them is the
two-element implication algebra.
This paper is partially supported by Universidad Nacional del Sur and CONICET. 相似文献
15.
A. D. Nola A. Lettieri 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2005,9(12):889-896
BL-algebras were introduced by P. Hájek as algebraic structures of Basic Logic. The aim of this paper is to survey known results
about the structure of finite BL-algebras and natural dualities for varieties of BL-algebras. Extending the notion of ordinal sum of BL-algebras , we characterize a class of finite BL-algebras, actually BL-comets, which can be seen as a generalization of finite BL-chains. Then, just using BL-comets, we can represent any finite BL-algebra A as a direct product of BL-comets. This result can be seen as a generalization of the representation of finite MV-algebras as a direct product of MV-chains. Then we consider the varieties generated by one finite non-trivial totally ordered BL-algebra. For each of these varieties, we show the existence of a strong duality. As an application of the dualities, the
injective and the weak injective members of these classes are described. 相似文献
16.
Tomasz Jurdziński Friedrich Otto František Mráz Martin Plátek 《Theory of Computing Systems》2008,42(4):488-518
The
-automaton is the weakest form of the nondeterministic version of the restarting automaton that was introduced by Jančar et al. to model the so-called analysis by reduction. Here it is shown that the class ℒ(R) of languages that are accepted by
-automata is incomparable under set inclusion to the class
of Church-Rosser languages and to the class
of growing context-sensitive languages. In fact this already holds for the class
of languages that are accepted by 2-monotone
-automata. In addition, we prove that already the latter class contains
-complete languages, showing that already the 2-monotone
-automaton has a surprisingly large expressive power.
The results of this paper have been announced at DLT 2004 in Auckland, New Zealand.
This work was mainly carried out while T. Jurdziński was visiting the University of Kassel, supported by a grant from the
Deutsche Forschungsgemeinschaft (DFG).
F. Mráz and M. Plátek were partially supported by the Grant Agency of the Czech Republic under Grant-No. 201/04/2102 and by
the program ‘Information Society’ under project 1ET100300517. F. Mráz was also supported by the Grant Agency of Charles University
in Prague under Grant-No. 358/2006/A-INF/MFF. 相似文献
17.
18.
19.
Halfspace Matrices 总被引:1,自引:1,他引:0
Alexander A. Sherstov 《Computational Complexity》2008,17(2):149-178