Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Formally Unknowability, or absolute Undecidability, of certain arithmetic
formulas.

Replies: 22   Last Post: Jan 29, 2013 8:21 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
namducnguyen

Posts: 2,681
Registered: 12/13/04
Formally Unknowability, or absolute Undecidability, of certain arithmetic
formulas.

Posted: Jan 27, 2013 12:22 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In some past threads we've talked about the formula cGC
which would stand for:

"There are infinitely many counter examples of the Goldbach Conjecture".

Whether or not one can really prove it, the formula has been at least
intuitively associated with a mathematical unknowability: it's
impossible to know its truth value (and that of its negation ~cGC) in
the natural numbers.

The difficulty to prove such unknowability, impossibility, is that
there are statements that are similar in formulation but yet are
known to be true or false. An example of such is:

"There are infinitely many (even) numbers that are NOT counter
examples of the Goldbach Conjecture".

The difficulty lies in the fact that there have been no formal
logical way to differentiate the 2 kinds of statements, viz-a-viz,
the unknowability, impossibility.

In this thread, we propose a solution to this differentiation
difficulty: semantic _re-interpretation_ of _logical symbols_ .

For example, we could re-interpret the symbol 'Ax' as the
Specifier (as opposed to Quantifier) "This x", and 'Ex' as
the Specifier "That x". And if, for a formula F written in L(PA)
(or the language of arithmetic), there can be 2 different
"structures" under the re-interpretations in one of which F is true
and the other F is false, then we could say we can prove
the impossibility of the truth value of F as an arithmetic
formula in the canonical interpretation of the logical
symbols 'Ax' and 'Ex'.

(Obviously under this re-interpretation what we'd mean as a language
"structure" would be different than a canonical "structure").

Again, this is just a proposed solution, and "This x" or "That x"
would be not the only choice of semantic re-interpretation.
As long as the semantic re-interpretation makes sense, logically
at least, it could be used in the solution.

But any constructive dialog on the matter would be welcomed and
appreciated, it goes without saying.

--
----------------------------------------------------
There is no remainder in the mathematics of infinity.

NYOGEN SENZAKI
----------------------------------------------------


Date Subject Author
1/27/13
Read Formally Unknowability, or absolute Undecidability, of certain arithmetic
formulas.
namducnguyen
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmeticformulas.
Frederick Williams
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmeticformulas.
namducnguyen
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of
certainarithmeticformulas.
Frederick Williams
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
namducnguyen
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
Jesse F. Hughes
1/27/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
namducnguyen
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
Jesse F. Hughes
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
namducnguyen
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
namducnguyen
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of
certainarithmeticformulas.
Frederick Williams
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
namducnguyen
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
fom
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
Frederick Williams
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
namducnguyen
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certainarithmeticformulas.
ross.finlayson@gmail.com
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain arithmeticformulas.
Michael Stemper
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmeticformulas.
namducnguyen
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain arithmetic formulas.
1/28/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
fom
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
namducnguyen
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
fom
1/29/13
Read Re: Formally Unknowability, or absolute Undecidability, of certain
arithmetic formulas.
Graham Cooper

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.