Re: What's the weakest metatheory in which Goedel's theorem can be proved?

On Jan 28, 10:21 pm, abo <dkfjd...@xxxxxxxxx> wrote:
On Jan 29, 6:33 am, Rupert <rupertmccal...@xxxxxxxxx> wrote:



Bounded Arithmetic is just about the weakest system in which we can do
any reasonable amount of mathematics.

There is no sense to your thread's title or to this remark.  The
strength of systems is not a well-ordering, and among a class of
systems there may not be a "weakest" system.

The class of systems which logicians generally consider to be
reasonable metatheories in which to reason about object theories is
well-ordered, pretty much, or at any rate certainly well-founded. (You
might consider something like PRA+Con(ZF), perhaps). There might be
some counterexamples, perhaps, such as the weak arithmetic you've been
investigating. It doesn't matter. The title of the thread and my
statement were reasonable.
.

Relevant Pages