Can Gödel's Incompleteness Theorems Help Solve Advanced Logic Problems?

  • Context: Graduate 
  • Thread starter Thread starter spenx01
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the application of Gödel's Incompleteness Theorems in solving advanced logic problems, specifically within the context of Peano Arithmetic (PA). The user, an undergraduate philosophy student at METU, seeks assistance with a take-home exam involving complex questions about representability and definability in PA. Key topics include the representation of finite sets, the expressibility of specific sets, and the implications of Gödel sentences in extensions of logical systems.

PREREQUISITES
  • Understanding of Peano Arithmetic (PA)
  • Familiarity with Gödel's Incompleteness Theorems
  • Knowledge of diagonalization and fixed-point theorems
  • Basic skills in formal logic and proof techniques
NEXT STEPS
  • Study the implications of Gödel's Incompleteness Theorems on formal systems
  • Learn about representability and definability in Peano Arithmetic
  • Explore the concept of diagonalization in logical proofs
  • Investigate Tarski's Incompleteness Theorem and its relation to Gödel's work
USEFUL FOR

Philosophy students, logicians, and anyone studying formal systems and their limitations, particularly those interested in Gödel's Incompleteness Theorems and Peano Arithmetic.

spenx01
Messages
3
Reaction score
0
I am a undergraduate philosophy student at METU (Turkey). I took a phd course called Foundations of Logic 2. Our book is Taymond M. Smullyan : “Gödel’s incompleteness Theorems”. I have a take-home exam due to this Friday. I have to solve four questions. Yet, I am unable to solve any of them. If you help me to solve any of these questions, I will be very glad because without this exam I cannot be graduate.


Questions:
NOTE: the overlined “n” – n whith a dash over it – is symbolised as "nn" here because of lack of symbols. Thus, nn =overdashed-n. And, V1 is variable.
1.) a) Prove that all finite sets are representable in PA(Peano Arithmetic).
b) Find a formula F(v1) such that F(v1) expresses the set of even numbers but represent only the set of numbers divisible by six in PA.
c) how can part (b) generalized?
d) Is the set A={n : En[nn] is False} expressible?
e) Find a formula F(v1) which represents N (set of natural numbers) in PA but ∀v1F(v1) is not provable in PA.
2.) Find the mistake in the following “proof”.
Claim : The set P of Gödel numbers of sentences provable in PA is not representable in PA.
Proof : Assume on the contrary that there is a formula H(v1) which represents P:
n∈P ↔ PA ⊢ H(nn)
let X be a fixed point of the formula ~H(v1), that is;
PA⊢X ≡ ~H(X) --- the second X here is overdashed)
Now,
PA ⊢ X ↔ g(X) ∈ P ↔ PA ⊢ H(X) ↔ PA ⊬ X
A contradiction. Hence P is not representable.
3.) Let S be an extension of the system ( R ). Prove that every representable set A has a Gödel sentence with respect to S.
Hint: First prove that : “If the diagonal function d(x) is acceptable in S, then for every set A representable in S, there is a Gödel sentence for A”. Then show that d is acceptable in S.
4.) Prove : “If the diagonal function d(x) is strongly definable in S and S is inconsistent, then the set P is not definable in S.
 
Physics news on Phys.org
You don't have to repost in multiple forums. In fact, you are not supposed to.

Do you understand your (Peano's) axioms? What have you tried so far?
 
honestrosewater said:
You don't have to repost in multiple forums. In fact, you are not supposed to.

Do you understand your (Peano's) axioms? What have you tried so far?

I understand Peano's axioms. I had taken a metalogic course before. But this time I was unable to attend the classes. I missed most of them. I don't know what to do. I am trying to read all the book from the beginning and solve the exercises. Yet, I think I don't have enough time.
Till now I can only prove Tarsky's incompleteness theorem on my own.
 

Similar threads

  • · Replies 16 ·
Replies
16
Views
3K
  • · Replies 0 ·
Replies
0
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K