Decompositions of directed sets with zero
Decompositions of semigroups with zero.
Dedekind completions of lattices by ends
Dedekind cuts in C(X)
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.
Dedekind extension of measures with values in vector lattices.
Deductive systems of BCK-algebras
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].
...-definierbare Funktionen auf Peanoalgebren.
Definition of Flat Poset and Existence Theorems for Recursive Call
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
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...
Definitions: the primitive concept of logics or The Leśniewski-Tarski legacy [Book]
Definizione dei clan binari e loro classificazione
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...
Deformation of chains via a local symmetric group action.
Degeneration of Schubert varieties of to toric varieties
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 .
Demi-groupes 0-simples et complètement 0-simples totalement ordonnés. Application aux demi-groupes de matrices de Rees
Demi-groupes et catégories à involution
Demonic semantics: using monotypes and residuals.
Dénombrement des quasi-ordres sur un ensemble fini
Denotational aspects of untyped normalization by evaluation
We show that the standard normalization-by-evaluation construction for the simply-typed -calculus has a natural counterpart for the untyped -calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal forms,...
Denotational aspects of untyped normalization by evaluation
We show that the standard normalization-by-evaluation construction for the simply-typed λβη-calculus has a natural counterpart for the untyped λβ-calculus, with the central type-indexed logical relation replaced by a “recursively defined” invariant relation, in the style of Pitts. In fact, the construction can be seen as generalizing a computational-adequacy argument for an untyped, call-by-name language to normalization instead of evaluation.In the untyped setting, not all terms have normal...
Dense extensions of a partially ordered set.