Too Stupid for My Own Interests
starkid wrote:
eric76 wrote:
Consider the question of whether ∅⊂A for any set A, including A=∅. Trivially, if x∈∅, then x∈A and, equivalently, there is no x∈∅ such that x∉A.
I thought the circle with the line through it represented the null set, so I don't understand why you are positing its having any elements at all.
Every element of ∅ is also an element of every set A. Thus ∅⊂A. If that was not true, then you would be able to find an element in ∅ that is not also in A.
eric76 wrote:
I take it that there is some kind of implicit assumption that the set of all v for which P is true is not a null set.
I think that I understand what you mean now.
Yes, the book defines first order theories as consisting of a non-empty domain and a collection of statements about the the objects constituting that domain.
starkid wrote:
Furthermore, my problems with mathematical logic don't involve writing proofs. There is no reason for me to write mathematical logic proofs. I'm reading the books and working on understanding the proofs in them because I want to understand the logical foundations of math, not, for example, topology or abstract math taken by themselves. The mathematical logic proofs differ from the proofs in these more mainstream sub-disciplines in that they are more fundamental and are more directly based on pure symbolic logic. They are not and cannot be proved with the reasoning used in mainstream math proofs because their whole purpose is to develop that reasoning. For example, one of the theorems in my textbook is:
For every u, for every v, P implies that for every v, for every u, P.
In other words, it is proved that changing the order of universal quantifiers (u and v) has no effect on the meaning of the doubly quantified statement (P). This fact is taken for granted in mainstream math, but, with mathematical logic, it cannot be used to prove other things until it has itself been proven, simple though it is.
For every u, for every v, P implies that for every v, for every u, P.
In other words, it is proved that changing the order of universal quantifiers (u and v) has no effect on the meaning of the doubly quantified statement (P). This fact is taken for granted in mainstream math, but, with mathematical logic, it cannot be used to prove other things until it has itself been proven, simple though it is.
This one seems to be trivially obvious to me. Essentially, if x∈U and x∈V, then x∈U∩V=V∩ U.
The order should not matter as long as the number of quantifiers is countable.
---
The comment about "cannot be used to prove other things" is a rather interesting comment. I have never had much of an understanding of when something was done mathematically and of putting developments in their proper order.
In one class many years ago someone asked the prof about a point that involved the order in which something was done. In particular, he pointed out that such and such theorem was not proven until the middle of the 20th century (in the 1950s, I think) and asked how a great deal of math that has been around for much longer could have been done without that proof. The prof's answer was that prior to that proof, we kind of danced around that missing proof.
Similar Topics | |
---|---|
Frivolous special interests |
30 Mar 2024, 6:10 pm |
Did anyone else grow out of having special interests? |
18 Apr 2024, 6:35 am |
Overwhelmed by so many restricted interests |
14 Feb 2024, 4:41 pm |
Should we inform our romantic interests of our condition? |
28 Mar 2024, 1:05 am |