• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Partially Ordered Sets (2000)

Cached

  • Download as a PDF

Download Links

  • [ftp.cs.ualberta.ca]
  • [mizar.org]
  • [mizar.org]
  • [mizar.uwb.edu.pl]
  • [markun.cs.shinshu-u.ac.jp]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Wojciech A. Trybulec
Citations:154 - 4 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Trybulec00partiallyordered,
    author = {Wojciech A. Trybulec},
    title = {Partially Ordered Sets},
    year = {2000}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

this article we define the choice function of a non-empty set family that does not contain ; as introduced in [6, pages 88--89]. We define order of a set as a relation being reflexive, antisymmetric and transitive in the set, partially ordered set as structure non-empty set and order of the set, chains, lower and upper cone of a subset, initial segments of element and subset of partially ordered set. Some theorems that belong rather to [5] or [14] are proved. MML Identifier: ORDERS1.

Keyphrases

ordered set    mml identifier    non-empty set family    structure non-empty set    upper cone    choice function    initial segment   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University