The search session has expired. Please query the service again.
Displaying 801 –
820 of
3896
We deal with decomposition theorems for modular measures defined on a D-lattice with values in a Dedekind complete -group. Using the celebrated band decomposition theorem of Riesz in Dedekind complete -groups, several decomposition theorems including the Lebesgue decomposition theorem, the Hewitt-Yosida decomposition theorem and the Alexandroff decomposition theorem are derived. Our main result—also based on the band decomposition theorem of Riesz—is the Hammer-Sobczyk decomposition for -group-valued...
The aim of this paper is to show that every Hausdorff continuous interval-valued function on a completely regular topological space X corresponds to a Dedekind cut in C(X) and conversely.
In this paper we shall give some results on irreducible deductive systems in BCK-algebras and we shall prove that the set of all deductive systems of a BCK-algebra is a Heyting algebra. As a consequence of this result we shall show that the annihilator of a deductive system is the the pseudocomplement of . These results are more general than that the similar results given by M. Kondo in [7].
This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to provide formal apparatus which eanbles to work with recursive calls within the Mizar langauge. To achieve this...
A definition of finiteness is a set-theoretical property of a set that, if the Axiom of Choice (AC) is assumed, is equivalent to stating that the set is finite; several such definitions have been studied over the years. In this article we introduce a framework for generating definitions of finiteness in a systematical way: basic definitions are obtained from properties of certain classes of binary relations, and further definitions are obtained from the basic ones by closing them under subsets...
L’albero binario (libero) è una struttura analoga a quella dei numeri naturali (standard), salvo che ci sono due operazioni di successivo. Nello studio degli alberi binari non standard, si ha bisogno di strutture ordinate che stiano a quella di albero binario libero come la struttura (ordinata) Z sta ad N. Si introducono perciò i clan binari e se ne studiano le classi di isomorfismo. Si dimostra che esse sono determinate dalle classi di similitudine delle successioni numerabili di 2 elementi, avendo...
Using the polytopes defined in an earlier paper, we show in this paper the existence of
degeneration of a large class of Schubert varieties of to toric varieties by
extending the method used by Gonciulea and Lakshmibai for a miniscule to Schubert
varieties in .
Based on a completely distributive lattice , degrees of compatible -subsets and compatible mappings are introduced in an -approximation space and their characterizations are given by four kinds of cut sets of -subsets and -equivalences, respectively. Besides, some characterizations of compatible mappings and compatible degrees of mappings are given by compatible -subsets and compatible degrees of -subsets. Finally, the notion of complete -sublattices is introduced and it is shown that the...
Currently displaying 801 –
820 of
3896