Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Suslin's problem
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
In [[mathematics]], '''Suslin's problem''' is a question about [[totally ordered set]]s posed by {{harvs|txt|authorlink=Mikhail Yakovlevich Suslin|first=Mikhail Yakovlevich |last=Suslin|year=1920}} and published posthumously. It has been shown to be [[independence (mathematical logic)|independent]] of the standard [[axiomatic system]] of [[set theory]] known as [[ZFC]]; {{harvtxt|Solovay|Tennenbaum|1971}} showed that the statement can neither be proven nor disproven from those axioms, assuming ZF is consistent. (Suslin is also sometimes written with the French transliteration as {{lang|fr|Souslin}}, from the Cyrillic {{lang|ru|Суслин}}.) {{quotebox|right|width=50% |quote={{lang|fr|Un ensemble ordonné (linéairement) sans sauts ni lacunes et tel que tout ensemble de ses intervalles (contenant plus qu'un élément) n'empiétant pas les uns sur les autres est au plus dénumerable, est-il nécessairement un continue linéaire (ordinaire)?}} Is a (linearly) ordered set without jumps or gaps and such that every set of its intervals (containing more than one element) not overlapping each other is at most denumerable, necessarily an (ordinary) linear continuum? |source=The original statement of Suslin's problem from {{harv|Suslin|1920}} }}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)