Results 21 to 30 of about 60 (60)
On two parametric probability distributions on crisp complete pre-orders
Mallows and Plackett-Luce parametric probability distributions are the two most used and well-known in the set of complete linear orders of a finite universe.
Engoulou, Bertrand Mbama +3 more
core +1 more source
Let X be a finite total order set and E be a convex equivalence relation on X. We denote that OE(X) = {f ∈ TE(X) : ∀x, y ∈ X, x ≤ y⟹f(x) ≤ f(y)} , where TE(X) is an E− preserving transformation semigroup. Obviously, OE(X) is a subsemigroup of TE(X), which is called an order‐preserving and equivalence‐preserving transformation semigroup.
Meiqing Qin, Xuerong Fu, Nian-Sheng Tang
wiley +1 more source
Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
We show that the theory of the partial ordering of the computably enumerable degrees in any given nontrivial interval is undecidable and has uncountably many 1-types. subject code classications: 03D25 (03C65 03D35 06A06) keywords: computably enumerable
Hirschfeldt, Denis R. +5 more
core +1 more source
Upper and Lower Bounds in Relator Spaces [PDF]
2000 Mathematics Subject Classification: 06A06, 54E15An ordered pair X(R) = ( X, R ) consisting of a nonvoid set X and a nonvoid family R of binary relations on X is called a relator space.
Száz, Árpád
core
Equational characterizations for some subclasses of domains
It is well known that the continuity of a poset can be seen as a special distributivity. There is an open problem: is there an equational characterization for continuous semilattices?
Feng Fan, Li Xiangrui
doaj +1 more source
Remarks on some connections between ideals and filters in residuated lattices
Ideals and filters are important notions with different meanings in the study of algebraic structures related to logical systems. In this paper we establish new connections between these concepts in residuated lattices.
Piciu Dana +2 more
doaj +1 more source
. We provide a comprehensive picture of how to compare partial rankings, that is, rankings that allow ties. We propose several metrics to compare partial rankings and prove that they are within constant multiples of each other. Key words. partial ranking,
Ravi Kumar +4 more
core
Elektroniskā versija nesatur pielikumusŠajā disertācijā tiek pētīti vairāki daļējie sakārtojumi noteiktās (iespējams, vienpusēju) Rikarta gredzenu klasēs, kurās ir spēkā kāds nosacījums, kas nodrošina, ka gredzens, kuram var nebūt involūcija, dažos ...
Cremer, Insa Ingeborg Charlotte
core
Posets and differential graded algebras
If P is a partially ordered set and R is a commutative ring, then a certain differential graded /f-algebra A,(P) is defined from the order relation on P.
Wayne W Wheeler (20197140) +1 more
core
© Hindawi Publishing Corp. EXTENDED BLOCKER, DELETION, AND CONTRACTION MAPS ON ANTICHAINS
Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of themaps is investigated.
Andrey O. Matveev
core

