MHB What does it mean for G to be consistent with Q?

  • Thread starter Thread starter agapito
  • Start date Start date
AI Thread Summary
The discussion centers on the relationship between Golbach's conjecture (G) and Robinson's Arithmetic (Q). It establishes that G is true if and only if Q cannot prove the negation of G (¬G). Additionally, it asserts that G is true if and only if G is consistent with Q. The term "consistent with Q" is clarified to mean that G and Q do not contradict each other, implying that it is impossible to derive both a statement and its negation using G and Q. The soundness of Q reinforces its consistency, providing a foundation for this relationship.
agapito
Messages
46
Reaction score
0
My text if Smith's Godel book. We establish that G (Golbach's conjecture and a Π1 wff of Robinson's Arithmetic Q) is true if and only if Q cannot prove ¬G.

That much is clear. But then it goes on to say:

G is true if and only if G is consistent with Q.

We know that Q is sound (and thus consistent), so can someone please explain what "consistent with Q" means.

Thanks for all help.
 
Technology news on Phys.org
"G is consistent with Q' simply means that G and Q do not contradict each other. That, in turn, means that we cannot use G and Q to prove both statement "T" and statement "not T".
 
HallsofIvy said:
"G is consistent with Q' simply means that G and Q do not contradict each other. That, in turn, means that we cannot use G and Q to prove both statement "T" and statement "not T".

Greatly appreciate your help with this, agapito
 
Dear Peeps I have posted a few questions about programing on this sectio of the PF forum. I want to ask you veterans how you folks learn program in assembly and about computer architecture for the x86 family. In addition to finish learning C, I am also reading the book From bits to Gates to C and Beyond. In the book, it uses the mini LC3 assembly language. I also have books on assembly programming and computer architecture. The few famous ones i have are Computer Organization and...
I have a quick questions. I am going through a book on C programming on my own. Afterwards, I plan to go through something call data structures and algorithms on my own also in C. I also need to learn C++, Matlab and for personal interest Haskell. For the two topic of data structures and algorithms, I understand there are standard ones across all programming languages. After learning it through C, what would be the biggest issue when trying to implement the same data...
Back
Top