Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
NCTM or The Math Forum.


Math Forum
»
Discussions
»
sci.math.*
»
sci.math
Notice: We are no longer accepting new posts, but the forums will continue to be readable.
Topic:
Formally Unknowability, or absolute Undecidability, of certain arithmetic formulas.
Replies:
22
Last Post:
Jan 29, 2013 8:21 PM



fom
Posts:
1,968
Registered:
12/4/12


Re: Formally Unknowability, or absolute Undecidability, of certain arithmetic formulas.
Posted:
Jan 28, 2013 2:06 AM


On 1/27/2013 11:22 AM, Nam Nguyen wrote:
> In this thread, we propose a solution to this differentiation > difficulty: semantic _reinterpretation_ of _logical symbols_ .
It sounds more like "coordinated interpretation."
That is what mathematical realism is already doing. The existence quantifier is cointerpreted with some notion of truth. This is the historical debate from description theory addressing presupposition failure.
One of the foundational insights of Frege's researches was to interpret contradiction existentially. In contrast, Kant interpreted contradiction modally. This would suggest nonexistence and impossibility are already coordinated in such a way that the two forms of logic branch at the outset.
There are, of course, intensional logics that mix the senses of these logics. This is where the terms "de re" and "de facto" find their nuanced meanings in relation to quantifieroperator order.
No one, of course, has tried to use anything like an arithmetical numbering to provide correlated, but distinct, model theories to interpret a single situation (quantificational logic) so as to eliminate irrelevant modal possibilities.



