Let P = {pi|i = 1, 2, . . . , n} be a set of n elements with partial order defined as follows: pi ≤ pj if and only if i divides j. Assume real numbers are assigned to all members of P in an order preserving manner, this results in a set A of n real numbers. Given an unknown x ∈ R, we want to determine whether x is belong to A or not, by comparing x with as few elements of A as possible. We pres...

In a paper entitled Noncommutative valuations, Schilling [8] proved that if an algebra of finite order over its center is relatively complete in a valuation (where the value group of the nonarchimedean, exponential valuation is not assumed to be commutative) then the value group is commutative. A similar type of theorem, proved by Albert [l], states that if an algebra of finite order over a fie...

Let X, X′ be two locally finite, preordered sets and let R be any indecomposable commutative ring. The incidence algebra I(X,R), in a sense, represents X, because of the wellknown result that if the rings I(X,R) and I(X′,R) are isomorphic, then X and X′ are isomorphic. In this paper, we consider a preordered set X that need not be locally finite but has the property that each of its equivalence...

Resolution reasoners, when applied to set theory problems, typically suffer from “lack of focus.” MARS is a program that attempts to rectify this difficulty by exploiting the definition-like character of the set theory axioms. As in the case of its predecessor, SLIM, it employs a tableau proof procedure based on binary resolution, but MARS IS enhanced by an equality substitution rule and a devi...

We find the formula for the cardinality of maximal set of integers from [1,. .. , n] which does not contain k + 1 pairwise coprimes and has divisors from a specified set of primes. This formula is defined by the set of multiples of the generating set, which does not depend on n. 1 Formulation of the result Let P = {p 1 < p 2 ,. . .} be the set of primes and N be the set of natural numbers. Writ...

In this paper, we present the induced generalized intuitionistic fuzzy ordered weighted averaging (IGIFOWA) operator. It is a new aggregation operator that generalized the IFOWA operator, including all the characteristics of both the generalized IFOWA and the induced IFOWA operators. It provides a very general formulation that includes as special cases a wide range of aggregation operators for ...

We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated support for constructing proofs within this set theory. One of the novel aspects of the representation is that one is allowed to use any class (in the set theory) as a type (in the type theory). Such class types allow a natural way...

The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing elements touch each other. One of the most basic questions on contact graphs is to find the maximum number of edges that a contact graph of a packing of n unit ...

Using the notion of bipolar-valued fuzzy sets, the concepts of bipolar fuzzy (weak, s-weak, strong) hyper BCK-ideals are introduced, and their relations are discussed in [3]. Further properties are investigated in this article. We show that if Φ = (H ;μΦ , μ N Φ ) is a bipolar fuzzy (weak, strong) hyper BCK-ideal of a hyper BCK-algebra H, then the set I := {x ∈ H | μΦ(x) = μΦ(0), μΦ (x) = μΦ (0...