Please explain, in terms a brainlet can understand, the implications of Gödel’s incompleteness theorem.
>>10468204we just don't know
for any given set of axioms, there are true statements which cannot be proven using only those axioms
>>10468211This, but also:If a given set of axiom purports to prove any statement, then the set of axioms must be inconsistent.(absolute brainlet here btw, but i think thats right)
>>10468259i think you are confusing this with the second part of theorem, which states that a set of axioms cannot prove it's own consistency. consistent systems of axioms still exist, even if they cannot prove EVERY statement.
>>10468204this >>10468211 but also, if you want to extrapolate it to the final conclusion, it implies there exists an infinite set of axioms, and that math is infinite.
what is an axiom?
>>10468282a statement which we assume to be true, without having to prove it. a self-evident truth.
>>10468204He showed even math isn't 100% foolproof using something like "This statement is false" but with math.
>>10468204In any system of reasoning there are true things we can't prove
>>10468292That's baby's first definition of an axiom, it's really just about coming up with consistent and interesting systems. >>10468531Not really about math but about formal systems, and that's for each individual one. We can come up with different axiomatizations for the same theories. They can even have a completely different foundation.
>>10468204guys guys guys. You are all so very fucking wrong. There are complete axiomatizations, obviously. Jus take all the true arithemtic statements on the natural numbers: boom you just got a (worthless) complete and consistent axiomatization of arithmetic.Why is it worthless? Because generating this axiomatization means writing down every true statement of arithmetic. So let's look at axiomatizations that one can somehow generate with an easy, algorithmic process, i.e.\ such that in principle one can write a program that gives all the axioms of your system. Now does Godel guarantee there are sentences which cannot be proven in this system?Not quite! You see, we can still take a relatively small system (= 'portion of maths'), and try to axiomatize it in an algorithmic way. If the stuff you try to axiomatize is not too complicated, you can do this, e.g.\ the theory of dense linear orders.So when can we Godeljerk on our theory then? Well, if your system is axiomatizable in an algorithmic way _and_ you can express a big enough portion of arithmetic, then there is a sentence in your language which your system cannot prove or disprove, save when your system is inconsistent.
>>10468578what is defined as a "big enough portion of artihmetic"? As in, how would you know where the cut-off is for a system to become incomplete?
>>10468583Well, you go to a proof of Godels theorem and you look at the exact assumptions on the given system. But I know that having Peano Arithmetic is enough to guarantee incompleteness, but that's not the minimum. On the other hand, Presburger arithmetic (addition and induction) is complete. So the cut-off point is somewhere in between.
>>10468204You cannot prove all mathematical truths. There are mathematical claims that are true, but cannot be proven. And you cannot make a computer program that finds out for any mathematical claim whether or not it is true.
>>10468586I see now. thanks for clearing that up!
>>10468204Godel’s Theorem simply says that not all true things are provable.Mathematicians don't actually care about this, btw, because most mathematicians don't care about provability. Instead they care about what's true; not about what's provable for some arbitrary set of axioms.Axioms are "tools" and mathematicians don't really care about them. They are like a microscope is a "tool". Different "tools" will be used, given the usefulness of any given "tool", and they are only useful insofar as to study an actual "thing" which is true.That "thing" being studied is the natural numbers.
>>10468594Does that mean that there are somethings in this world that are true but can never be proven?
>>10468204You can guarantee to be always consistent or always correct, but not both at the same time all the time.
>>10468204>tfw no cute paranoid schizo-physicist bf
>>10468278This. There exists one set of true mathematical axioms that are infinite in cardinality. But it's still just one set. ZFC is part of it and it's true, but that's only 9 axioms of an infinite set of them.
Threadly reminder, please do not post in Godel threads if you do not understand Godel.Thank you.
>>10468259>If a given set of axiom purports to prove any statement, then the set of axioms must be inconsistent.What? No!
>>10468204You can never set axioms so that they are all deductive from each other. In other words, you can never explain everything using only logic. In his god proof, he extrapolates that to our universe. The universe can never be logically explained by itself. However, it exists. Therefore, there must be something beyond the universe (and beyond logic). That something is God.
>>10469339>>10468266guys, *any* statement means some statement P and also Not P, since Not P is just anoter statement.If a set of axioms can prove *any* statement it is inherently inconsistent
>>10469347Yes but don't constructivists deny the law of excluded middle?
>>10468211I never liked this explanation. To someone uninitiated, it seems like it presupposes that there is an objective truth value to every statement. It's confusing, because it doesn't seem obvious a priori whether something like the Continuum Hypothesis should be true or not.IMO, a better way to explain it:"For certain sets of axioms (recursively enumerable, first order systems capable of modelling the natural numbers) there exists a statement that is true in some models and false in some (if the system is consistent)". Just to give some intuition, here's a dumb example of what it means for a statement to be "true in some models and false in some". Note that it's not actually connected to Gödel.Given the axioms of a ring(https://en.wikipedia.org/wiki/Ring_(mathematics)#Definition), does there exist an element x such that x^2=-1? The answer is clearly, it depends. In the complex numbers it's true, but it's false in the reals, for example.So we have at least one model where the statement is true, and at least one where the statement is false. So clearly, the statement is not provable from the axioms of a ring. What Gödel's theorem says is that for "sufficiently powerful axioms" there are always, inevitable, statements like that (assuming consistency). An inconsistent system, on the other hand, is a system capable of both proving and disproving (simultaneously) every statement you can possibly form. So it's completely useless. I also want to mention Gödel's completeness theorem, another theorem of Gödel which is just as important but not mentioned as much. What Gödel's completeness theorem states is that the statements provable from a set of axioms are PRECISELY the statements that are true in EVERY model.
>>10468204Implications are pretty useless, like you can construct useless propositions like "this statement can't be proved".
>>10469517Go ahead and write that statement in formal logic then.
>>10468615Yes, like God
>>10469522There's no point to do useless things.
You're not done until the final statement titles it. Not with certainty. It's otherwise a matter of collusion. Like that black judge and ocasio cortez fucking on cam for ppl to "indulge" his a rimony as just lovers righta. The nudes were on b.She tiyled it with fucking and reading the guy the law like they were Miranda rights.