The concept of an $L$-bornology is introduced and the theory of $L$-bornological spacesis being developed. In particular the lattice of all $L$-bornologies on a given set is studied and basic properties ofthe category of $L$-bornological spaces and bounded mappings are investigated.

(0, 1,2}. The set of three-valued logical functions (i.e., f: E” --t E for n=l,2,... ) is denoted by P3. A subset F of P3 is said to be closed if it contains all superpositions (i.e., compositions or substitutions) of its members (cf. [l, 1 l-131). For closed sets F and H such that FC H (proper inclusion), F is an H-maxima/ set if FC G c H for no closed set G. A subset F of H is complete in H i...

In general, constructing a locally-optimal structure is a little harder than constructing an arbitrary structure, but significantly easier than constructing a globally-optimal structure. A similar situation arises in listing. In counting, most problems are #P-complete, but in approximate counting we observe an interesting reversal of the pattern. Assuming that #BIS is not equivalent to #SAT und...

In this paper, we present equivalent characterizations of L-closure systems on lower bounded complete L-ordered sets and complete L-lattices, respectively. These results demonstrate the feasibility of notion of fuzzy closure system developed in our previous work (L.-K. Guo, G.-Q. Zhang, Q.-G. Li: Fuzzy closure systems on L-ordered sets. Math. Log. Quart. 57 (3) (2011), 281-291.). Also we develo...

Recently, Molodtsov [12] introduced the soft set as a mathematical tool for dealing information as the uncertainty of data in engineering, physics, computer sciences and many other diverse field. Presently, the soft set theory is making progress rapidly [1,3]. Pawlak’s rough set [13,14] can be viewed as a special case of soft rough sets [3]. The topological structures of soft sets have been dev...

A graph G is called complete if any two of its vertices are connected by an edge, a set of vertices of G are said to be independent if no two of them are connected by an edge . A well known theorem of Ramsay1 states that an infinite graph either contains an infinite complete subgraph or an infinite set of independent vertices . He also proved the finite form of this theorem, namely that there e...

We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...