A problem with the Axiomatic Foundations of Mathematics

In summary, the conversation discusses the possibility of inconsistencies within the axiomatic systems of modern mathematics and how this can affect the validity of proofs and the foundation of the subject. It also mentions the work of Vladimir Vovoedsky and Ed Nelson on alternative foundations for mathematics, and the discussion surrounding them. The conversation concludes with the idea that if math were found to be inconsistent, it would be a significant and interesting development, but math itself would still continue and evolve.
  • #1
Skrew
131
0
After looking at the axiomatic systems of modern mathematics and asking myself what proves they are self consistent I went looking for an explanation and so far I have found only that they have not been proven self consistent nor likely will a proof ever exist. So the possibility of a contradiction being present within the system exists. Therefore when using the system you assume it has no contradictions present within it.

I find this incredibly disturbing as it means every proof I have written would become worthless should the axiomatic system it is written in be demonstrated to be inconsistent.

I find this so disturbing that I question if I want to pursue my studies in mathematics, one thing I always liked about mathematics is that I considered it built on unshakable ground but this appears not to be the case.

Has anyone else experienced this revelation? How do you deal with it?
 
Mathematics news on Phys.org
  • #2
There's a Fields medalist named Vladimir Vovoedsky who's currently working on an alternative foundation for mathematics based on homotopy theory. He suspects that Peano Arithmetic (PA) might be inconsistent.

http://video.ias.edu/voevodsky-80th

His work's generated a lot of controversy. Some mathematicians think he's totally wrong and misguided.

http://www.newappsblog.com/2011/05/voevodsky-and-the-inconsistency-of-peano-arithmetic.html

There's another guy named Ed Nelson at Princeton. He thinks PA might be inconsistent too.

http://www.math.princeton.edu/~nelson/papers/warn.pdf

Here's a good overview discussion of the subject.

http://mathoverflow.net/questions/40920/what-if-current-foundations-of-mathematics-are-inconsistent

One answer to your question is: If you are interested in the problem, study foundations and work on it. If you discover PA or ZFC to be inconsistent, you will become famous. Or if they are inconsistent, you can study the implications of that.

The other answer is that if you're not in foundations, you wouldn't care about the problem at all. If set theory blows up they'll just use category theory. If that blows up they'll find something else. None of this applies to "real" math. Physics would still work, for example. In any event, renormalization still hasn't been put on a rigorous footing, so how do you know physics isn't inconsistent too? [Physicists, please check me on that. I don't know anything more about it than what I've gleaned from Feynman's QED book.]

Another very interesting foundations-related topic getting some Internet buzz lately is whether Wiles's proof of Fermat's Last Theorem relies on the existence of an inaccessible cardinal, which is a type of large set whose existence is independent of ZFC. The question is whether Wiles's proof could in theory be fixed up to not use an inaccessible cardinal. You can google around and get a lot of interesting commentary on that question.

http://mathoverflow.net/questions/35746/inaccessible-cardinals-and-andrew-wiless-proof

So to sum all this up ... if math were found to be inconsistent ... well, that would be very interesting!
 
Last edited:
  • #3
SteveL27 said:
There's a Fields medalist named Vladimir Vovoedsky who's currently working on an alternative foundation for mathematics based on homotopy theory. He suspects that Peano Arithmetic (PA) might be inconsistent.

http://video.ias.edu/voevodsky-80th

His work's generated a lot of controversy. Some mathematicians think he's totally wrong and misguided.

http://www.newappsblog.com/2011/05/voevodsky-and-the-inconsistency-of-peano-arithmetic.html

There's another guy named Ed Nelson at Princeton. He thinks PA might be inconsistent too.

http://www.math.princeton.edu/~nelson/papers/warn.pdf

Here's a good overview discussion of the subject.

http://mathoverflow.net/questions/40920/what-if-current-foundations-of-mathematics-are-inconsistent

One answer to your question is: If you are interested in the problem, study foundations and work on it. If you discover PA or ZFC to be inconsistent, you will become famous. Or if they are inconsistent, you can study the implications of that.

The other answer is that if you're not in foundations, you wouldn't care about the problem at all. If set theory blows up they'll just use category theory. If that blows up they'll find something else. None of this applies to "real" math. Physics would still work, for example. In any event, renormalization still hasn't been put on a rigorous footing, so how do you know physics isn't inconsistent too? [Physicists, please check me on that. I don't know anything more about it than what I've gleaned from Feynman's QED book.]

Another very interesting foundations-related topic getting some Internet buzz lately is whether Wiles's proof of Fermat's Last Theorem relies on the existence of an inaccessible cardinal, which is a type of large set whose existence is independent of ZFC. The question is whether Wiles's proof could in theory be fixed up to not use an inaccessible cardinal. You can google around and get a lot of interesting commentary on that question.

http://mathoverflow.net/questions/35746/inaccessible-cardinals-and-andrew-wiless-proof

So to sum all this up ... if math were found to be inconsistent ... well, that would be very interesting!

That's interesting, but as a direct example consider the complete ordered field axioms.

They have not been shown to be consistent, thus every theorem in analysis will come into question if they are shown to be inconsistent. The possibility of that inconsistency exists.

So I'm not sure the statement: "None of this applies to "real" math." is accurate.

In general I find this very disturbing, at least in the sciences I accept I will be using inductive reasoning from the start, but with mathematics I thought I could avoid that. Unfortunately that appears not to be the case. I don't like the idea of spending years of my life learning something I thought was rigorous to in the future being shown that it was wrong and needs a complete reformalization.
 
  • #4
Skrew said:
That's interesting, but as a direct example consider the complete ordered field axioms.

They have not been shown to be consistent, thus every theorem in analysis will come into question if they are shown to be inconsistent. The possibility of that inconsistency exists.

So I'm not sure the statement: "None of this applies to "real" math." is accurate.

What I meant by that was: If the current foundations fail, mathematicians will find new foundations. Math is in a certain sense independent of foundations. For example Newton discovered calculus even though he struggled to provide a logically rigorous explanation of infinitesimals. But he was still doing valid math. Eventually people arrived at the modern understanding of limit. But even if they didn't, or if our understanding of the real numbers turned out to be logically problematic, the calculus would still be valid math.

Now this is of course a philosophical point of view and subject to debate. I'm just trying to point out that even if we had no foundations, we could still do math; just as Newton did; and just like a lot of people do today who aren't concerned about foundational issues.

Do uncountable sets really exist? Is the axiom of choice really true in any meaningful sense? Who knows. Mathematicians don't care. They use AC when they need to, and they don't worry too much about the exact details of their axiomatic systems. That's why I mentioned the example of Wiles's proof. It's not done in ZFC, it's done in a stronger system. Most specialists feel that it "could" be done in ZFC if they had to do it, but nobody's taken the trouble.

The point I'm making is that SOME people don't worry about these things too much.

Skrew said:
In general I find this very disturbing, at least in the sciences I accept I will be using inductive reasoning from the start, but with mathematics I thought I could avoid that. Unfortunately that appears not to be the case. I don't like the idea of spending years of my life learning something I thought was rigorous to in the future being shown that it was wrong and needs a complete reformalization.

Mathematics underwent a complete reformalization only 120 years ago. Cantor published his diagonal proof in 1891. That didn't destroy math, it just gave mathematicians a lot of interesting work to do.

I can't really answer your concerns about this; but I don't see how these foundational issues really bear on learning differential geometry or abstract algebra or probability theory or any other branch of math. Those fields are interesting in and of themselves, and if you're interested in them, you should study them.

There is no guarantee that tomorrow morning the next Cantor won't come along and shock everyone by showing the world a new way to look at the foundations of math. Beyond that, I guess this is something you'll have to work out personally. If you require absolute certainty in math, I think Godel put an end to that in 1931.
 
Last edited:
  • #5
I guess as of now I question the point of doing proofs since the proofs themselves don't only depend on the axioms you are working within but on the assumption of consistency of those axioms. If those axioms can never be proved consistent it seems like a futile effort or worse yet a waste of time should an inconsistency be demonstrated.

Hopefully tomorrow I will have a more positive outlook on this issue.
 
  • #6
Skrew said:
I guess as of now I question the point of doing proofs since the proofs themselves don't only depend on the axioms you are working within but on the assumption of consistency of those axioms. If those axioms can never be proved consistent it seems like a futile effort or worse yet a waste of time should an inconsistency be demonstrated.

Hopefully tomorrow I will have a more positive outlook on this issue.

The proofs don't depend on the consisteny of the axioms. The proofs are true whether the axioms are consistent or not. Furthermore, if the axioms are proven inconsistent, then we'll just look at axioms which are consistent, and the proofs remain valid in that setting...
 
  • #7
SteveL27 said:
Physics would still work, for example. In any event, renormalization still hasn't been put on a rigorous footing, so how do you know physics isn't inconsistent too? [Physicists, please check me on that. I don't know anything more about it than what I've gleaned from Feynman's QED book.]

Renormalization is not the sketchy "subtract infinities and claim it's zero" that popular-science particle physics books make it sound to be. Renormalization is well defined. The problems with infinities arise when one formulates a model of something and takes the continuum limit, removing the fundamental length scale of the system, which results in infinities when you try to coarse grain the system.

It is the coarse-graining procedure which is the heart of renormalization - how does your system look as you zoom out? In continuum models the loss of a length scale causes some divergences, so some systematic adjustments must be performed to remove the infinities you introduced by taking the continuum limit and removing the smallest length scale. (The removal of the smallest length scale leads to integrals diverging, so one typically has to put in some artificial cutoff which is removed later). In lattice models one derives recursion relations for the couplings in the system to determine the fixed points of the recursion relations, which correspond to critical points in the language of phase transitions. The coarse graining procedure does not generate infinities in these models because there is a natural cutoff in the model.
 
  • #8
micromass said:
The proofs don't depend on the consisteny of the axioms. The proofs are true whether the axioms are consistent or not. Furthermore, if the axioms are proven inconsistent, then we'll just look at axioms which are consistent, and the proofs remain valid in that setting...

Suppose that axioms result in a contradiction though, that a theorem is proven true using the axioms and at the same time proven false using the axioms.

What do you do?

Furthermore if the contradiction is dependent on a specific axiom and you modify it, then every theorem which uses the axiom will need to be modified.

Ultimately I will have to trust my intuitive reasoning that something is self consistent(integers) and thus the things based on it will be self consistent.
 
  • #9
Skrew said:
Suppose that axioms result in a contradiction though, that a theorem is proven true using the axioms and at the same time proven false using the axioms.

Doesn't mean that the proof is wrong. It just means that the theory is trivial.

Furthermore if the contradiction is dependent on a specific axiom and you modify it, then every theorem which uses the axiom will need to be modified.

Not necessarily. The theorems might hold and the proof might hold as well (with minor adjustments).
 
  • #10
Skrew said:
, one thing I always liked about mathematics is that I considered it built on unshakable ground

What's unshakable about a pile of assumptions and undefined terms? That is what mathematics must be built upon. The little problem of what these assumptions imply is what you're worrying about.
 
  • #11
Skrew said:
Suppose that axioms result in a contradiction though, that a theorem is proven true using the axioms and at the same time proven false using the axioms.

What do you do?

Furthermore if the contradiction is dependent on a specific axiom and you modify it, then every theorem which uses the axiom will need to be modified.

Ultimately I will have to trust my intuitive reasoning that something is self consistent(integers) and thus the things based on it will be self consistent.

Can you answer two questions I'm curious about?

* What do you make of the point I made about Newton? He discovered calculus in 1687 -- that's the date of publication of the Principia, though he had the theory well in hand a lot longer than that. And Cantor gave the first rigorous definition of the real numbers in 1871. That's almost 200 years that people were using and developing calculus, multivariable calculus, and differential geometry, without benefit of a fully rigorous theory of what they were doing.

Do you at least acknowledge the point that a lot of extremely good mathematics can be and often is done, in the complete absence of a logical foundation for it? Often the math comes first and the rigor comes later. And therefore even if the foundations collapsed completely, the math would still be there, and someone would eventually fix up the foundations.

* What is it you read or heard about that's got you concerned? Was it the discovery of non-Euclidean geometry, which showed that mathematical reality is not absolute, but is rather a function of the axioms you choose? Or was it Godel's incompleteness theorem, which simply asserts that a sufficiently rich axiom system can't prove its own consistency unless it's inconsistent? Or was it something else?

I think if you let us know what specific thing is troubling you, people's advice can be more specific.

After all, if you are interested in foundations, why not just study logic and set theory and computability theory and see if you can understand the problem better and perhaps even solve it?

Just curious to get your take on these two questions.
 
  • #12
micromass said:
Doesn't mean that the proof is wrong. It just means that the theory is trivial.

A trivial theory is not worth anything, certainly not worth the amount of time that would have been put into it.

Although I would like to know how you can make any statement true from an inconsistency in the axioms as I'm not seeing how to do it immediately.

Not necessarily. The theorems might hold and the proof might hold as well (with minor adjustments).

Isn't the point of proof to remove the word - might? Isn't the reason you prove anything at all because you want it to be assurdly true?

SteveL27 said:
Can you answer two questions I'm curious about?

* What do you make of the point I made about Newton? He discovered calculus in 1687 -- that's the date of publication of the Principia, though he had the theory well in hand a lot longer than that. And Cantor gave the first rigorous definition of the real numbers in 1871. That's almost 200 years that people were using and developing calculus, multivariable calculus, and differential geometry, without benefit of a fully rigorous theory of what they were doing.

Do you at least acknowledge the point that a lot of extremely good mathematics can be and often is done, in the complete absence of a logical foundation for it? Often the math comes first and the rigor comes later. And therefore even if the foundations collapsed completely, the math would still be there, and someone would eventually fix up the foundations.

I agree that many advances of applied mathematics came before rigor and perhaps the only real basis of proof should be a measure of how well mathematics predicts what it is modeling.

I disagree that if the foundations collapsed, from a rigorous perspective that the mathematics would still hold. Intuitively it would, but isn't the point of the axiomatic development to rid mathematics of intuition and place it on "rigorous" axiomatic ground?

* What is it you read or heard about that's got you concerned? Was it the discovery of non-Euclidean geometry, which showed that mathematical reality is not absolute, but is rather a function of the axioms you choose? Or was it Godel's incompleteness theorem, which simply asserts that a sufficiently rich axiom system can't prove its own consistency unless it's inconsistent? Or was it something else?

I think if you let us know what specific thing is troubling you, people's advice can be more specific.

After all, if you are interested in foundations, why not just study logic and set theory and computability theory and see if you can understand the problem better and perhaps even solve it?

Just curious to get your take on these two questions.

After coming to the realization that the axioms I have used throughout my university studies could be inconsistent and hence worthless I have a terrible feeling that every proof I have ever read or written is something which could completely come crashing down. That ultimately it was wasted effort.

I will spend some time on reading about mathematical logic, it's not something that has much interest to me in of itself but because this issue I feel it is so significant I will spend some time on it.

-------

Also I have a few more general questions.

Supposing I construct the real numbers from the rationals using Cauchy sequences, and I know the rationals are consistent does it follow that the reals are consistent? How does this chain of consistency work?

Also I found a supposed proof of the consistency of Peano Arthmetic:

www.mcgill.ca/files/philosophy/The_Consistency_of_Arithmetic.doc[/URL]

Is this proof correct?
 
Last edited by a moderator:
  • #13
Skrew said:
I disagree that if the foundations collapsed, from a rigorous perspective that the mathematics would still hold. Intuitively it would, but isn't the point of the axiomatic development to rid mathematics of intuition and place it on "rigorous" axiomatic ground?
One of the most important points of axiomatic development* is abstraction. Euclidean geometry (using Tarski's axioms), for example, is theory of points, lines, incidence, betweenness, and congruence, satisfying some axioms. Euclidean geometry doesn't care about what points, lines, incidence, betweenness, and congruence "really are". If we want to construct a Euclidean plane out of sets in some fashion, that we did so is completely irrelevant to axiomatic Euclidean geometry.


Overall, you're making a fallacy of the inverse. There is a theorem:
If set theory is consistent, then Euclidean geometry is consistent.​
But, from the hypothesis that set theory is inconsistent, you seem to be trying to infer that Euclidean geometry is inconsistent. But logic doesn't work that way.
(by "Set theory", I mean Zermelo set theory)


The scarier problem is if logic itself is found to be inconsistent...


*: Really, I should say "formal logic" here. Axiomatic development is just a particular way to specify a formal theory and an approach to pedagogy.



P.S. Math already went through this "crisis" once, when Russel proved that naive set theory is inconsistent. (and the similar fact that the Liar's paradox rendered an old form of formal logic inconsistent) Except for set theorists and logicians, I understand that this crisis had pretty much no effect on mathematics.
 
Last edited:
  • #14
Hurkyl said:
One of the most important points of axiomatic development* is abstraction. Euclidean geometry (using Tarski's axioms), for example, is theory of points, lines, incidence, betweenness, and congruence, satisfying some axioms. Euclidean geometry doesn't care about what points, lines, incidence, betweenness, and congruence "really are". If we want to construct a Euclidean plane out of sets in some fashion, that we did so is completely irrelevant to axiomatic Euclidean geometry.


Overall, you're making a fallacy of the inverse. There is a theorem:
If set theory is consistent, then Euclidean geometry is consistent.​
But, from the hypothesis that set theory is inconsistent, you seem to be trying to infer that Euclidean geometry is inconsistent. But logic doesn't work that way.
(by "Set theory", I mean Zermelo set theory)


The scarier problem is if logic itself is found to be inconsistent...


*: Really, I should say "formal logic" here. Axiomatic development is just a particular way to specify a formal theory and an approach to pedagogy.



P.S. Math already went through this "crisis" once, when Russel proved that naive set theory is inconsistent. (and the similar fact that the Liar's paradox rendered an old form of formal logic inconsistent) Except for set theorists and logicians, I understand that this crisis had pretty much no effect on mathematics.

I'm not saying that the consistency of geometry depends on the consistency of set theory, but through using the axioms of geometry that geometry itself could be shown inconsistent.

The same goes for every other theory based on axioms such as analysis, abstract algebra, topology...

How does one rationalize putting so much effort into something which could break down instantaneously if a contradiction is found?
 
  • #15
Skrew said:
How does one rationalize putting so much effort into something which could break down instantaneously if a contradiction is found?

Are you talking rationalizing it axiomatically by making some logical argument from a set of assumptions? That would make the whole question rather circular, wouldn't it?

Are you talking about rationalizing "to civilization", by making some philosophical argument that is not purely logical?

Or are you talking about rationalizing to yourself (or myself) as a matter of personal taste.

From your remark:
I find this incredibly disturbing as it means every proof I have written would become worthless should the axiomatic system it is written in be demonstrated to be inconsistent.

I'd guess you are talking about personal taste unless you have written proofs of new mathematical results. (From the viewpoint of civilization, the proofs people write as answers to exercises in textbooks and exams are fairly worthless insofar as they don't contribute anything to existing knowledge.)
 
  • #16
Skrew said:
How does one rationalize putting so much effort into something which could break down instantaneously if a contradiction is found?

You are making an assumption that is not true.

If Peano Arithmetic (PA) or Zermelo-Fraenkel "You want Choice with that?" set theory ZF(C) were discovered to be inconsistent tomorrow morning, it is NOT true that anything would "break down" or that existing mathematical truths would become invalid. On the contrary, the vast bulk of mathematics would be unaffected.

In the foundations community, the following would happen:

* People would search for new axiom systems and foundations; and

* People would start unpacking existing results to see exactly what fragment of PA of ZF(C) the result actually needs. They would clarify the path from known results back to weaker axiomatic theories that are free from whatever inconsistency was found.

How do I know these things would happen? Because the foundation community is ALREADY busily engaged in both these areas of research.

Set theorists study a variety of new axioms, such as large cardinal axioms; and they also study the effect of each of their new axioms on existing math. For example they kick around systems where every set is Lebesgue measurable, etc. In other words they already study all the little variations in standard math that you get from messing around with the axioms.

And, there's already a subject called "reverse mathematics," in which they work back from known theorems to find the weakest axiom system the theorem can be proved in.

In other words, foundationalists take the possible inconsistency of PA or ZFC as the starting point of lots of interesting work. They don't despair and give up math. I don't know why you think this would be the case. Foundationalists have no illusions about PA or ZFC. They're just systems to be studied, they're not the last word. Why do you think they are?

You are correct that one of the general goals of foundations is to find an axiom system for all of mathematics that's plausible and that can be proved consistent in a way that satisfies everyone from the strict constructivists on up. But that's an ongoing project, not a done deal.

And the rest of mathematicians don't worry about it. Because their work's valid regardless. That's a point you don't get. Let me toss out another example that might help. Maybe the real numbers as constructed in set theory turn out to be horsefeathers [sorry, I seem to have offended the message board software]. It's certainly possible, the real numbers are pretty strange actually.

But that would NOT affect anything you do starting from the axioms for a complete ordered field. Everything you can prove starting from those axioms is still valid.

Perhaps our concept of the real numbers as a MODEL for those axioms might be flawed. But that doesn't affect what we prove from the field axioms. So everything from calculus all the way up through differential geometry and beyond, including all of modern physics, would not be affected in the least.

You are simply wrong that an inconsistency in foundations would collapse math. Foundations are not a finished system; they are a work in progress.

Can you say exactly what it is that you read that's led you to this intellectual crisis? I get the feeling it's something specific whose implications you are misunderstanding.

Math is the work of humans. It's fallable.
 
  • #17
Skrew said:
The same goes for every other theory based on axioms such as analysis, abstract algebra, topology...
What does being "based on axioms" have to do with anything?



How does one rationalize putting so much effort into something which could break down instantaneously if a contradiction is found?
In many ways. In no particular order,
  • This line of thought eventually leads to the stance that you should never do anything at all. (because otherwise you're risking failure)
  • A contradiction in some established mathematical theory would be a very deep theorem. Finding one would make you famous, and would represent a significant milestone in the progress of mathematics.
  • A lot of the effort you spend is in the art of problem solving. This skill is applicable to nearly any task you could perform as a human being.
  • Many, most, or possibly even all of the techniques you learn would still be applicable to other fields of mathematics, such as the one that replaces whatever theory was found contradictory.
  • If nobody studies precise formulations of a theory, then you have no chance to discover which techniques give meaningful results and which techniques are invalid. If the theory itself is inconsistent, you might never discover it!
  • It's fun and rewarding.
  • There's very low risk of established mathematics being found inconsistent.
  • Even if a theory is inconsistent, you'll still get a lot of use out of it until then. And possibly even after it was found inconsistent.
 
  • #18
Skrew said:
I'm not saying that the consistency of geometry depends on the consistency of set theory, but through using the axioms of geometry that geometry itself could be shown inconsistent.

The same goes for every other theory based on axioms such as analysis, abstract algebra, topology...

Err no. By Godel's second theorem, any axiomatic system containing basic arithmetic that can prove itself being consistent, is inconsistent.
 
  • #19
Skrew said:
I'm not saying that the consistency of geometry depends on the consistency of set theory, but through using the axioms of geometry that geometry itself could be shown inconsistent.

Geometry exists independently of it's axiomatization, just as the integers and their properties exist independently of the Peano axioms. It wouldn't be geometry that would be shown inconsistent, it would the the particular axiomatization, just it wouldn't be the integers and their properties that would be shown to be inconsistent, it would be the Peano axioms.
 
  • #20
Whats an axiom?
 
  • #22
TylerH said:
A preposition (ie statement) that is true by definition.

http://en.wikipedia.org/wiki/Axiom

Good God if that's what Wiki says (I didn't read it) then Wiki is wrong. And not for the first time.

An axiom is a statement that you accept without proof. Nobody thinks axioms are "true." And axioms have nothing to do with definitions, or things being true "by definition."

For example in geometry, there may be zero, exactly one, or many lines through a point parallel to another given line. Those can not all be true. But by accepting one of the three possibilities you get hyperbolic, Euclidean, or elliptical geometry.

http://en.wikipedia.org/wiki/Non-Euclidean_geometry

Nobody has defined an axiom as something that's "true," since the discovery of non-Euclidean geometry. Except for the typists on Wiki evidently.
 
  • #23
SteveL27 said:
Good God if that's what Wiki says (I didn't read it) then Wiki is wrong. And not for the first time.

An axiom is a statement that you accept without proof. Nobody thinks axioms are "true." And axioms have nothing to do with definitions, or things being true "by definition."

For example in geometry, there may be zero, exactly one, or many lines through a point parallel to another given line. Those can not all be true. But by accepting one of the three possibilities you get hyperbolic, Euclidean, or elliptical geometry.

http://en.wikipedia.org/wiki/Non-Euclidean_geometry

Nobody has defined an axiom as something that's "true," since the discovery of non-Euclidean geometry. Except for the typists on Wiki evidently.
I was simplifying. In effect, there's no difference between something being defined as true and accepting it without proof. When I say "true," I mean true within the axiomatic system in which it is an axiom, not true in an empirical sense.

As for your example, any particular geometry will have an axiom defining one of the possibilities is true.
 
  • #24
Quantum mechanics hasn't necessarily "invalidated" classical physics, just to show an empirical example from another natural science.
 
  • #25
How can an axiomatic system state that it is itself consistent? What is the formula in set theory corresponding to "ZFC is consistent"? It seems to me that a statement of consistency is a statement of formulas, but the objects of discourse in ZFC are exclusively sets, so I don't see how such a statement is possible.
 
Last edited:
  • #26
This is the first I’ve heard that anyone credible thinks PA is likely inconsistent; does anyone have more information on this?
 
  • #27
JonF said:
This is the first I’ve heard that anyone credible thinks PA is likely inconsistent; does anyone have more information on this?

I posted a bunch of links on the first page of the present thread. Mine is the second post.

https://www.physicsforums.com/showthread.php?t=511309

Were any of those helpful?

On the other hand, most set theorists believe PA has actually been proved consistent. It's something specialists can argue about. I believe if you look at the Mathoverflow link I gave, it has some references.

The two famous mathematicians who think PA may be inconsistent are Ed Nelson, who many people don't take seriously; and Vladimir Vovoedsky, who has a Fields medal for his work in algebraic topology, so people have to take him seriously. Although a lot of people don't take seriously his claim that PA might be inconsistent.

The links I gave have a lot of back-and-forth about all of this.
 
Last edited:
  • #28
I read through those thanks; I was looking for more information if you got it. I am aware most set theorist believe P.A. to be (sort of) proven consistent by Gentzen's proof. Which raised my curiosity about those who think it’s inconsistent. I can understand people believing its consistency is unknown (this was Hilbert’s position if I remember correctly) but I’d like to hear the reasoning for someone who goes as far to think that it’s inconsistent.
 
  • #29
disregardthat said:
How can an axiomatic system state that it is itself consistent? What is the formula in set theory corresponding to "ZFC is consistent"? It seems to me that a statement of consistency is a statement of formulas, but the objects of discourse in ZFC are exclusively sets, so I don't see how such a statement is possible.

Due to http://en.wikipedia.org/wiki/G%C3%B6del_number" , every statement in logic can be expressed as a natural number. So every statement of PA can be written as an element of PA. The provability of a statement then is equivalent to whether its Godel number has certain properties. From that we deduce Godel's first theorem, which says there exists a true non-provable statement in PA. Call this p. We then assume the consistency of the system can be proved by itself. Then p is not provable. But being this means "p is not provable" is itself provable. The double "not-provable" cancel and we have "p is provable" which is a contradiction. So we must be inconsistent.

A similar procedure works with ZF. ZF has the http://en.wikipedia.org/wiki/Axiom_of_infinity" , so it is at least as strong as PA. The empty set is associated with the number 0, the set of one element is associated with 1, and so on. So each statement in logic has a Godel number and each number has a set associated with it.

The Wiki link explains in more depth, but it can get very technical.
 
Last edited by a moderator:
  • #30
pwsnafu said:
Due to http://en.wikipedia.org/wiki/G%C3%B6del_number" , every statement in logic can be expressed as a natural number. So every statement of PA can be written as an element of PA. The provability of a statement then is equivalent to whether its Godel number has certain properties. From that we deduce Godel's first theorem, which says there exists a true non-provable statement in PA. Call this p. We then assume the consistency of the system can be proved by itself. Then p is not provable. But being this means "p is not provable" is itself provable. The double "not-provable" cancel and we have "p is provable" which is a contradiction. So we must be inconsistent.

But how can "PA is consistent" be expressed through logical formulas? It seems to be a statement of these formulas themselves. And any argument for this would fall victim to the possible inconsistency in PA.

If PA could prove its own consistency I would say this proves nothing. If it is inconsistent, PA would still prove its own consistency due to explosion.
 
Last edited by a moderator:
  • #31
A couple of references for you.

The Open University set book on this stuff is rigourous but not too technical.

Computability and Logic
by Boolos and Jeffrey

Cambridge University Press

Forever Undecided a Puzzle Guide to Godel
by Smullyan

Oxford University Press

is more populist but well written by someone who knows what he is talking about.
This author also has some more formal texts in logic.

go well
 
  • #32
Hurkyl said:
What does being "based on axioms" have to do with anything?

If you left the real numbers as being "fuzzy" instead of representing them as an axiomatic system, it seems you would be able to more easily cope with potential contradictions by ruling out certain results on grounds of "logical absurdity".

TylerH said:
Geometry exists independently of it's axiomatization, just as the integers and their properties exist independently of the Peano axioms. It wouldn't be geometry that would be shown inconsistent, it would the the particular axiomatization, just it wouldn't be the integers and their properties that would be shown to be inconsistent, it would be the Peano axioms.

Then what are integers? Can you define integers to be as they are viewed at the intuitive level? Can you construct a theory based not on specific axioms but on our intuitive understanding of integers? Maybe this ties in with my reply to Hurkyl

SteveL27 said:
I posted a bunch of links on the first page of the present thread. Mine is the second post.

https://www.physicsforums.com/showthread.php?t=511309

Were any of those helpful?

On the other hand, most set theorists believe PA has actually been proved consistent. It's something specialists can argue about. I believe if you look at the Mathoverflow link I gave, it has some references.

The two famous mathematicians who think PA may be inconsistent are Ed Nelson, who many people don't take seriously; and Vladimir Vovoedsky, who has a Fields medal for his work in algebraic topology, so people have to take him seriously. Although a lot of people don't take seriously his claim that PA might be inconsistent.

The links I gave have a lot of back-and-forth about all of this.


Could you provide more information on regards to PA being proved consistent? I did some looking online I found a wiki article about Gentzen's consistency proof and other proofs using logic but I want more.

In particular can you recommend a book which covers these topics?


Studiot said:
A couple of references for you.

The Open University set book on this stuff is rigourous but not too technical.

Computability and Logic
by Boolos and Jeffrey

Cambridge University Press

Forever Undecided a Puzzle Guide to Godel
by Smullyan

Oxford University Press

is more populist but well written by someone who knows what he is talking about.
This author also has some more formal texts in logic.

go well

Thanks, do you know if these books cover Gödel's incompleteness theorem and the consistency proofs of PA/real number arithmetic?

If not I would be quite happy to receive suggestions on more books.


--------

Also a question I have never found the answer to is, how does the chain of consistency work? Supposing PA is consistent does it follow that the axioms for the real numbers are consistent? Or do you need additional things other then PA in a construction of the real numbers?
 
  • #33
Skrew said:
If you left the real numbers as being "fuzzy" instead of representing them as an axiomatic system, it seems you would be able to more easily cope with potential contradictions by ruling out certain results on grounds of "logical absurdity".
Then math was finished centuries ago and all that's left is engineering. All of the easy theorems have been proven, and anything left is too complex for us to have any confidence in.

IIRC, the main reason for the interest in foundations is because of the development of real analysis a couple hundred years back progressed beyond the point where "fuzzy" foundations were good enough.

Also, there are practical matter -- clear foundations often pave the way to progress in the subject. And are often simply easier to work with than a purely intuitive formulation.
 
  • #34
Skrew said:
Then what are integers?

They are what they are, intuitively. They're primitive notions.
 
  • #35
TylerH said:
They are what they are, intuitively. They're primitive notions.

The link you gave doesn't say the integers are primitive notions and I don't think you'll find any authoritative sources that say they are.
 
<h2>1. What is the Axiomatic Foundations of Mathematics?</h2><p>The Axiomatic Foundations of Mathematics is a set of fundamental principles or axioms that serve as the basis for all mathematical reasoning and proof. These axioms are considered to be self-evident and do not require any further justification.</p><h2>2. What is the problem with the Axiomatic Foundations of Mathematics?</h2><p>The main problem with the Axiomatic Foundations of Mathematics is that it is based on a set of axioms that cannot be proven or verified. This means that the entire structure of mathematics is built on assumptions that may or may not be true.</p><h2>3. How does this problem affect mathematics?</h2><p>This problem can lead to inconsistencies and contradictions within mathematical systems. It also means that there may be different sets of axioms that can be used to build mathematical systems, leading to debates and disagreements among mathematicians.</p><h2>4. Are there any proposed solutions to this problem?</h2><p>Yes, there are several proposed solutions, such as using different sets of axioms or developing new axioms that can be proven. Some mathematicians also argue for a more flexible approach to axioms, allowing for revisions and updates as needed.</p><h2>5. How does this problem impact other fields of study?</h2><p>The Axiomatic Foundations of Mathematics is the basis for many other fields of study, such as physics, engineering, and computer science. Therefore, any issues with the foundations of mathematics can have a ripple effect on these fields and potentially impact our understanding of the world around us.</p>

1. What is the Axiomatic Foundations of Mathematics?

The Axiomatic Foundations of Mathematics is a set of fundamental principles or axioms that serve as the basis for all mathematical reasoning and proof. These axioms are considered to be self-evident and do not require any further justification.

2. What is the problem with the Axiomatic Foundations of Mathematics?

The main problem with the Axiomatic Foundations of Mathematics is that it is based on a set of axioms that cannot be proven or verified. This means that the entire structure of mathematics is built on assumptions that may or may not be true.

3. How does this problem affect mathematics?

This problem can lead to inconsistencies and contradictions within mathematical systems. It also means that there may be different sets of axioms that can be used to build mathematical systems, leading to debates and disagreements among mathematicians.

4. Are there any proposed solutions to this problem?

Yes, there are several proposed solutions, such as using different sets of axioms or developing new axioms that can be proven. Some mathematicians also argue for a more flexible approach to axioms, allowing for revisions and updates as needed.

5. How does this problem impact other fields of study?

The Axiomatic Foundations of Mathematics is the basis for many other fields of study, such as physics, engineering, and computer science. Therefore, any issues with the foundations of mathematics can have a ripple effect on these fields and potentially impact our understanding of the world around us.

Similar threads

  • General Math
Replies
12
Views
1K
  • STEM Educators and Teaching
4
Replies
136
Views
6K
Replies
18
Views
3K
  • Quantum Physics
Replies
31
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
11
Views
497
Replies
13
Views
1K
Replies
14
Views
2K
  • Quantum Interpretations and Foundations
2
Replies
37
Views
1K
  • Art, Music, History, and Linguistics
Replies
4
Views
981
  • General Math
Replies
22
Views
3K
Back
Top