pith. sign in

arxiv: 1203.3125 · v1 · pith:YAAQWY6Rnew · submitted 2012-03-14 · 💻 cs.OH

A Semantic Without Syntax 1

classification 💻 cs.OH
keywords claimhereparadoxsemanticsystemwillappliedaxiomatic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.