The concept of soft sets, introduced by Molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. In this paper, weapply the notion of the soft sets of Molodtsov to the theory of Hilbert algebras.The notion of soft Hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...

in this paper, applying the concept of generalized a-valued norm on a right h  - module and also the notion of ϕ-homomorphism of finsler modules over c  -algebras we rst improve the de nition of the finsler module over h  -algebra and then de ne ϕ-morphism of finsler modules over h  -algebras. finally we present some results concerning these new ones.

recently, the algebraic theory of mv -algebras is intensively studied. in this paper, we extend the concept of derivation of $mv$-algebras and we give someillustrative examples. moreover, as a generalization of derivations of $mv$ -algebraswe introduce the notion of $f$-derivations and $(f; g)$-derivations of $mv$-algebras.also, we investigate some properties of them.

the concept of soft sets, introduced by molodtsov [20] is a mathematicaltool for dealing with uncertainties, that is free from the difficultiesthat have troubled the traditional theoretical approaches. in this paper, weapply the notion of the soft sets of molodtsov to the theory of hilbert algebras.the notion of soft hilbert (abysmal and deductive) algebras, soft subalgebras,soft abysms and sof...

assume that $(n,l)$, is a pair of finite dimensional nilpotent lie algebras, in which $l$ is non-abelian and $n$ is an ideal in $l$ and also $mathcal{m}(n,l)$ is the schur multiplier of the pair $(n,l)$. motivated by characterization of the pairs $(n,l)$ of finite dimensional nilpotent lie algebras by their schur multipliers (arabyani, et al. 2014) we prove some properties of a pair of nilpoten...

SFI WORKING PAPER: 2010-11-027 SFI Working Papers contain accounts of scientific work of the author(s) and do not necessarily represent the views of the Santa Fe Institute. We accept papers intended for publication in peer-reviewed journals or proceedings volumes, but not papers that have already appeared in print. Except for papers by our external faculty, papers must be based on work done at ...

In this paper we consider the problem of enumerating the submultisets of a multiset, in which each element has equal multiplicity. The crucial property is that consecutive submultisets in this listing differ one in the cardinality of only one of the elements. This is a generalization to k-ary numbers of the so-called Gray Codes for binary numbers. In the special case of binary numbers there is ...

We propose a new procedure that can enumerate justifications of a logical entailment given a set of inferences using which this entailment can be derived from axioms in the ontology. The procedure is based on the extension of the resolution method with so-called answer literals. In comparison to other (SAT-based) methods for enumerating justifications, our procedure can enumerate justifications...

It is known experimentally that there is a threshold for satisfiability in 3-CNF formulre around the value 4.25 for the ratio of variables to clauses. It is also known that the threshold is sharp [Fri99], but that proof does not give a value for the threshold. We use purely combinatorial techniques to count the number of satisfiable boolean formulre given in conjunctive normal form. The intenti...

Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behavior at larger ones. In many systems there is no single, optimal packing that dominates, but rather one must understand the entire set of possible packings. As a step in thi...