2001
DOI: 10.1016/s0022-4049(01)00127-x
|View full text |Cite
|
Sign up to set email alerts
|

Duprime and dusemiprime modules

Abstract: A lattice ordered monoid is a structure L; ⊕, 0 L ; ≤ where L; ⊕, 0 L is a monoid, L; ≤ is a lattice and the binary operation ⊕ distributes over finite meets. If M ∈ R-Mod then the set IL M of all hereditary pretorsion classes of σ[M ] is a lattice ordered monoid with binary operation given by α : M β := {N ∈ σ[M ] | there exists A ≤ N such that A ∈ α and N/A ∈ β}, whenever α, β ∈ IL M (the subscript in : M is omitted if σ[M ] = R-Mod). σ[M ] is said to be duprime (resp. dusemiprime) if M ∈ α : M β implies M ∈… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
4
0

Year Published

2004
2004
2009
2009

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 16 publications
(12 reference statements)
0
4
0
Order By: Relevance
“…, this is equivalent to M being strongly prime; that is, each nonzero submodule of M subgenerates M (see [10,Theorem 3.3]). It follows from Corollary 4.6 that this condition is different from M being coprime in M-pr.…”
Section: Proofmentioning
confidence: 99%
See 3 more Smart Citations
“…, this is equivalent to M being strongly prime; that is, each nonzero submodule of M subgenerates M (see [10,Theorem 3.3]). It follows from Corollary 4.6 that this condition is different from M being coprime in M-pr.…”
Section: Proofmentioning
confidence: 99%
“…To illustrate this, consider the rationals Q as Z-module: Q is duprime (see [10]) and coprime (as in Definition 4.2) but is not coprime in the sense of [2].…”
Section: Proofmentioning
confidence: 99%
See 2 more Smart Citations