Shoenfield
- From: "Anonymous" <anonymous@xxxxxxxx>
- Date: Fri, 26 Aug 2005 10:43:38 GMT
In chapter 2 of Shoenfield's "Mathematical Logic", there is the following
exercise:
5. Let T be the theory with no nonlogical symbols and no nonlogical axioms.
a) Show that ~~(x = x) OR ~(x = x) is a theorem of T not provable without
propositional axioms. [Let f be a mapping from the set of formulas to the
set of truth values such that F(A) = T for A atomic; f(~A) = F; f(A OR B) =
f(B); f(Exists_x(A) = T. Show that if A is provable without propositional
axioms, then f(A) = T.]
I haven't the foggiest clue as to how to get started here. I don't
understand how the 'clue' helps to solve the problem. Heck, I don't even
understand the 'clue': I thought f(A) = T whether or not A is provable.
Could someone please explain how to 'show' the clue and why this proves that
the original formula is not provable without propositional axioms?
Many thanks.
.
- Follow-Ups:
- Re: Shoenfield
- From: H. Enderton
- Re: Shoenfield
- From: Torkel Franzen
- Re: Shoenfield
- Prev by Date: Re: "Friendly Premises"
- Next by Date: Re: Shoenfield
- Previous by thread: completeness and soundness
- Next by thread: Re: Shoenfield
- Index(es):
Relevant Pages
|
|