‎‎for any group $g$‎, ‎we define an equivalence relation $thicksim$ as below‎: ‎[forall g‎, ‎h in g gthicksim h longleftrightarrow |g|=|h|]‎ ‎the set of sizes of equivalence classes with respect to this relation is called the same-order type of $g$ and denote by $alpha{(g)}$‎. ‎in this paper‎, ‎we give a partial answer to a conjecture raised by shen‎. ‎in fact‎, ‎we show that if $g$ is a nilpot...

in the literature of life-testing, general progressive censoring has been studied extensively. but, all the results have been developed under the key assumption that the units undertest are independently distributed. in this paper, we study general progressively type-ii censored order statistics arising from identical units under test which are jointly distributed according to an archimedean co...

We define a π-calculus variant with a costed semantics where channels are treated as resources that must explicitly be allocated before they are used and can be deallocated when no longer required. We use a substructural type system tracking permission transfer to construct coinductive proof techniques for comparing behaviour and resource usage efficiency of concurrent processes. We establish f...

In the literature of life-testing, general progressive censoring has been studied extensively. But, all the results have been developed under the key assumption that the units undertest are independently distributed. In this paper, we study general progressively Type-II censored order statistics arising from identical units under test which are jointly distributed according to an Archimedean co...

In this paper we prove some stochastic comparisons results for progressive type II censored order statistics. The problem of stochastically comparing concomitants of the two progressive type II censored order statistics with possibly different schemes, under different kinds of dependence between X and Y is considered and it is proved that if Y is stochastically increasing (decreasing) in X, ...

We expose a new approach to tackle non-structural subtyping problems. We introduce uniform subtyping as a means to capture some properties of non-structural subtyping. In the uniform theory, we show that the validity of a first-order sentence is decidable, and entailment is PSPACEhard. In addition, we give decidable approximations to entailment and subtyping constrained types — two problems whi...