Abstract

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.