You are viewing the historical archive of The Philosophy Forum.
For current discussions, visit the live forum.
Go to live forum

TonesInDeepFreeze

Comments

Which axioms of finite set theory do you think are false? Sorry, that was a stupid question. You don't know any axioms.
May 29, 2021 at 04:22
We prove from axioms. "constitutes" is your word. An element is an x such that there exists a y such that xey. In set theory, every x is an element of...
May 28, 2021 at 14:21
For sets with cardinality greater than 1: It's not that sets don't have orderings. It's that sets have many orderings (though in some cases we need a ...
May 28, 2021 at 02:05
No, I said "possibly". No, I'm not. I'm moving to a different metaphor. Exactly. You unnecessarily change the names and symbols for the examples. I ac...
May 27, 2021 at 23:07
I don't want to have to spell or copy/paste those long place names every time in discussion. Let ExUx stand for "there exists a black dog in Land U" a...
May 27, 2021 at 19:04
I don't know what specifically MU has in mind that I said, but I have not said anything that could be correctly paraphrased as "There are not many way...
May 27, 2021 at 03:37
And it's not a meaningful comparison to what I said. So we'll disregard your comment about it, after I've pointed out it was not apropos. So we'll dis...
May 27, 2021 at 03:22
Correct. What you're asking requires that I repeat myself. To prove ExBx, the prover might end early. To prove ~ExBx, the prover cannot end early. Agr...
May 26, 2021 at 06:46
So? it doesn't vitiate anything I said nor show a basis for your sarcasm. The facts are the same. But the question is not what the facts are, but what...
May 26, 2021 at 03:35
I really don't get you. I didn't claim that I was "nice" to do that. Only that you said that the question was not "Which is easier to prove: ExBx or ~...
May 26, 2021 at 02:43
Yes. But that doesn't vitiate anything I've said. I don't see a basis for your sarcasm. The thread didn't start with "black dog" and went for a while ...
May 26, 2021 at 01:13
In set theory, 'everything' doesn't name a thing. Rather, 'everything' is used for quantification. (1) Suppose ExAy yex. ("There exists an x such that...
May 25, 2021 at 18:17
An existential vs its negation. I used 'black dog' only because it came into the discussion as an example. The juncture in the discussion I have recen...
May 25, 2021 at 14:21
Set theory is one way to axiomatize mathematics.
May 25, 2021 at 03:04
In set theory, numbers are sets. 0 = the empty set 1 = {0} 2 = {0 1} etc. This is not a claim that numbers are "really" sets (whatever "really" might ...
May 25, 2021 at 03:03
Doghouses don't hurt, but they're not necessary. The question was "Which is easier to prove: ExBx or ~ExBx ?" The only way that question makes sense i...
May 25, 2021 at 02:58
That doesn't say that he died by self-imposed starvation.
May 25, 2021 at 01:08
Self-inclusion is not in itself paradoxical. However, three ways to derive a contradiction from a claim that there exists a set whose members are all ...
May 25, 2021 at 01:06
What's controversial about Godel and Turing? What source does that film provide for its claim that Cantor died by suicide?
May 25, 2021 at 01:03
It's too many technicalities to easily summarize. Roughly speaking, primitives: 2-place operation (x y) "pairing" 2-place operation "value of the func...
May 24, 2021 at 03:50
https://thephilosophyforum.com/discussion/comment/535447 I'm having second thoughts about this and I might need to retract that particular argument. T...
May 24, 2021 at 00:25
https://thephilosophyforum.com/discussion/comment/539584 In all cases, it seems to me that, since we are concerned with finding the shortest proof, we...
May 24, 2021 at 00:14
If a flame be a dumpster fire.
May 22, 2021 at 04:58
Or, as Jerry Seinfeld reminds us, taking Silver in the Olympics just means you're the best of all the losers.
May 22, 2021 at 04:57
The original paper is in Jean van Heijenoorts's 'From Frege To Godel'.
May 21, 2021 at 16:10
I don't know, because I got confused by what different people said at StackExchange.
May 21, 2021 at 01:54
Those are my questions to sort out the discussion at StackExchange. You can post it if you want, but I probably won't follow up there or here, as I ex...
May 21, 2021 at 01:49
If I'm not mistaken, Von Neumann formalized without 'element' as primitive in 1925.
May 21, 2021 at 01:40
First, for your questions, these still need to be clearly settled: (1) Given a recursively axiomatizable theory with finitely many axioms, and with 'l...
May 21, 2021 at 01:35
At least for now, I've decided not to post there. There are already too many confusions in the discussions, and I'm not up to sorting through them wit...
May 18, 2021 at 23:29
In the exact sense that the set of recursive sets is a proper subset of the set of recursively enumerable sets. A theory is closed under deduction. Bu...
May 18, 2021 at 02:44
I looked at the description of that book. It's a fun and clever idea.
May 18, 2021 at 02:16
What does that have to do with the relationship between mathematical logic and set theory?
May 18, 2021 at 01:54
The very first sentence in the very first reply to you in that thread: "What does it mean for a theorem to be complete or uncountable?" Please stop us...
May 17, 2021 at 21:12
I would have to think it through. I am simply not caught up in the StackExchange thread.
May 17, 2021 at 21:04
That is incorrect. It is an easy theorem that R is recursive iff (R is recursively enumerable & ~ R is recursively enumerable). A recursive enumeratio...
May 17, 2021 at 21:03
That is incorrect. You have conflated "formula F is independent of axiom set S" with "formula F is an axiom in the axiom set S". Axiomatization is a r...
May 17, 2021 at 20:51
Here, 'computable' is to be taken as 'Turing machine computable'. "If R is recursive then R is Turing machine computable". That has a long and complic...
May 17, 2021 at 20:40
That's a very modest claim. That there is a recursive axiomatization of a theory T entails that it is computable whether any given string is or is not...
May 17, 2021 at 20:28
I am interested to see what people there say about your notion of a 'complete theorem'. I asked you previously: Do you understand the difference betwe...
May 17, 2021 at 20:26
It's too much work for me to try to have you make that quote understandable. If the language is uncountable, then the theory is not recursively axioma...
May 17, 2021 at 20:19
What do you mean by 'computable axiom'? 'recursive axiomatization' is given a rigorous definition. With a theory that is recursively axiomatizable, it...
May 17, 2021 at 20:07
As Miles Davis said to producer Alfred Lion, "Is that what you wanted, Alfred?" Or, just after Davis, Hancock, Carter and Williams laid down "Thisness...
May 17, 2021 at 19:47
Mote and Beam!
May 17, 2021 at 19:34
In an earlier post, when I was editing, somehow I cut a part that is helpful about the axiom schema of separation. I added it back:
May 17, 2021 at 19:24
(1) Start by learning basic symbolic logic, which is the first order predicate calculus. The best textbook I have found is: 'Logic: Techniques Of Form...
May 17, 2021 at 19:20
Given clarity in discussion about it, yes, it is interesting. It's something I have wondered about before. If I have time later, maybe I'll reply on S...
May 17, 2021 at 19:09
For me, mathematical logic and set theory are chicken and egg. To formalize set theory, we use the first order predicate calculus, which is a subject ...
May 17, 2021 at 18:58
I read that.
May 17, 2021 at 01:45
I was going to write: "I should have stipulated that we're talking about finitely axiomatizable theories. Even if the theory is recursively axiomatiza...
May 17, 2021 at 00:38