Re: Axiom of Pairing, Scheme of Replacement from others
- From: "MoeBlee" <jazzmobe@xxxxxxxxxxx>
- Date: 19 Jan 2007 10:43:59 -0800
Stephen J. Herschkorn wrote:
MoeBlee wrote:
Stephen J. Herschkorn wrote:
Does
(Extensionality, Pairing, Union, Power, Infinity, Comprehension) |-
Replacement?
Which comprehension schema? I take it you don't mean the separation
schema.
Hmm, looking at Halmos, Kunen, and Suppes, it seems to me that
"Comprehension," "Separation," and "Specifcation" (not respectively) all
refer to the same thing:
For any logical formula f wherein the variable "x" is not free, we
have the universal closure of
There exists x such that for all y, y in x iff (y in z and f).
From looking at http://en.wikipedia.org/wiki/Axiom_of_separation , I
suspect maybe MB thought I was referring to unrestricted comprehension.
Does anyone do that any more?
I just wanted to make sure, especially since as taken in the sense of
the axiom scyhema of separation, your question seems to be whether Z |-
ZF, while it is famous that it is not the case that Z |- ZF. Am I
missing something here?
MoeBlee
.
- Follow-Ups:
- Re: Axiom of Pairing, Scheme of Replacement from others
- From: Stephen J. Herschkorn
- Re: Axiom of Pairing, Scheme of Replacement from others
- References:
- Axiom of Pairing, Scheme of Replacement from others
- From: Stephen J. Herschkorn
- Re: Axiom of Pairing, Scheme of Replacement from others
- From: G . Frege
- Re: Axiom of Pairing, Scheme of Replacement from others
- From: Stephen J. Herschkorn
- Re: Axiom of Pairing, Scheme of Replacement from others
- From: MoeBlee
- Re: Axiom of Pairing, Scheme of Replacement from others
- From: Stephen J. Herschkorn
- Axiom of Pairing, Scheme of Replacement from others
- Prev by Date: Re: Combinatorial question
- Next by Date: Re: Plus-Minus Notation
- Previous by thread: Re: Axiom of Pairing, Scheme of Replacement from others
- Next by thread: Re: Axiom of Pairing, Scheme of Replacement from others
- Index(es):
Relevant Pages
|
Loading