Results 11 to 20 of about 72,546 (307)
A Topology for a Lattice-Ordered Group [PDF]
Transactions of the American Mathematical Society, 1974 Let G be an arbitrary lattice-ordered group. We define a topology on G , called the J
R. H. Redfield
openaire +3 more sources
Topological lattice-ordered groups [PDF]
Pacific Journal of Mathematics, 1979 Several types of hulls and completions of lattice ordered groups have been obtained by algebraic methods. In this paper is laid some groundwork for the application of topological and uniform-space concepts to the same end by setting forth those links—topological, algebraic and semantic— between a topological lattice ordered group H and a topologically ...
Richard Neal Ball
openaire +4 more sources
Proof theory for lattice-ordered groups [PDF]
Annals of Pure and Applied Logic, 2016 The authors develop a proof theory for lattice orderes groups (\(\ell\)-groups), as the title of the paper says. They establish the following three main results. Theorem 5.4. The variety of \(\ell\)-groups is generated by Aut(\(\mathbb{R}\)), where Aut(\(\mathbb{R}\)) is the set of all order-preserving bijections on the real number chain \(\mathbb{R}\).
Nikolaos Galatos, George Metcalfe
openaire +3 more sources
The word problem for lattice-ordered groups [PDF]
Transactions of the American Mathematical Society, 1983 Theorem. There is a finitely generated one relator lattice-ordered group with insoluble (group) word problem .
Glass, A. M. W., Gurevich, Yuri
openaire +4 more sources
Archimedean Closed Lattice-Ordered Groups [PDF]
Rocky Mountain Journal of Mathematics, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Yuanqian +2 more
core +7 more sources
On the Affine Completeness of Lattice Ordered Groups [PDF]
Czechoslovak Mathematical Journal, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jakubík, Ján +3 more
openaire +4 more sources
Proof theory for lattice-ordered groups [PDF]
EPiC Series in Computing, 2018 Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-eliminationhave been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics.
George Metcalfe
openaire +3 more sources
A Linguistic-Valued Weighted Aggregation Operator to Multiple Attribute Group Decision Making with Quantative and Qualitative Information [PDF]
International Journal of Computational Intelligence Systems, 2008 In selecting an optional alternative in an environment of multiple attribute group decision making, different attributes of the alternative are often considered as with quantitative and qualitative information.
Xiaobing Li, Da Ruan, Jun Liu, Yang Xu
doaj +1 more source
npj Computational Materials, 2021 The electrochemical thermodynamic and kinetic characteristics of rechargeable batteries are critically influenced by the ordering of mobile ions in electrodes or solid electrolytes. However, because of the experimental difficulty of capturing the lighter
Yunbing Ran +12 more
doaj +1 more source
Sequential convergences on free lattice ordered groups [PDF]
, 1992 summary:In this paper the partially ordered set Conv $G$ of all sequential convergences on $G$ is investigated, where $G$ is either a free lattice ordered group or a free abelian lattice ordered ...
Jakubík, Ján
core +1 more source