In this paper we investigate decompositions of submodules in modules over a Proufer domain into intersections of quasi-primary and classical quasi-primary submodules. In particular, existence and uniqueness of quasi-primary decompositions in modules over a Proufer domain of finite character are proved. Proufer domain; primary submodule; quasi-primary submodule; classical quasi-primary; decompo...

and Applied Analysis 3 The quasi-uniform space X,U will always be considered to be a topological space with the topology obtained by using as the family of all neighborhoods of a point x0 ∈ X all sets of the formU x0 {x ∈ X : x0, x ∈ U}, whereU runs overU. Such a topology is called topology of the quasi-uniformity. Note that each topology onX is induced by a quasi-uniformity see 8, 9 , the most...

Algorithmic random number generators require recurring sequences with very long periods and good multivariate uniformity properties. Point sets and sequences for quasi-Monte Carlo numerical integration need similar multivariate uniformity properties as well. It then comes as no surprise that both types of applications share common (or similar) construction methods. However, there are some diffe...

An H1Galerkin mixed finite element method is discussed for a class of second order hyperbolic problems. It is proved that the Galerkin approximations have the same rates of convergence as in the classical mixed method, but without LBB stability condition and quasi-uniformity requirement on the finite element mesh. Compared to the results proved for one space variable, the L∞(L2)-estimate of the...

In this note we present a new treatment of the pointfree version of the semicontinuous quasi-uniformity based on the new tool of the ring of arbitrary (not necessarily continuous) real-valued functions made available recently by J. Gutiérrez Garćıa, T. Kubiak and J. Picado [Localic real functions: a general setting, Journal of Pure and Applied Algebra 213 (2009) 1064-1074]. The purpose is to sh...

In this paper, we present a paraconsistent description logic based on quasi-classical logic. Compared to the four-valued description logic, quasi-classical description logic satisfies all of the three basic inference rules (i.e., modus ponens, modus tollens and disjunctive syllogism) so that the inference ability of quasiclassical description logic is closer to that of classical logic. Quasicla...