Article View: sci.logic
Article #33Re: Impredicativity - was: Russell's Paradox.
From: Andrew Dabrowski
Date: Mon, 02 Nov 1992 03:56
Date: Mon, 02 Nov 1992 03:56
21 lines
1401 bytes
1401 bytes
wft@math.canterbury.ac.nz writes: Some conception of the iterative hierarchy seems unavoidable as the intended model of ZF, which in turn seems unimpeachable as formalizing the basic Cantorian ideas. All the same, I have a lingering sympathy with Gudeman's objection that this has not yet perhaps been *completely* demonstrated, and that there may still be some way of approaching set theory less restrictively than size limitation or the iterative hierarchy. I should say I think it exceptionally *unlikely* that any such approach will be found, (as do most mathematicans), but it seems to me the possibility cannot yet be totally dismissed. I write: What about Aczel's AFA? I don't think there's any profound difficulty pointed up by Russell's paradox, no more so than in trying to solve x=x+1. Aczel has shown that there's a very nice, natural set theory
Technical Details
Message-ID:
<Bx2LMu.GKp@usenet.ucs.indiana.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!know!hri.com!spool.mu.edu!sol.ctr.columbia.edu!usenet.ucs.indiana.edu!zuni!dabrowsaReferences:
<Bx2ALr.3Az@cantua.canterbury.ac.nz>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!know!hri.com!spool.mu.edu!sol.ctr.columbia.edu!usenet.ucs.indiana.edu!zuni!dabrowsa From: dabrowsa@zuni.ucs.indiana.edu (Andrew Dabrowski) Newsgroups: sci.logic Subject: Re: Impredicativity - was: Russell's Paradox. Message-ID: <Bx2LMu.GKp@usenet.ucs.indiana.edu> Date: 2 Nov 92 03:56:54 GMT References: <Bx2ALr.3Az@cantua.canterbury.ac.nz> Sender: news@usenet.ucs.indiana.edu (USENET News System) Organization: Indiana University Lines: 21 Nntp-Posting-Host: zuni.ucs.indiana.edu