Article View: sci.logic
Article #298Re: Impredicativity - was: Russell's Paradox
From: Vaughan R. Pratt
Date: Thu, 05 Nov 1992 17:45
Date: Thu, 05 Nov 1992 17:45
11 lines
1178 bytes
1178 bytes
In article <1992Nov5.164251.29649@guinness.idbsu.edu> holmes@garnet.idbsu.edu (Randall Holmes) writes: >You do not "weaken" FA to AFA; ZFC- + FA and ZFC- + AFA are both >stronger than ZFC-, but neither is stronger than the other. I guess this must be another of my misconceptions. My general impresssion was that AFA was automatically true under FA, by virtue of the latter saying that only "unwound" graphs were permitted, and that every chain on the unwinding had to terminate. So what's an example FA situation contradicting AFA? -- Vaughan Pratt There's no truth in logic, son.
Technical Details
Message-ID:
<1992Nov5.174527.22908@CSD-NewsHost.Stanford.EDU>Path:
arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!CSD-NewsHost.Stanford.EDU!Sunburn.Stanford.EDU!prattReferences:
<Bx693z.H37@cantua.canterbury.ac.nz> <1992Nov4.073717.22625@CSD-NewsHost.Stanford.EDU> <1992Nov5.164251.29649@guinness.idbsu.edu>Show Full Headers
Complete Article Headers
Newsgroups: sci.logic Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!CSD-NewsHost.Stanford.EDU!Sunburn.Stanford.EDU!pratt From: pratt@Sunburn.Stanford.EDU (Vaughan R. Pratt) Subject: Re: Impredicativity - was: Russell's Paradox Message-ID: <1992Nov5.174527.22908@CSD-NewsHost.Stanford.EDU> Sender: news@CSD-NewsHost.Stanford.EDU Organization: Computer Science Department, Stanford University. References: <Bx693z.H37@cantua.canterbury.ac.nz> <1992Nov4.073717.22625@CSD-NewsHost.Stanford.EDU> <1992Nov5.164251.29649@guinness.idbsu.edu> Date: Thu, 5 Nov 1992 17:45:27 GMT Lines: 11