Infinite Descending Chain

Given a set S with a partial order <=, an infinite descending chain is a Chain V, that is, a subset of S upon which <= defines a total order, such that V has no minimal element, that is, an element m such that for all elements n in V it holds that m <= n. As an example, in the set of integers, the chain -1,-2,-3,... is an infinite descending chain, but there exists no infinite chain on the natural numbers, every chain of natural numbers has a minimal element. If a partially ordered set does not contain any infinite descending chains, it is called well-founded. A total ordered set without infinite descending chains is called well-ordered.

 

<< PreviousWord BrowserNext >>
i
iota
impotence
identity and change
iran contra affair
infocom
interactive fiction
ice hockey
ieee 802.3
integer (computer science)
infectious disease
internal combustion engine
inoculation
icon
icon programming language
native american massacres
inherence relation
isotope
islamic calendar
interquartile range
iliad
indiana jones
irrational number
irreducible fraction
isomorphism class
isomorphism
international law
international organization
international telecommunication union
internet message access protocol
inertial frame of reference
illuminati: new world order
integration
industrial and manufacturing engineering
interstellar travel
interior gateway routing protocol
irs
indo european languages
illinois
ian murdock
indiana
io
inner product space
iain banks