Too fast. Why? — Banno
What can you assume in natural deduction?
In natural deduction, to prove an implication of the form P ⇒ Q, we assume P, then reason under that assumption to try to derive Q. If we are successful, then we can conclude that P ⇒ Q. In a proof, we are always allowed to introduce a new assumption P, then reason under that assumption.
But I can see how we might have different pictures of mathematics, which are despite that functionally equivalent: one of maths as a series of axiomatic systems, the other as a language that becomes increasingly complex as new formation rules are added. — Banno
Need to take a break so we don't post over each other. Yes, ND is just deduction. But in ND, any theorem can be taken as axiomatic, to be discharged as the deduction proceeds. As I say, they are functionally equivalent. — Banno
Mathematicians don't use formal logic. — fishfry
I don't see how ND can add anything to mathematical practice, nor relieve us of the need to start somewhere by writing down our axioms. — fishfry
SO the lesson might be that when the love of axioms tried to tighten up mathematics, it ended up toppling the axioms. — Banno
I suspect that in mathematics any true formula can serve as an axiom form which to develop more cool mathematics. That's quite a different thing to an axiom in logic. — Banno
No axioms. That's pivotal. Instead there is a rule of assumption: one can introduce any proposition on chooses at any time, and rules for deriving more theorems from those assumptions — Banno
Quick question: why can't we throw out self reference with regard to Gödel like they did with Russell's paradox? — Gregory
Self-reference has a problem, if you want to think about it in terms of "I am not provable" sort of approach. A well-formed formula cannot refer to itself. Moreover, a formula cannot refer to the meta-theory (which is where proofs exist).
What Gödel did was two things:
1. Internalize the meta-theory into the natural numbers via coding, and show that this internalization is very robust.
2. Showed that there is a sentence with Gödel number n, whose content is exactly "the sentence coded by n is not provable".
The importance is in both points. They allow us both (limited) access to the meta-theory and the proofs; as well circumvent the problem of being a well-formed formula while still referring to itself. And while the importance of the incompleteness theorem is mainly in the fact that it shows there is no reasonable way to have a finitary proof-verification process to mathematics, and also prove or disprove every sentence; the proof itself is also important because it gives us the internalization of the meta-theory into the natural numbers.
Unless you mean that we can introduce our axioms in an ad hoc manner, for example, saying "if we assume the axiom of unions and we have sets X and Y then we can conclude that there a set X union Y. Is that what you mean by not having axioms? — fishfry
It needs to be borne in mind that mathematics is ultimately a system, game-like in nature, where we have complete freedom to choose our starting premises aka axioms.
— TheMadFool
This is exactly the view that Gödel opposed. He believed that mathematics is objective; that mathematical truth is something that we study, not something we make up. If the axioms don't settle a given mathematical question, that's the fault of the axioms. There is truth "out there" waiting to be discovered. — fishfry
I so mean.
But we call them assumptions. — Banno
A deduction in a Hilbert-style deductive system is a list of formulas, each of which is a logical axiom, a hypothesis that has been assumed for the derivation at hand, or follows from previous formulas via a rule of inference. The logical axioms consist of several axiom schemas of logically valid formulas; these encompass a significant amount of propositional logic. The rules of inference enable the manipulation of quantifiers. Typical Hilbert-style systems have a small number of rules of inference, along with several infinite schemas of logical axioms. It is common to have only modus ponens and universal generalization as rules of inference.
Natural deduction systems resemble Hilbert-style systems in that a deduction is a finite list of formulas. However, natural deduction systems have no logical axioms; they compensate by adding additional rules of inference that can be used to manipulate the logical connectives in formulas in the proof.
One of the reasons why some, like Gödel I suppose, believe math is discovered is how math seems to,
1. Describe nature (math models e.g. Minkowski spacetime)
2. Describe nature accurately (we can make very precise predictions to, say, the 15th decimal place) — TheMadFool
was thinking of the Platonic reality of a very large universe of sets, and was not thinking about the utility of set theory in physics. On the other hand he did do some work in relativity, so who knows — fishfry
The literature, in making Gödel a Platonist, a Kantian, a Cantorian, and so forth, seems to have overlooked this possibility. We choose to view Gödel as a unique philosopher and not try to classify him. — Harold Ravitch
My sense is that these mundane physical considerations were not on Gödel's mind. He believed in the Platonic existence of abstract sets including large cardinals, sets far too large to be of any conceivable interest to the real world. See
2.4.4 Gödel’s view of the Axiom of Constructibility
.
I really can't say what Gödel thought about or believed, since apparently he initially thought the axiom of constructability (the claim that the constructible universe includes all sets) was true, then came to doubt it. But my sense is that he was thinking of the Platonic reality of a very large universe of sets, and was not thinking about the utility of set theory in physics. On the other hand he did do some work in relativity, so who knows. — fishfry
Update: he retired from teaching in 2019. Look: https://www.coursicle.com/lavc/professors/Harold+Ravitch/
So, for more than 50 years he was a teacher. Probably he has a lot of papers related to this — javi2541997
The question then is, is math discovered or invented? — TheMadFool
I'll come out straight up and say that my own prejudice is that maths is made up as we go along, but I will admit that I do not have sufficient background to argue saliently for this position. I doubt anyone in this forum does — Banno
I can find only two papers, neither related to this topic. If he taught at a community college it might have been difficult to do research and publish. — jgill
Way above my paygrade! Thanks though. I hope to advance my knowledge in math ASAP. — TheMadFool
It's trivial stuff, but may not have been around before — jgill
Probably there are different versions of him to be consider of: Platonism, realism, relativism, etc... — javi2541997
Above mine too actually. My point was that Gödel apparently believed in an expansive view of the set-theoretic universe, and that his Platonism was probably motived by that and not by practical considerations such as its use in physics.
FWIW Gödel cooked up a model of set theory called the constructible universe, in which the axiom of choice and the continuum hypothesis are true. That shows that they're consistent with ZF.
So why not just adopt the axiom that the constructible universe is the true universe of sets? If you did that, AC and CH would be theorems and we'd be done. The reason this assumption is not made is that most set theorists believe that the true universe of sets (if there even is such a thing) has way more sets in it than just the constructible ones. Gödel apparently first believed that the constructible universe was the true universe, and later came to not believe that. — fishfry
From what I could glean from Wikipedia, a constructible set is one which can be, well, constructed via set theoretic operations — TheMadFool
My sense is that these mundane physical considerations were not on Gödel's mind — fishfry
It seems that for Gödel, being consistent and being true are inseparable; that mathematical truth is displayed in mathematic's empirical applicability; and that hence the consistency of mathematics shows that it is empirically applicable and hence incompatible with the syntactic view. — Banno
Some of it is. — jgill
Contra that, in the item I cited, there are mentions of empiricism and the example of the applicability of the mathematics of elasticity to engineering a bridge; see (3) here. — Banno
so again:
It seems that for — Banno
, being consistent and being true are inseparable; that mathematical truth is displayed in mathematic's empirical applicability; and that hence the consistency of mathematics shows that it is empirically applicable and hence incompatible with the syntactic view.
— Banno
So if we trust this secondary source - I have no reason not to - Gödel held something like that we can speak of mathematical propositions being true because they are empirically applicable; — Banno
that truth is at a meta-level to the mathematics itself; and that together these show that maths is not just stuff we make up. — Banno
The exact argument remains opaque, but that is the implication. — Banno
Get involved in philosophical discussions about knowledge, truth, language, consciousness, science, politics, religion, logic and mathematics, art, history, and lots more. No ads, no clutter, and very little agreement — just fascinating conversations.