NOTES ON MODULAR ORDERED SETS
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 신선호 | - |
dc.date.available | 2018-05-10T05:38:10Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2012-02 | - |
dc.identifier.issn | 1226-3524 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/12727 | - |
dc.description.abstract | Generalizing modular lattices, a concept of modular ordered sets was introduced by Chajda and Rachunek. In this paper, we characterize modular ordered sets as those partially ordered set $P$ satisfying that for $a, b, c \in P$ with $b \leq c$, $l(a, b)=l(a, c)$ and $u(a, b)=u(a, c) $ imply $b=c$. Using this, we obtain a sufficient condition for them. We also discuss the modularity of the Dedekind-MacNeille completions of ordered sets. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 충청수학회 | - |
dc.relation.isPartOf | 충청수학회지 | - |
dc.subject | modular ordered sets | - |
dc.subject | Dedekind-MacNeille completions | - |
dc.title | NOTES ON MODULAR ORDERED SETS | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | 충청수학회지, v.25, no.1, pp.105 - 114 | - |
dc.identifier.kciid | ART001632528 | - |
dc.description.journalClass | 2 | - |
dc.citation.endPage | 114 | - |
dc.citation.number | 1 | - |
dc.citation.startPage | 105 | - |
dc.citation.title | 충청수학회지 | - |
dc.citation.volume | 25 | - |
dc.contributor.affiliatedAuthor | 신선호 | - |
dc.identifier.url | https://www.kci.go.kr/kciportal/ci/sereArticleSearch/ciSereArtiView.kci?sereArticleSearchBean.artiId=ART001632528 | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | modular ordered sets | - |
dc.subject.keywordAuthor | Dedekind-MacNeille completions | - |
dc.description.journalRegisteredClass | kci | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.