Results 11 to 20 of about 923,849 (196)
Filteristic Soft Lattice Implication Algebras
, 2011 Applying the idea of soft set theory to lattice implication algebras, the novel concept of (implicative) filteristic soft lattice implication algebras which related to (implicative) filter(for short, (IF-)F-soft lattice implication algebras) are introduced. Basic properties of (IF-)F-soft lattice implication algebras are derived.
Yi Liu, Yang Xu
openaire +3 more sources
On upper modular subalgebras of a Lie algebra. [PDF]
, 2004 This paper is a further contribution to the extensive study by a number of authors of the subalgebra lattice of a Lie algebra. We give some necessary and some sufficient conditions for a subalgebra to be upper modular.
Bowman, Kevin +2 more
core +4 more sources
α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X) [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper is focused on α-generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic.
Jiafeng Zhang, Yang Xu, Xingxing He
doaj +1 more source
On semi-modular subalgebras of Lie algebras over fields of arbitrary characteristic. [PDF]
, 2008 This paper is a further contribution to the extensive study by a number of authors of the subalgebra lattice of a Lie algebra. It is shown that, in certain circumstances, including for all solvable algebras, for all restricted Lie algebras over ...
Towers, David A.
core +4 more sources
Linguistic-Valued Approximate Reasoning With Lattice Ordered Linguistic-Valued Credibility [PDF]
International Journal of Computational Intelligence Systems, 2015 Linguistic terms are often used to represent the truth degree or credibility degree to manage the uncertainty or imprecision as one of popular ways of knowledge representation in the perception-based decision making problem.
Li Zou, Yunxia Zhang, Xin Liu
doaj +1 more source
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems [PDF]
International Journal of Computational Intelligence Systems, 2015 In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system ℒ P(X) based on lattice implication algebra.
Weitao Xu +4 more
doaj +1 more source
From Intuitionism to Brouwer's Modal Logic
Bulletin of the Section of Logic, 2020 We try to translate the intuitionistic propositional logic INT into Brouwer's modal logic KTB. Our translation is motivated by intuitions behind Brouwer's axiom p →☐◊p The main idea is to interpret intuitionistic implication as modal strict implication ...
Zofia Kostrzycka
doaj +1 more source
α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic [PDF]
International Journal of Computational Intelligence Systems, 2012 This paper focuses on effcient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution.
Xingxing He +3 more
doaj +1 more source
α-Minimal Resolution Principle For A Lattice-Valued Logic [PDF]
International Journal of Computational Intelligence Systems, 2015 Based on the academic ideas of resolution-based automated reasoning and the previously established research work on binary α-resolution based automated reasoning schemes in the framework of lattice-valued logic with truth-values in a lattice ...
Hairui Jia, Yang Xu, Yi Liu, Jun Liu
doaj +1 more source
On Lie algebras all of whose minimal subalgebras are lower modular. [PDF]
, 2004 The main purpose of this paper is to study Lie algebras L such that if a subalgebra U of L has a maximal subalgebra of dimension one then every maximal subalgebra of U has dimension one. Such an L is called lm(0)-algebra.
Kevin Bowman +5 more
core +4 more sources