نتایج جستجو برای: weak algebraic hyperstructure

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

2015

Soft set theory is a general mathematical tool for dealing with uncertain, fuzzy, not clearly defined objects. In this paper we introduced soft mixed neutrosophic N-algebraic with the discussion of some of their characteristics. We also introduced soft mixed dual neutrosophic N-algebraic structures, soft weak mixed neutrosophic N-algebraic structures, soft Lagrange mixed neutrosophic N-algebrai...

1997
Nguyêñ Quôć Thǎńg

We prove some new relations between weak approximation and some rational equivalence relations (Brauer and R-equivalence) in algebraic groups over arithmetical fields. By using weak approximation and local global approach, we compute completely the group of Brauer equivalence classes of connected linear algebraic groups over number fields, and also completely compute the group of R-equivalence ...

Journal: :Proceedings of the American Mathematical Society 2019

Journal: :Rocky Mountain Journal of Mathematics 2004

2012
Nicolas Frisby

Programs involving precise types enforce more properties via type-checking, but precise types also prevent the reuse of functions throughout a program since no single precise type is used throughout a large program. My work is a step toward eliminating the underlying dilemma regarding type precision versus function reuse. It culminates in a novel traversal operator that recovers the reuse by au...

2008
Philip Boulain Nigel Shadbolt Nicholas Gibbins

Wiki systems have developed over the past years as lightweight, community-editable, web-based hypertext systems. With the emergence of Semantic Wikis, these collections of interlinked documents have also gained a dual role as adhoc RDF [8] graphs. However, their roots lie at the limited hypertext capabilities of the World Wide Web [1]: embedded links, without support for composite objects or tr...

2014
Horst Brunotte HORST BRUNOTTE

We study algebraic properties of real positive algebraic numbers which are not less than the moduli of their conjugates. In particular, we are interested in the relation of these numbers to Perron numbers.

2014
JOHN BOURKE RICHARD GARNER

Algebraic weak factorisation systems (awfs) refine weak factorisation systems by requiring that the assignations sending a map to its first and second factors should underlie an interacting comonad–monad pair on the arrow category. We provide a comprehensive treatment of the basic theory of awfs—drawing on work of previous authors—and complete the theory with two main new results. The first pro...

2008
DANIEL DE CARVALHO

In our PhD thesis ([4]), we showed that for the study of denotational semantics of linear logic ([6]), it is crucial to generalize the standard notion of monad on a category. An earlier generalization was already given by Hoofman ([9]): semimonads. But it was not suitable for our problem. This is why we introduced another generalization: weak monads. In this note, we present this new notion and...

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

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