All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 41 Next

Displaying 801 – 820 of 3896

Showing per page

Decomposition of ℓ -group-valued measures

Giuseppina Barbieri, Antonietta Valente, Hans Weber (2012)

Czechoslovak Mathematical Journal

We deal with decomposition theorems for modular measures μ : L → G 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...

Dedekind cuts in C(X)

Nicolae Dăneţ (2011)

Banach Center Publications

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.

Deductive systems of BCK-algebras

Sergio A. Celani (2004)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

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 F * of a deductive system F is the the pseudocomplement of F . These results are more general than that the similar results given by M. Kondo in [7].

Definition of Flat Poset and Existence Theorems for Recursive Call

Kazuhisa Ishida, Yasunari Shidama, Adam Grabowski (2014)

Formalized Mathematics

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...

Definitions of finiteness based on order properties

Omar De la Cruz, Damir D. Dzhafarov, Eric J. Hall (2006)

Fundamenta Mathematicae

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...

Definizione dei clan binari e loro classificazione

Mario Servi (1998)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

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...

Degeneration of Schubert varieties of S L n / B to toric varieties

Raika Dehy, Rupert W.T. Yu (2001)

Annales de l’institut Fourier

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 S L n to toric varieties by extending the method used by Gonciulea and Lakshmibai for a miniscule G / P to Schubert varieties in S L n .

Degrees of compatible L -subsets and compatible mappings

Fu Gui Shi, Yan Sun (2024)

Kybernetika

Based on a completely distributive lattice L , degrees of compatible L -subsets and compatible mappings are introduced in an L -approximation space and their characterizations are given by four kinds of cut sets of L -subsets and L -equivalences, respectively. Besides, some characterizations of compatible mappings and compatible degrees of mappings are given by compatible L -subsets and compatible degrees of L -subsets. Finally, the notion of complete L -sublattices is introduced and it is shown that the...

Currently displaying 801 – 820 of 3896