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
Hume's principle
(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!
{{Short description|Logical principle}} {{more footnotes|date=May 2020}} '''Hume's principle''' or '''HP''' says that, given two collections of objects <math>\mathcal F</math> and <math>\mathcal G </math> with properties <math>F</math> and <math>G</math> respectively, the number of objects with property <math>F</math> is equal to the number of objects with property <math>G</math> if and only if there is a [[one-to-one correspondence]] (a bijection) between <math>\mathcal F</math> and <math>\mathcal G</math>. In other words, that bijections are the "correct" way of measuring size. '''HP''' can be stated formally in systems of [[second-order logic]]. It is named for the Scottish philosopher [[David Hume]] and was coined by [[George Boolos]]. The principle plays a central role in [[Gottlob Frege]]'s philosophy of mathematics. Frege shows that HP and suitable definitions of arithmetical notions [[logical consequence|entail]] all axioms of what we now call [[second-order arithmetic]]. This result is known as [[Frege's theorem]], which is the foundation for a philosophy of mathematics known as [[Logicism#Neo-logicism|neo-logicism]].
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)