|
ASK A QUESTION
RECENT RESPONSES
CONCEPT CLOUD
CATEGORIES
|
Questions in Mathematics
(143)
click to expand
|
This question is directed (mainly) to Peter Smith. I've read you "Introduction to Gödel's Theorems" (that's how I ended up here) and found it fascinating. At a certain point it ...
May 7, 2009
|
|
Setting aside worries about quantum mechanics, would it be possible for there to be a plank of wood which is an irrational number (say, pi) of feet in length?
April 8, 2009
|
|
I know that there are some serious problems concerning the idea that mathematics is grounded on logic. But computers can perform mathematical operations, and computers use logic, so I think ...
March 5, 2009
|
|
Why is it necessary that 2+2=4? Because it is difficult to conceive how 2+2 could have been other than 4? But how do we know that this is not just ...
February 15, 2009
|
|
Why does mathematics "work"? How does it manage to describe the physical world?
December 28, 2008
|
|
Parallel Lines: 1) I've been told that parallel lines never meet - except at infinity. 2) Also that a straight line is a circle of infinite radius. 3) Surely if ...
November 5, 2008
|
|
As commonly understood and reinforced here, 2 + 2 = 4 is taken as meeting the test for absolute certainty. This appears to be true in a formal or symbolic ...
November 10, 2008
|
|
When young children perform long division or multiplication, are they constructing a proof?
October 5, 2008
|
|
What are numbers? Are they unquestionably EVERYTHING? Let's take 17 and 18 for example: Isn't there an infinite amount of numbers that exist between 17 and 18? There is no ...
October 12, 2008
|
|
We generally hold that a mathematical proposition such as "2 + 2 = 4" is necessarily true; it is difficult to imagine a possible world in which it is false. ...
October 14, 2008
|
|
PANELISTS
RETIRED PANELISTS (show)
RELATED SITES
|
I'm really glad you enjoyed the Gödel book!
Suppose that S is Goldbach's conjecture. And suppose theory T is your favourite arithmetic (which includes Robinson Arithmetic). Then Theorem 9.3 applies to S. So if not-S is not logically deducible from T, then S must be true.
So if we had a proof that S is a "naturally" arising Gödel sentence -- i.e. a demonstration that T proves neither S nor not-S -- we'd ipso facto have a proof that S is true.
That means that establishing that that S is a "naturally" arising Gödel sentence for T -- if that's what it is -- is at least as hard as proving Goldbach's Conjecture itself. Which, the evidence suggests, is very hard!As to the "odds": my hunch is that GC is true, and can be proved in PA -- but I wouldn't bet even a decent meal out on it!!