暂无分享,去创建一个
Here, by introducing a version of "Unexpected hanging paradox" we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support that. In the end, we propose a claim as a question. Based on this claim, having an axiomatic system for computability theory is not possible. In fact we will show that the method applied here could yields us as a generalized result, some Theories like Physic is not axiomatizable.
[1] Timothy Y. Chow,et al. The Surprise Examination or Unexpected Hanging Paradox , 1999, math/9903160.
[2] J. Bregetzer. [The liar]. , 1989, Revue de l'infirmiere.