For a domain $G$ in the one-point compactification $\overline{\mathbb{R}}^n = \mathbb{R}^n \cup \{ \infty\}$ of $\mathbb{R}^n, n \ge 2$, we characterize completeness modulus metric $\mu_G$ terms potential-theoretic thickness condition $\partial G\,,$ Martio's $M$-condition. Next, prove that G$ is uniformly perfect if and only admits minorant M\"obius invariant metric. Several applications to qu...

Considering the contention for communication resources in task scheduling is discussed in [3]. Theorem 1 of [3] states the NP-completeness of the associated decision problem and the corresponding proof shows NP-completeness in the weak sense [2]. Here, a new proof is presented for Theorem 1 of [3] that shows NP-completeness in the strong sense. The proof is based on a reduction from the well-kn...

in this paper, the maximal dissipative extensions of a symmetric singular 1d discrete hamiltonian operator with maximal deficiency indices (2,2) (in limit-circle cases at ±∞) and acting in the hilbert space ℓ_{ω}²(z;c²) (z:={0,±1,±2,...}) are considered. we consider two classes dissipative operators with separated boundary conditions both at -∞ and ∞. for each of these cases we establish a self...

In this paper we explore the complexity of various problems pertaining to Input Resolution, a very restricted form of Resolution which requires that at least one input to every instance of the resolution rule be an input clause. This proof system is of practical interest because Input Resolution is equivalent to Unit Resolution, a popular subroutine used in many areas of computer science, espec...

The aim of this paper is to provide new ways dealing with dynamic programming using a context newly proven results about fixed-point problems in linear spaces endowed fuzzy norm. In our paper, the general framework set normed as they are defined by N?d?ban and Dzitac. When completeness required, we will use George Veeramani (G-V) setup, which, for purposes, consider be more suitable than Grabie...

in this paper, we shall define and study the concept of  -statistical convergence and  -statistical cauchy inrandom 2-normed space. we also introduce the concept of  -statistical completeness which would provide amore general frame work to study the completeness in random 2-normed space. furthermore, we also prove some new results.

We present a Hilbert-style axiomatization of a paraconsistent logic, called G3, recently introduced. G ′ 3 is based on a 3-valued semantics. We prove a soundness and completeness theorem. The replacement theorem holds in G3. As it has already been shown in previous work, G ′ 3 can express some nonmonotonic semantics.