The structure of preordered sets and their topological properties Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/cf95jf35f

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Let X be a set. Given any preorder < on the set X, there corresponds a family of subsets of X, namely, WIx E x} where L = {y y E X y <x} such that, for all elements x and y of X, x <y iff L ( L. In this thesis, it is shown that, conversely, the preorders on a set can be derived from arbitrary families of subsets of that set. Thus, an upper bound for the cardinality of all preorders on any set is obtained. Moreover, the cardinal number of the set of all partial orders on any finite set is odd. An equivalence relation is defined on the collection of all families of subsets of a set by calling two families equivalent iff they define the same preorder. All equivalence classes of this equivalence relation are closed under arbitrary nonempty unions. Therefore, every equivalence class has a greatest element with respect to set inclusion. In fact, a family of subsets of X is the greatest element of an equivalence class if and only if it is a topology for X which is also closed under arbitrary intersections. Consequently, the cardinal number of the set of all preorders on a set X is equal to the cardinal number of the set of all topologies for X which are also closed under arbitrary intersections and, in particular, if X is a finite set, then the cardinal number of the set of all preorders on the set X is equal to the cardinal number of the set of all topologies for X.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Language
Digitization Specifications
  • PDF derivative scanned at 300 ppi (256 B&W), using Capture Perfect 3.0, on a Canon DR-9080C. CVista PdfCompressor 3.1 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2009-01-21T18:06:51Z (GMT). No. of bitstreams: 1 Bu_How_Shone_1972.pdf: 640185 bytes, checksum: 2657ac8e58b0c9651b20c12913c5965f (MD5)
  • description.provenance : Submitted by Anna Opoien (aoscanner@gmail.com) on 2009-01-08T23:51:19Z No. of bitstreams: 1 Bu_How_Shone_1972.pdf: 640185 bytes, checksum: 2657ac8e58b0c9651b20c12913c5965f (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-21T18:06:50Z (GMT) No. of bitstreams: 1 Bu_How_Shone_1972.pdf: 640185 bytes, checksum: 2657ac8e58b0c9651b20c12913c5965f (MD5)
  • description.provenance : Approved for entry into archive by Linda Kathman(linda.kathman@oregonstate.edu) on 2009-01-21T18:05:51Z (GMT) No. of bitstreams: 1 Bu_How_Shone_1972.pdf: 640185 bytes, checksum: 2657ac8e58b0c9651b20c12913c5965f (MD5)

Relationships

In Administrative Set:
Last modified: 08/14/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items