نتایج جستجو برای: lattice ordered group

تعداد نتایج: 1109931  

Journal: :journal of nanostructures 2015
a. khajesarvi g. h. akbari

in the present study, nanocrystalline ni50al50-xmox (x = 0, 0.5, 1, 2.5, 5) intermetallic compound was produced through mechanical alloying of nickel, aluminum, and molybdenum powders. alni compounds with good and attractive properties such as high melting point, high strength to weight ratio and high corrosion resistance especially at high temperatures have attracted the attention of many rese...

2013
Antonio Ledda Francesco Paoli Constantine Tsinakis

In the theory of lattice-ordered groups, there are interesting examples of properties — such as projectability — that are defined in terms of the overall structure of the lattice-ordered group, but are entirely determined by the underlying lattice structure. In this paper, we explore the extent to which projectability is a lattice-theoretic property for more general classes of algebras of logic...

Journal: :J. Symb. Log. 2007
Pantelis E. Eleftheriou Sergei Starchenko

Let M = 〈M, +, <, 0, {λ}λ∈D〉 be an ordered vector space over an ordered division ring D, and G = 〈G,⊕, eG〉 an n-dimensional group definable in M. We show that if G is definably compact and definably connected with respect to t-topology, then it is definably isomorphic to a ‘definable quotient group’ U/L, for some convex W -definable subgroup U of 〈Mn, +〉 and a lattice L of rank n. As two conseq...

2002
A. M. W. Glass Reinhard Winkler

We introduce “rooted valuation products” and use them to construct universal Abelian lattice-ordered groups (with prescribed set of components) [CHH] from the more classical theory of [Ha]. The Wreath product construction of [H] and [HMc] generalised the Abelian (lattice-ordered) group ideas to a permutation group setting to respectively give universals for transitive (`-) permutation groups wi...

2004
Nic Wilson

This paper constructs a logic of soft constraints where the set of degrees of preference forms a partially ordered set. When the partially ordered set is a distributive lattice, this reduces to the idempotent semiring-based CSP approach, and the lattice operations can be used to define a sound and complete proof theory. For the general case, it is shown how sound and complete deduction can be p...

Journal: :Czechoslovak Mathematical Journal 2005

Journal: :Annales de la faculté des sciences de Toulouse Mathématiques 2010

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید