We're not talking about models here, though. We're talking about domains of discourse. — fishfry
model theory is not relevant to this conversation as I understand it. — fishfry
The question was:
wouldn’t the statement or conclusion «there is no set of all sets» be all-inclusive in one way or another if it really is true? — Sunner
"all inclusive in one way or another" is not definite. My choice was to give a mathematically definite framework for the the question. I surely do not presume to guarantee that I know what the poster in particular had in mind, but I responded correctly vis-a-vis the best way I know to make the question mathematically definite.
in general, there is an operation of unrestricted complement. — fishfry
Not in set theory (as I see you agree). And (just to be clear) in class theory, only with sets, not proper classes.
The complement of the set {1,2,3}, within set theory, is the collection of all sets that are not {1,2,3}. That complement is a well-defined collection, but it's not a set. — fishfry
It is a proper class (as you mention also) in class theory. In set theory, it doesn't exist. Clearly, the context of my posts was set theory.
I looked up Domain of Discourse on Wikipedia, and they did indeed say a domain of discourse is a set. I assumed they were mistaken, and were simply using "set" in its everyday, casual meaning, without regard for the issues of set-hood versus proper classes.
So I agree that if I looked it up, I'd find at least one source, namely Wiki, that claims a domain is a set. I just think they're wrong, and gave many examples to show why. — fishfry
Wikipedia is unreliable for mathematics (and other subjects). But it happens to be correct on this matter. And you don't need to wonder whether it's just a fluke of Wikipedia. Look in any textbook in mathematical logic or model theory. Or any PDF book or class notes on the Internet. The universe (aka 'the domain of discourse') for a model is a set.
any model of set theory has as a set, not a proper class, as its domain of discourse. For any model, the universal quantifier ranges over the members of the domain of discourse, which is a set.
— TonesInDeepFreeze
You are saying that when I make a statement such as, "Every set has a powerset," I am really saying:
1. I assume ZF is consistent.
2. By Gödel's completeness theorem, if ZF is consistent it has a model, which is a set.
3. The powerset axiom is implicitly quantifying over that set. — fishfry
No, I am definitely not saying that.
Phrases such as "quantifier ranges over" are not definite. To pin them down to a definite mathematical formulation, we turn to the mathematical logic. The method of models gives us definite formulations. A quantifier ranges over a universe. But what is that universe? Well, a universe is the carrier set for a model. So, per any given model, the quantifier ranges over the universe of that model.
In what I said, there is no need for an assumption that set theory has a model or is consistent. There is a crucial between (1) a model for the language of a theory and (2) a model of the theory:
(1) M is a model for a language L iff [fill in the definition here, in outline: M is a non-empty set together with a mapping of the non-logical symbols to (elements of the universe, n-ary functions on the universe, and n-rary relations on the universe)]
(2) M is a model of a theory T iff (M is a model for the language of T & every theorem of T is true in M)
Of course, if a theory is inconsistent, then there are no models of that theory. But whether or not a theory is consistent, there are models for the language of the theory.
To mention that a quantifier ranges over a universe per a model requires only (1) and no consideration whether any given model is or is not a model of the theory.
set theory can not prove its own consistency. — fishfry
Yes, if set theory is consistent, then set theory does not prove that set theory is consistent. Nothing I've said contradicts that.
The claim that every set has a powerset is true whether or not set theory has a model. All that is required is the axiom of powersets. — fishfry
No, a sentence is true or not depending on what model we're looking at. Truth is defined per models. The power set axiom is true in some models but false in other models (as you agree). It is true in any model of set theory (since set theory includes the power set axiom) but it is false in other models (ones that are not models of set theory).
Indeed, "Every set has a powerset" is NOT a semantic claim; it's a syntactic one. It follows from the axiom of powersets. There are models lacking the axiom of powersets where the claim is false. — fishfry
A sentence is an uninterpreted syntactical object. Aside from what the word 'claim' means, a sentence is interpreted per models.
And the phrase "models lacking the axiom of powersets" doesn't make sense. Models don't have axioms. Rather, axiomatizations of theories have axioms. What you might mean is "models in which the power set axiom is false".
And "every set has a powerset" is just an English way of saying the power set axiom.
Perhaps we're arguing about syntactic versus semantic domains. — fishfry
I have never read of a "syntactic domain". I don't know what you mean by it.
On the other hand, we can always define unary predicate symbols. For example, in set theory, we can have the predicate symbol 'G' defined by
Gx <-> [fill in the requirements for x being a group]
Then we have universally quantified conditionals:
Ax(Gx -> P)
Note the quantifier ranges over the universe, but it happens that the formula it applies to is a conditional in which x being a group is the antecedent.
So that is a relativization of P to groups.(That's a simplification. Relativizations are recursive so that P and its subformulas are themselves relativized.]
For example, we define a unary predicate symbol 'L' and 'V':
Lx <-> [fill in the requirements for x being constructible]
Vx <-> x=x
So the relativizations such as:
Ax(Lx -> P)
read as "P holds for constructible sets".
and
V = L
for
Ax Lx
And per a given model, 'L' will map to a subset of the universe, and 'V' will map to a subset of the universe (and if the model is a model of "Vx <-> x=x" then V maps to the subset of the universe that is the universe itself).
that impressively buzzword-compliant paragraph — fishfry
I didn't use the terminology to impress anyone with buzzwords. And they are not buzzwords. They are terminology of mathematics.
there is no mention of the domain of discourse. So again, none of this is relevant. — fishfry
It's about models. A model is a domain of discourse along with a function on the nonlogical symbols. So where I mentioned a model, there is a domain of discourse associated with that model. And the paragraph was not meant to address the original question, but rather to give an idea of how notions of proper classes as models are (as I hope I recall correctly) reducible to the syntactical approach of relativizations.
You're perfectly correct that ZFC is consistent if ZF is, but what has that got to do with the conversation? — fishfry
It was added merely as an illustration of an important theorem that comes from relativizations.