Re: Implementable Set Theory and Consistency of ZFC
- From: Han de Bruijn <Han.deBruijn@xxxxxxxxxxxxxx>
- Date: Thu, 11 Oct 2007 16:21:48 +0200
aatu.koskensilta@xxxxxxxxx wrote:
Notice that if HdB is right, he'll have shown that
ZF-Infinity is finitely axiomatizable, which doesn't
seem right at all (since after all, not even PA is
finitely axiomatizable).
Why doesn't it seem right? Recall that there are conservative
extensions of PA that are finitely axiomatisable.
There's an update of the paper (mainly correcting some minor errors):
http://hdebruijn.soo.dto.tudelft.nl/jaar2007/set_theory.pdf
Han de Bruijn
.
- Follow-Ups:
- Re: Implementable Set Theory and Consistency of ZFC
- From: hagman
- Re: Implementable Set Theory and Consistency of ZFC
- References:
- Implementable Set Theory and Consistency of ZFC
- From: Han de Bruijn
- Re: Implementable Set Theory and Consistency of ZFC
- From: lwalke3
- Re: Implementable Set Theory and Consistency of ZFC
- From: aatu . koskensilta
- Implementable Set Theory and Consistency of ZFC
- Prev by Date: differential equations
- Next by Date: Re: Artificial Intelligence research problems
- Previous by thread: Re: Implementable Set Theory and Consistency of ZFC
- Next by thread: Re: Implementable Set Theory and Consistency of ZFC
- Index(es):