Loading [MathJax]/extensions/mml2jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
    • Number of Print Columns
  • Include attachments
Searching in
About 1 results
  • https://math.libretexts.org/Bookshelves/Mathematical_Logic_and_Proof/Gentle_Introduction_to_the_Art_of_Mathematics_(Fields)/06%3A_Relations_and_Functions/6.04%3A_Ordering_Relations
    The prototype for ordering relations is ≤. Although a case could be made for using < as the prototypical ordering relation. These two relations differ in one important sense: ≤ is reflexive and ...The prototype for ordering relations is ≤. Although a case could be made for using < as the prototypical ordering relation. These two relations differ in one important sense: ≤ is reflexive and < is irreflexive. Various authors, having made different choices as to which of these is the more prototypical, have defined ordering relations in slightly different ways. The majority view seems to be that an ordering relation is reflexive (which means that ordering relations are modeled after ≤)

Support Center

How can we help?